Public report of ruvnet/RuView, published 25 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 25 October 2026, 21:19 UTC · Survey ID cd_fb0c0a6669ce4a53968733d1c6dda062
ruvnet/RuView
Measured 25 October 2026, 21:12 UTC, at code version fefb0f9
Regression: 1 dimension fell since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAt riskDown 2 since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 357,291 lines of product code in 92 projects, tests not counted · Estimated rebuild effort: about 2.7 person-years · Weakest lens: Accessibility, 41
Findings by how serious they are
159 critical2110 serious653 minor
14 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
25 October 2026, 21:12 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
95of 95 dimensions measured by tools.
2860of 2922 findings point to an exact file and line, so you can open each one in the code. The other 62 concern the repository as a whole, such as missing documentation.
95dimensions across 8 lenses, read from 357,291 lines of product code in 92 projects.
ruvnet/RuView is rated At risk because critical security findings are open. Its score is held back in part because it has controls that only work with a mouse. It scores 51 out of 100, which the At risk rating leaves unchanged.
Accessibility, at 41, is the weakest lens and counts most in the score. The best first steps are adding text alternatives and making the controls keyboard-usable, each worth about 5 points. Raising Accessibility to 70 would lift the score to about 58.
Forty-three known security holes in the packages the code depends on can be used by attackers. Nineteen controls can't be used without a mouse, and sixteen passwords or keys are open to anyone who can read the repository. Making the controls work with a keyboard, updating the vulnerable packages and replacing each exposed password or key would close these risks. Passing outside input through environment variables would fix the four pipeline steps that put outside input straight into a shell command, and the 15 pipeline steps that install packages without pinning their versions need the packages they install pinned to exact versions. The 20 form fields without a label need a label.
The product code is 357,291 lines, about €390,000 to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
If Accessibility rose from 41 to 70, the lowest score rated Strong, the score would rise from 51 to about 58.
Code composition: what the lines of code are
Product code 86%Tests 14%
New since the last survey: 203 findings
These 203 critical or serious findings weren't in the previous survey, on 11 October 2026. The first 100 are listed here, and the findings file in the download package lists them all.
Code Duplication · Edited copy of a member (9 corresponding lines) examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) examples/research-sota/02-placement/r6_2_2_multistatic_placement.py
Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py
Test Quality · Fixed-sleep synchronisation: public SDK accepts spectrum options and returns real UDP amplitude rows harness/ruview/test/sdk-device-options.test.mjs
Test Reliability · Test suite declares a test script but contains no test files: dashboard/
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 446 findings
These 446 critical or serious findings were in the previous survey, on 11 October 2026, and are gone from this one. The first 100 are listed here.
€130,000 to €660,000, for 2,180 to 6,914 hours of work, about 2.7 person-years for 1 to 6 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 51. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 357,291 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Raises the score by about 5 points · Medium effort · Text alternatives
2
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Raises the score by about 2 points · Medium effort · Forms & labels
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 €390,000 to build again, about 2.7 person-years of work. Its weakest lens is Accessibility, at 41 (Weak). Accessibility is about whether the interface is built so that everyone can use it, including people who can't see the screen or can't use a mouse. Because the weakest lens counts most in the score, work on Accessibility also moves the score most.
Based on: the rebuild estimate · the Accessibility grade · how much each lens counts
What to do: Start with the Accessibility actions in Top priorities.
If you do one thing first · First action
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for medium effort. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.8 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 3% to 7% on every change. The history of the code shows how much it changes: about 192,575 lines over the last 90 days, which is about 780,999 lines a year. At that pace, the extra work comes to an estimated 59.3 to 356.1 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture — module dependency graph
Project dependencies, layered top-to-bottom; arrows show direction. Any dashed red edge points upward or sideways — a layering smell or cycle. A clean layered graph has none.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
1150 modules, with 1327 dependencies between them. 8 loops run through 22 of the modules, marked above the diagonal.
The table shows the 40 modules with the most connections; 1110 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.
homecore_api.state uses homecore.homecore, so a change to homecore.homecore can break homecore_api.state, while a change to homecore_api.state can't break homecore.homecore.
Position
Below the diagonal: homecore_api.state uses a module listed above it, which is the healthy direction.
ruview_groundtruth.agreement uses ruview_evidence, so a change to ruview_evidence can break ruview_groundtruth.agreement, while a change to ruview_groundtruth.agreement can't break ruview_evidence.
Position
Below the diagonal: ruview_groundtruth.agreement uses a module listed above it, which is the healthy direction.
ruview_ontology.entity uses ruview_evidence, so a change to ruview_evidence can break ruview_ontology.entity, while a change to ruview_ontology.entity can't break ruview_evidence.
Position
Below the diagonal: ruview_ontology.entity uses a module listed above it, which is the healthy direction.
ruview_ontology.entity uses ruview_ontology.id, so a change to ruview_ontology.id can break ruview_ontology.entity, while a change to ruview_ontology.entity can't break ruview_ontology.id.
Position
Below the diagonal: ruview_ontology.entity uses a module listed above it, which is the healthy direction.
ruview_ontology.entity uses ruview_ontology.provenance, so a change to ruview_ontology.provenance can break ruview_ontology.entity, while a change to ruview_ontology.entity can't break ruview_ontology.provenance.
Position
Below the diagonal: ruview_ontology.entity uses a module listed above it, which is the healthy direction.
ruview_scorecard uses ruview_evidence, so a change to ruview_evidence can break ruview_scorecard, while a change to ruview_scorecard can't break ruview_evidence.
Position
Below the diagonal: ruview_scorecard uses a module listed above it, which is the healthy direction.
wifi_densepose_core.pose_observation_v2 uses ruview_ontology.id, so a change to ruview_ontology.id can break wifi_densepose_core.pose_observation_v2, while a change to wifi_densepose_core.pose_observation_v2 can't break ruview_ontology.id.
Position
Below the diagonal: wifi_densepose_core.pose_observation_v2 uses a module listed above it, which is the healthy direction.
wifi_densepose_core.types uses ruview_attest, so a change to ruview_attest can break wifi_densepose_core.types, while a change to wifi_densepose_core.types can't break ruview_attest.
Position
Below the diagonal: wifi_densepose_core.types uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.detection.pipeline uses wifi_densepose_mat.domain.scan_zone, so a change to wifi_densepose_mat.domain.scan_zone can break wifi_densepose_mat.detection.pipeline, while a change to wifi_densepose_mat.detection.pipeline can't break wifi_densepose_mat.domain.scan_zone.
Position
Below the diagonal: wifi_densepose_mat.detection.pipeline uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.detection.pipeline uses wifi_densepose_mat.domain.vital_signs, so a change to wifi_densepose_mat.domain.vital_signs can break wifi_densepose_mat.detection.pipeline, while a change to wifi_densepose_mat.detection.pipeline can't break wifi_densepose_mat.domain.vital_signs.
Position
Below the diagonal: wifi_densepose_mat.detection.pipeline uses a module listed above it, which is the healthy direction.
28→40 wifi_densepose_mat.detection.pipeline uses wifi_densepose_matpart of a loop✕
Connections
1 pair of types, where a type in wifi_densepose_mat.detection.pipeline uses a type in wifi_densepose_mat.
wifi_densepose_mat.detection.pipeline uses wifi_densepose_mat, so a change to wifi_densepose_mat can break wifi_densepose_mat.detection.pipeline, while a change to wifi_densepose_mat.detection.pipeline can't break wifi_densepose_mat.
Position
Above the diagonal, so it is part of a loop. Neither module can be changed, tested or released on its own until one of these dependencies is removed.
wifi_densepose_mat.domain.triage uses wifi_densepose_mat.domain.vital_signs, so a change to wifi_densepose_mat.domain.vital_signs can break wifi_densepose_mat.domain.triage, while a change to wifi_densepose_mat.domain.triage can't break wifi_densepose_mat.domain.vital_signs.
Position
Below the diagonal: wifi_densepose_mat.domain.triage uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.semantic.bus uses wifi_densepose_sensing_server.semantic.common, so a change to wifi_densepose_sensing_server.semantic.common can break wifi_densepose_sensing_server.semantic.bus, while a change to wifi_densepose_sensing_server.semantic.bus can't break wifi_densepose_sensing_server.semantic.common.
Position
Below the diagonal: wifi_densepose_sensing_server.semantic.bus uses a module listed above it, which is the healthy direction.
ruview_groundtruth.autolabel uses ruview_groundtruth.agreement, so a change to ruview_groundtruth.agreement can break ruview_groundtruth.autolabel, while a change to ruview_groundtruth.autolabel can't break ruview_groundtruth.agreement.
Position
Below the diagonal: ruview_groundtruth.autolabel uses a module listed above it, which is the healthy direction.
ruview_twin.twin uses ruview_evidence, so a change to ruview_evidence can break ruview_twin.twin, while a change to ruview_twin.twin can't break ruview_evidence.
Position
Below the diagonal: ruview_twin.twin uses a module listed above it, which is the healthy direction.
ruview_twin.twin uses ruview_ontology.id, so a change to ruview_ontology.id can break ruview_twin.twin, while a change to ruview_twin.twin can't break ruview_ontology.id.
Position
Below the diagonal: ruview_twin.twin uses a module listed above it, which is the healthy direction.
ruview_twin.twin uses ruview_ontology.provenance, so a change to ruview_ontology.provenance can break ruview_twin.twin, while a change to ruview_twin.twin can't break ruview_ontology.provenance.
Position
Below the diagonal: ruview_twin.twin uses a module listed above it, which is the healthy direction.
ruview_twin.twin uses ruview_ontology.entity, so a change to ruview_ontology.entity can break ruview_twin.twin, while a change to ruview_twin.twin can't break ruview_ontology.entity.
Position
Below the diagonal: ruview_twin.twin uses a module listed above it, which is the healthy direction.
wifi_densepose_engine uses ruview_cognitum_spaces, so a change to ruview_cognitum_spaces can break wifi_densepose_engine, while a change to wifi_densepose_engine can't break ruview_cognitum_spaces.
Position
Below the diagonal: wifi_densepose_engine uses a module listed above it, which is the healthy direction.
wifi_densepose_engine uses ruview_ontology.provenance, so a change to ruview_ontology.provenance can break wifi_densepose_engine, while a change to wifi_densepose_engine can't break ruview_ontology.provenance.
Position
Below the diagonal: wifi_densepose_engine uses a module listed above it, which is the healthy direction.
wifi_densepose_engine uses ruview_unified.control, so a change to ruview_unified.control can break wifi_densepose_engine, while a change to wifi_densepose_engine can't break ruview_unified.control.
Position
Below the diagonal: wifi_densepose_engine uses a module listed above it, which is the healthy direction.
wifi_densepose_engine uses wifi_densepose_core.pose_observation_v2, so a change to wifi_densepose_core.pose_observation_v2 can break wifi_densepose_engine, while a change to wifi_densepose_engine can't break wifi_densepose_core.pose_observation_v2.
Position
Below the diagonal: wifi_densepose_engine uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.domain.survivor uses wifi_densepose_mat.domain.scan_zone, so a change to wifi_densepose_mat.domain.scan_zone can break wifi_densepose_mat.domain.survivor, while a change to wifi_densepose_mat.domain.survivor can't break wifi_densepose_mat.domain.scan_zone.
Position
Below the diagonal: wifi_densepose_mat.domain.survivor uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.domain.survivor uses wifi_densepose_mat.domain.vital_signs, so a change to wifi_densepose_mat.domain.vital_signs can break wifi_densepose_mat.domain.survivor, while a change to wifi_densepose_mat.domain.survivor can't break wifi_densepose_mat.domain.vital_signs.
Position
Below the diagonal: wifi_densepose_mat.domain.survivor uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.domain.survivor uses wifi_densepose_mat.domain.triage, so a change to wifi_densepose_mat.domain.triage can break wifi_densepose_mat.domain.survivor, while a change to wifi_densepose_mat.domain.survivor can't break wifi_densepose_mat.domain.triage.
Position
Below the diagonal: wifi_densepose_mat.domain.survivor uses a module listed above it, which is the healthy direction.
wifi_densepose_privshield.experiment uses ruview_active.control, so a change to ruview_active.control can break wifi_densepose_privshield.experiment, while a change to wifi_densepose_privshield.experiment can't break ruview_active.control.
Position
Below the diagonal: wifi_densepose_privshield.experiment uses a module listed above it, which is the healthy direction.
wifi_densepose_privshield.experiment uses ruview_scorecard, so a change to ruview_scorecard can break wifi_densepose_privshield.experiment, while a change to wifi_densepose_privshield.experiment can't break ruview_scorecard.
Position
Below the diagonal: wifi_densepose_privshield.experiment uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.main uses homecore.entity, so a change to homecore.entity can break wifi_densepose_sensing_server.main, while a change to wifi_densepose_sensing_server.main can't break homecore.entity.
Position
Below the diagonal: wifi_densepose_sensing_server.main uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.main uses homecore_hap.server, so a change to homecore_hap.server can break wifi_densepose_sensing_server.main, while a change to wifi_densepose_sensing_server.main can't break homecore_hap.server.
Position
Below the diagonal: wifi_densepose_sensing_server.main uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.main uses wifi_densepose_signal.ruvsense.field_model, so a change to wifi_densepose_signal.ruvsense.field_model can break wifi_densepose_sensing_server.main, while a change to wifi_densepose_sensing_server.main can't break wifi_densepose_signal.ruvsense.field_model.
Position
Below the diagonal: wifi_densepose_sensing_server.main uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.main uses homecore_api.state, so a change to homecore_api.state can break wifi_densepose_sensing_server.main, while a change to wifi_densepose_sensing_server.main can't break homecore_api.state.
Position
Below the diagonal: wifi_densepose_sensing_server.main uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.main uses wifi_densepose_core.types, so a change to wifi_densepose_core.types can break wifi_densepose_sensing_server.main, while a change to wifi_densepose_sensing_server.main can't break wifi_densepose_core.types.
Position
Below the diagonal: wifi_densepose_sensing_server.main uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.domain.alert uses wifi_densepose_mat.domain.triage, so a change to wifi_densepose_mat.domain.triage can break wifi_densepose_mat.domain.alert, while a change to wifi_densepose_mat.domain.alert can't break wifi_densepose_mat.domain.triage.
Position
Below the diagonal: wifi_densepose_mat.domain.alert uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.domain.alert uses wifi_densepose_mat.domain.survivor, so a change to wifi_densepose_mat.domain.survivor can break wifi_densepose_mat.domain.alert, while a change to wifi_densepose_mat.domain.alert can't break wifi_densepose_mat.domain.survivor.
Position
Below the diagonal: wifi_densepose_mat.domain.alert uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.domain.disaster_event uses wifi_densepose_mat.domain.scan_zone, so a change to wifi_densepose_mat.domain.scan_zone can break wifi_densepose_mat.domain.disaster_event, while a change to wifi_densepose_mat.domain.disaster_event can't break wifi_densepose_mat.domain.scan_zone.
Position
Below the diagonal: wifi_densepose_mat.domain.disaster_event uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.domain.disaster_event uses wifi_densepose_mat.domain.vital_signs, so a change to wifi_densepose_mat.domain.vital_signs can break wifi_densepose_mat.domain.disaster_event, while a change to wifi_densepose_mat.domain.disaster_event can't break wifi_densepose_mat.domain.vital_signs.
Position
Below the diagonal: wifi_densepose_mat.domain.disaster_event uses a module listed above it, which is the healthy direction.
wifi_densepose_mat.domain.disaster_event uses wifi_densepose_mat.domain.survivor, so a change to wifi_densepose_mat.domain.survivor can break wifi_densepose_mat.domain.disaster_event, while a change to wifi_densepose_mat.domain.disaster_event can't break wifi_densepose_mat.domain.survivor.
Position
Below the diagonal: wifi_densepose_mat.domain.disaster_event uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.types uses wifi_densepose_signal.ruvsense.field_model, so a change to wifi_densepose_signal.ruvsense.field_model can break wifi_densepose_sensing_server.types, while a change to wifi_densepose_sensing_server.types can't break wifi_densepose_signal.ruvsense.field_model.
Position
Below the diagonal: wifi_densepose_sensing_server.types uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.types uses wifi_densepose_core.types, so a change to wifi_densepose_core.types can break wifi_densepose_sensing_server.types, while a change to wifi_densepose_sensing_server.types can't break wifi_densepose_core.types.
Position
Below the diagonal: wifi_densepose_sensing_server.types uses a module listed above it, which is the healthy direction.
wifi_densepose_sensing_server.types uses wifi_densepose_sensing_server.main, so a change to wifi_densepose_sensing_server.main can break wifi_densepose_sensing_server.types, while a change to wifi_densepose_sensing_server.types can't break wifi_densepose_sensing_server.main.
Position
Below the diagonal: wifi_densepose_sensing_server.types uses a module listed above it, which is the healthy direction.
wifi_densepose_mat uses wifi_densepose_mat.domain.scan_zone, so a change to wifi_densepose_mat.domain.scan_zone can break wifi_densepose_mat, while a change to wifi_densepose_mat can't break wifi_densepose_mat.domain.scan_zone.
Position
Below the diagonal: wifi_densepose_mat uses a module listed above it, which is the healthy direction.
wifi_densepose_mat uses wifi_densepose_mat.detection.pipeline, so a change to wifi_densepose_mat.detection.pipeline can break wifi_densepose_mat, while a change to wifi_densepose_mat can't break wifi_densepose_mat.detection.pipeline.
Position
Below the diagonal: wifi_densepose_mat uses a module listed above it, which is the healthy direction.
wifi_densepose_mat uses wifi_densepose_mat.domain.triage, so a change to wifi_densepose_mat.domain.triage can break wifi_densepose_mat, while a change to wifi_densepose_mat can't break wifi_densepose_mat.domain.triage.
Position
Below the diagonal: wifi_densepose_mat uses a module listed above it, which is the healthy direction.
wifi_densepose_mat uses wifi_densepose_mat.domain.survivor, so a change to wifi_densepose_mat.domain.survivor can break wifi_densepose_mat, while a change to wifi_densepose_mat can't break wifi_densepose_mat.domain.survivor.
Position
Below the diagonal: wifi_densepose_mat uses a module listed above it, which is the healthy direction.
wifi_densepose_mat uses wifi_densepose_mat.domain.disaster_event, so a change to wifi_densepose_mat.domain.disaster_event can break wifi_densepose_mat, while a change to wifi_densepose_mat can't break wifi_densepose_mat.domain.disaster_event.
Position
Below the diagonal: wifi_densepose_mat uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 50% · Adequate · gated by D2, X4 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2025 — Software Supply Chain Failures
117
High / Critical
A05:2025 — Injection
77
High / Critical
A02:2025 — Security Misconfiguration
18
High / Critical
A07:2025 — Authentication Failures
17
High / Critical
Roadmap
First, ensure all media elements have appropriate text alternatives and captions to support accessibility. Next, make custom controls fully keyboard-operable and ensure every form control and button has a programmatic label. Then, establish proper page structure by declaring language, title, and main landmarks while maintaining correct heading order. Finally, fix structured logging issues by removing interpolated messages to ensure logs are machine-readable.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 159
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 — 2110
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 — 653
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 14
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 95 of 95 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); none rely on LLM judgement. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 95 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 2860 of 2922 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: this repository's production source spans .ts, .tsx, .rs, and our analyzer cannot run the .rs test suite(s) — so no coverage was collected for the repository as a whole. The JavaScript/TypeScript half did build and run, and its own line coverage came back at 85.4% — but that is a figure for one half of the product, and we do not publish a partial one as if it were complete. This is OUR limitation, not a defect in the repo — coverage is excluded from the score rather than counted as a near-zero. In the meantime, produce a coverage report in a standard format (lcov — `vitest --coverage`, `jest --coverage`, `bun test --coverage --coverage-reporter=lcov`, or `nyc`, or lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures and real coverage will be read. You can widen what we reach: optional: produce a coverage report in a standard format (lcov — `cargo install cargo-llvm-cov`, then `cargo llvm-cov --lcov --output-path lcov.info`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then both halves are read on the next scan.
D10 Test Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 777 test(s) behind this row are the ones the JavaScript/TypeScript census could read, and this repository also carries at least 275 test source file(s) (.rs, .py) that it cannot: it reads JavaScript/TypeScript test declarations off disk, so a JUnit/pytest-style suite is invisible to it. Skipped tests, zero-assertion tests and the other quality signals on this row are UNMEASURED in that suite — their absence from the counts above is a gap in this analyzer's language coverage, not a finding that those tests are sound.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares a Python pyproject.toml/REDACTED (pip/uv/Poetry), but the licence verdict published here was taken over its crate dependencies. Nothing was read about its Python dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
D14 License Compliance — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This repository declares package.json, but the licence verdict published here was taken over its crate dependencies. Nothing was read about its npm dependencies' licensing in either direction, and a clean score on this card must not be read as covering them.
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 (45 contributor(s) across 1587 commit(s) sampled, automation and bot accounts excluded). One of them holds 84% of the history; the other 44 hold 0.4% 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.
D19 Documentation Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
D20 ADR Quality — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The ADR lexicon (adr-lexicon-1) covers de, en, it, nl. A record identified as another language, or whose language could not be identified (fewer than 25 words of prose, or no clear winner), is never read with English rules: its missing-section, status, consequence-cost and same-question rules abstain, and only the structural rules (title, single option, dangling link, enforcement field) run.
D21 Naming Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22's deterministic call-shape rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. This says nothing about whether that surface is consistent.
D24 Comment Value — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover the language this repository's product is written in, so it had nothing of the product to read. That is a gap in this analyzer's language reach — not a finding about this repository.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D32 Data Compliance (PII/GDPR) — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `references/script_1.py`, `v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
AC2 Forms & labels — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 33 further occurrence(s) are not listed individually; the score already reflects all 73.
AXR1 Runtime accessibility — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via DockerCompose (REDACTED). compose up failed (exit 17 — an image could not be built) — sensing-server Pulling sensing-server Warning Get "https://registry-1.docker.io/v2/": Forbidden failed to solve: python:3.11-slim-bookworm: failed to resolve source metadata for docker.io/library/python:3.11-slim-bookworm: failed to do request: Head "https://registry-1.docker.io/v2/library/python/manifests/3.11-slim-bookworm": Forbidden; runtime evidence skipped.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
C2 Access Controls — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These authorization controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks authorization controls.
C3 Audit Trail — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These audit controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks audit controls.
C4 Data Retention — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These retention controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks retention controls.
C5 Data-Subject Rights — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These data-subject rights controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks data-subject rights controls.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Python, Rust, Swift, c is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Python, Rust, Swift, c is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
M4 Documentation accuracy — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9). Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
P2 Observability — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 91 further occurrence(s) are not listed individually; the score already reflects all 131.
P8 Schema migrations — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The schema may be created by a runner, a deploy script or a config file outside what this check reads, so an absence here is our blind spot rather than a missing migration strategy. The card abstains instead of scoring. You can widen what we reach: if the schema is created and evolved by a tool this check does not name, naming it lets us teach the detector to read it.
R10 Code Duplication — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 255 further occurrence(s) are not listed individually; the score already reflects all 295.
R4 Test Coverage — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 89 further occurrence(s) are not listed individually; the score already reflects all 129.
R7 Dead Code — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 43 further occurrence(s) are not listed individually; the score already reflects all 83.
X24 Document value interpolated into markup unescaped — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 70 further occurrence(s) are not listed individually; the score already reflects all 110.
X3 Exception handling — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 89 further occurrence(s) are not listed individually; the score already reflects all 129.
X4 Structured logging — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. 512 further occurrence(s) are not listed individually; the score already reflects all 552.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D7 Architectural Integrity: Layering is checked against detected/declared rules — an architecture whose boundaries live in convention or in code review, not in a rule a scanner can read, is not enforced here.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D10 Test Quality: Assertion density is structural — it cannot tell a meaningful behavioural assertion from a trivial one, only that an assertion is present.
D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
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 REDACTED Scanning: REDACTED 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.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D23 Boundary Type-Coupling: Boundary leakage is detected from type references across detected contexts — leaks that flow through primitives, serialization or shared infrastructure may not surface as a typed reference.
D25 ADR Conformance: ADR conformance is the LLM-scored fraction of sampled code that follows recorded decisions — it checks the decisions that were written down and the slices it sampled, not unrecorded rules or the whole tree.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned REDACTED, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D40 Network Egress Confinement: Egress confinement is read from committed Kubernetes manifests — a policy applied out-of-band (cluster-default deny, a service mesh, or a cloud firewall/security group off-repo) is invisible, and a present NetworkPolicy is declared config, not proof the cluster admission-controller actually enforces it at runtime.
D41 Kernel & Syscall Confinement: Syscall/MAC confinement is read from committed manifests — a profile applied by a cluster-wide PodSecurity default or a mutating webhook off-repo isn't seen, and a declared seccomp/AppArmor profile is config presence, not proof the node's kernel actually loaded and enforced it.
D42 Runtime Threat Enforcement: Runtime enforcement is read from committed policy files — a Tetragon/Falco/Kyverno stack installed cluster-wide (Helm release, platform add-on) with no in-repo trace can't be credited, and a committed policy is declared intent, not proof the engine is running and blocking in the live cluster.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC1 Text alternatives: Alt-text is detected structurally — the scan sees that an alternative EXISTS, not whether it meaningfully describes the image, and decorative-vs-missing is judged by attribute shape; runtime-injected images and a non-role=img decorative svg are out of scope. This is accessibility readiness, never a WCAG conformance claim.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC4 Keyboard semantics: Keyboard semantics are inferred from markup attributes — interactivity wired purely in script, focus managed at runtime, and component-level handlers are invisible. A clean result means "no static keyboard-trap shape", not a keyboard-operability proof.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
AX9 CQS / query purity: Handlers are found by interface/name convention — a query handler using neither is not seen. Mutation is a resolved write/publish invocation (SaveChanges/repository/bus), so a write hidden behind a hand-rolled wrapper, reflection, or a string-keyed service locator resolves to a non-persistence type and isn't flagged; it detects that a query writes state, not whether the write is a legitimate read-side cache update. Clean means "no resolved write/publish in a query body", not a proof of CQS purity.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
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.
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.
412 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was wifi_densepose_sensing_server::main at 102. A further 13 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 EntityKind::topic_slug at 21 — they are counted neither in the figure above nor in this dimension's score. 8 files carry no cyclomatic complexity row at all for this reason — every one of their over-threshold methods was excluded, so the exclusion is disclosed nowhere in the file itself: v2/crates/wifi-densepose-sensing-server/src/mqtt/discovery.rs (EntityKind::topic_slug at 21), v2/crates/wifi-densepose-core/src/types.rs (KeypointType::try_from at 18), python/src/bindings/keypoint.rs (PyKeypointType::as_rust at 17), ui/services/websocket.service.js (WebSocketService.setupEventHandlers at 17), v2/crates/homecore-server/ui/js/ws.js (ws.connect.open at 17), and 3 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.
+ 294 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 20 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with wifi_densepose_sensing_server::main (cyclomatic 102), runDoctor (cyclomatic 100), doctor.runDoctor (cyclomatic 99). — 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 20 together lifts Cyclomatic Complexity from 5.6 to about 6.3/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 447 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 1 body over 240 down to 240 or less in Cognitive Complexity — start with wifi_densepose_sensing_server::udp_receiver_task (cognitive 289). — Refactoring it lifts Cognitive Complexity from 2.2 to about 2.6/10.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.6 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
+ 1 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 63 FunctionTooLong finding(s) in God Classes — start with REDACTED (16), NetworkDiscovery.tsx (2), REDACTED (2). — One of this dimension's main actionable groups (63 warning-level).
Resolve the 51 FileTooLong finding(s) in God Classes — start with mat.rs (2), dataset.rs (2), lib.rs (2). — One of this dimension's main actionable groups (51 warning-level).
Resolve the 32 MethodTooLong finding(s) in God Classes — start with demo-data.js (4), LiveDemoTab.js (2), SettingsPanel.js (2). — One of this dimension's main actionable groups (32 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
452 duplicated block group(s) detected. A further 28 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted. 23 of the 480 are in trees this repository does not ship — vendored, example/demo, project-template, fixture and benchmark code — and are ranked below the shipped groups rather than excluded from them: the duplication there is real and is still counted in this dimension's score. The dimensions that publish a production-file census leave those trees out of theirs, so this count is deliberately drawn over the wider population.
+ 149 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 43 Duplicated block (6 lines × 2) finding(s) in Code Duplication — start with embedding.rs (3), mediatek_csi.rs (3), REDACTED (3). — One of this dimension's main actionable groups (43 warning-level).
Resolve the 32 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with mediatek_csi.rs (4), listen_allow.rs (2), optimize.rs (2). — One of this dimension's main actionable groups (32 warning-level).
Resolve the 32 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with heads.rs (3), breathing.rs (2), optimize.rs (2). — One of this dimension's main actionable groups (32 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D5 · Coupling8.2 / 10Strong✓ Tool-verified
What it measures: Whether volatile projects sit underneath others that depend on them (so their churn ripples upward), and whether project dependencies form cycles. A widely-depended-on but stable shared/kernel project is healthy, not penalised.
Method: Dependency cycles via elementary-DFS over real .csproj references, plus Martin instability (afferent/efferent) per project. Exhaustive over the reference graph, deterministic.
Coverage: Exhaustive · type-level: afferent/efferent coupling + cycles computed over every production type — the population is all types, not a name convention.
90 production modules (Cargo+npm+Python), 0 dependency cycle(s), 2 unstable depended-on module(s). Read from the build's own module declarations; 18 module(s) off the main sequence, with abstractness counted on 79 of the 90 (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: nvsim · ×18
Unstable project ruview-certify
Unstable project wifi-densepose-sensing-server
What to do
Resolve the 18 Off the main sequence finding(s) in Coupling. — One of this dimension's main actionable groups (18 warning-level).
Resolve the 1 Unstable project ruview-certify finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Unstable project wifi-densepose-sensing-server finding(s) in Coupling. — One of this dimension's main actionable groups (1 warning-level).
Enforce Coupling in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d5_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
Resolve the 3 Low cohesion finding(s) in Cohesion (LCOM4) — start with REDACTED, radio_ops.rs, stage_v.rs. — One of this dimension's main actionable groups (3 warning-level).
Enforce Cohesion (LCOM4) in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d6_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the code respects its intended layering / architecture rules.
Method: Enforcement rung (Prevented/Verified/Documented) per checkable ADR via Roslyn, plus dependency cycles via the engine shared with D5/AX3. Deterministic, exact.
No mechanizable ADR was identified, so enforcement is not measured. Dependency cycles not checked (no project-reference graph; where this repository's language has an import-cycle lens, cycles are reported there).
Resolve the 326 Classify ADR enforcement finding(s) in Architectural Integrity — start with ADR-001-wifi-mat-disaster-detection.md, ADR-002-ruvector-rvf-integration-strategy.md, ADR-003-rvf-cognitive-containers-csi.md. — One of this dimension's main actionable groups (326 recommendation-level).
Enforce Architectural Integrity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d7_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
7828 test methods: 6616 unit, 1190 integration, 0 BDD, 22 e2e. The JavaScript/TypeScript suite contributes 777 `it`/`test` case(s) across 118 test file(s) declaring at least one; its tier split is read from package names and paths only. The Rust suite contributes 5861 `#[test]` function(s) across 662 file(s) declaring at least one; its unit/integration split is Cargo's own — 125 of those file(s) are integration-test targets under a crate's tests/ directory, and the rest are #[test] functions compiled into the crate they test. The Python suite contributes 1190 test function(s) across 94 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D10 · Test Quality10.0 / 10Stronggated by 5 serious findings✓ Tool-verified
What it measures: Whether the tests truly assert behaviour rather than just running the code.
Method: Per-test assertions, skips, and mock references analyzed via Roslyn; structured skip-reason tags (BUG:/ENV:) separate documented deferrals from debt. Deterministic.
4 skipped (4 with a documented reason), 2 zero-assertion, 3 synchronised by a fixed sleep, no mocking-framework packages referenced (hand-written doubles or no mocking) across 777 tests. Measured on the JavaScript/TypeScript suite only — at least 275 test source file(s) (.rs, .py) went unread, so its test quality is unmeasured and is not in these counts.
Fixed-sleep synchronisation: ESP32 capture receives a live UDP stream on loopback and measures loss · ×3harness/ruview/test/devices.test.mjs:67
No assertions: renders without crashing for each status · ×2ui/mobile/src/__tests__/components/ConnectionBanner.test.tsx:25
Resolve the 3 Fixed-sleep synchronisation finding(s) in Test Quality — start with devices.test.mjs, sdk-device-options.test.mjs, devices.e2e.mjs. — One of this dimension's main actionable groups (3 warning-level).
Resolve the 2 No assertions finding(s) in Test Quality — start with ConnectionBanner.test.tsx, StatusDot.test.tsx. — One of this dimension's main actionable groups (2 warning-level).
Enforce Test Quality in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d10_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Adequategated by 2 critical findings✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
0 flaky across 2 measured tier(s). JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in dashboard/ (0 tests); vitest via `npm ci --ignore-scripts` in examples/frontend/ (11 tests); node:test via `npm ci --ignore-scripts` in harness/homecore/ (27 tests); node:test via `npm ci --ignore-scripts` in harness/ruview/ (286 tests); node:test via `npm install --ignore-scripts` (no lockfile) in harness/ruview-kernel/ (19 tests); node:test via `npm install --ignore-scripts` (no lockfile) in harness/ruview-umbrella/ (4 tests); vitest via `npm install --ignore-scripts` (no lockfile) in harness/wifi-densepose-privshield/ (14 tests); vitest via `npm install --ignore-scripts` (no lockfile) in harness/wifi-densepose-sar/ (14 tests); node:test via `npm ci --ignore-scripts` in integrations/iphone-lidar/web/ (5 tests); jest via `npm ci --ignore-scripts` in tools/ruview-cli/ (2 tests); jest via `npm ci --ignore-scripts` in tools/ruview-mcp/ (112 tests); jest via `npm ci --ignore-scripts` in ui/mobile/): measured (0 flaky); Rust (wifi-veil, 662 test files): measured (0 flaky).
Test suite declares a test script but contains no test files: dashboard/
Test suite cannot be installed from its own lockfile: ui/mobile/
What to do
Resolve the 1 Test suite declares a test script but contains no test files finding(s) in Test Reliability. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Test suite cannot be installed from its own lockfile finding(s) in Test Reliability. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d11_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether dependencies are current, secure, and not bloated.
Method: Manifest scan via dotnet list package across all projects; worst-signal-per-package deduction (saturating for vulnerabilities, capped-linear for deprecation/outdated) per KLoC. Exhaustive, deterministic.
26 outdated, 0 yanked direct Cargo dependencies. 65 of 125 direct crates were graded against crates.io (0 not published there, 60 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Outdated: anyhow · ×26
What to do
Improve Dependency Hygiene — currently 8.7/10. — 26 outdated, 0 yanked direct Cargo dependencies. 65 of 125 direct crates were graded against crates.io (0 not published there, 60 not resolved by a committed REDACTED). Only DIRECT edges are graded: a transitive crate cannot be moved past what its parent's requirement admits, so reporting one would be advice its owner cannot take. A newer release is reported only where this repository's OWN requirement already admits it, so the remedy is `cargo update` and never a manifest edit — which means a release outside the declared range is deliberately NOT charged, because a written-down constraint is a decision rather than a defect. Note that a bare requirement is a CARET, and for a 0.x crate its ceiling is the minor. Whether any crate is UNMAINTAINED is not graded — crates.io publishes no maintenance status, and release age does not stand in for one. Known CVEs in this dependency graph are D30's question, read from REDACTED there.
Detailed fixes: d12_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
0 of 399 shipped crate(s) use a banned license. Licences were resolved from crates.io over the crates a consumer compiles — this repository's REDACTED closed over its manifests' `[dependencies]` and `[build-dependencies]`. Crates it asks for ONLY under `[dev-dependencies]` are excluded: they are not compiled by anything that depends on this repository. This repository publishes itself under MIT, which is its own choice and is not judged here. ★ COVERAGE OF THIS VERDICT: it grades this repository's crate dependencies and nothing else. The repository also declares a Python pyproject.toml/REDACTED (pip/uv/Poetry) and package.json, and the licences of those dependency graphs were NOT read by this pass — a gap in this engine's coverage, not a statement about them. So this result says the graded closure carries no banned licence; it does NOT say this repository's licensing is clear.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: v2/crates/wifi-densepose-sensing-server/src/main.rs (64×102=6528); firmware/esp32-csi-node/provision.py (9×70=630); harness/ruview/src/cli.js (4×95=380) Repeated repair below the complexity floor: v2/crates/wifi-densepose-sensing-server/src/field_bridge.rs (8 of 10 changes were fixes); v2/crates/wifi-densepose-signal/src/ruvsense/multistatic.rs (5 of 5 changes were fixes); v2/crates/wifi-densepose-sensing-server/src/multistatic_bridge.rs (4 of 4 changes were fixes)
Resolve the 19 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED (2), provision.py, cli.js. — One of this dimension's main actionable groups (19 warning-level).
Resolve the 8 Repeated repair finding(s) in Churn × Complexity Hotspots — start with field_bridge.rs, multistatic.rs, multistatic_bridge.rs. — One of this dimension's main actionable groups (8 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
1 deducted task-comment markers across 357291 LoC (0.0/KLoC) → score 10.0. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
Resolve the 1 TodoComment finding(s) in Explicit Debt — start with auth.py. — One of this dimension's main actionable groups (1 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.
1 of 1 documentation facets pass in full. 316 document(s) read across 1 unit(s).
✓ On the Gold path — maintain.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality9.2 / 10Exemplary✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
126 of 323 evaluated ADRs have a defect readable from the log itself (a missing or empty section, no title, a single option, consequences with no cost, no status, a missing enforcement field, a status the log contradicts, a dangling link, an unlinked second decision on one question). How well each record argues its case is not measured.
ADR declares no status · ×124docs/adr/ADR-019-sensing-only-ui-mode.md:1detected by adr-integrity
ADR has no Context section · ×3docs/adr/ADR-269-qualcomm-csi-wire-protocol.md:1detected by adr-integrity
ADR has no Consequences sectiondocs/adr/ADR-092-nvsim-dashboard-implementation.md:1detected by adr-integrity
ADR consequences name no costdocs/adr/ADR-124-rvagent-mcp-ruvector-npm-integration.md:386detected by adr-integrity
✓ On the Gold path — maintain.
Detailed fixes: d20_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether domain types (IDs, enums, value objects) leak across bounded-context boundaries.
Method: Cross-context domain-type leakage via Roslyn structural classification (strongly-typed IDs / value objects) over every public surface. Exhaustive, deterministic, type-level aggregate-boundary check.
Coverage: Bounded contexts derived from NAMESPACE prefix (or graph-inferred where available); cross-boundary domain-type leakage then checked exhaustively over every public member of every type.
What it measures: Whether the code actually follows the decisions recorded in the project's ADRs.
Method: Judged by language model at low temperature against ADRs plus a deterministic structural code summary; findings linked to repo-rooted ADR paths for traceability. Advisory.
8 of 92 build units (Cargo, Python, npm) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
16 finding(s): 0 critical, 16 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
REDACTED
What to do
Resolve the 14 REDACTED finding(s) in Secrets (history) — start with REDACTED (8), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (14 issue-level).
Resolve the 2 High secret finding(s) in Secrets (history) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
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).
77 finding(s): 0 critical, 31 high, 36 medium, 10 low. semgrep hit a parse error in 23 file(s) — `firmware/esp32-csi-node/main/c6_sync_espnow.c`, `firmware/esp32-csi-node/main/ota_health.c` (line 44, line 46, line 48, …), `firmware/privshield/nexmon/patch/veil_patch.c` (lines 143–144), `firmware/privshield/openwifi/veil_openwifi.c` (line 52, line 54, line 57), `references/script_1.py` (line 2), … (+18 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 11 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 17 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 15 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (4), REDACTED (4), REDACTED (3). — One of this dimension's main actionable groups (15 issue-level).
Resolve the 4 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (4 issue-level).
Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (3). — One of this dimension's main actionable groups (3 issue-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
+ 3 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 34 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (34). — One of this dimension's main actionable groups (34 issue-level).
Resolve the 7 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (5), REDACTED (2). — One of this dimension's main actionable groups (7 issue-level).
Resolve the 2 High vulnerability finding(s) in Dependency Vulnerabilities — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
Resolve the 2 High IaC finding(s) in IaC & Container Security — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
Resolve the 14 Medium IaC finding(s) in IaC & Container Security — start with REDACTED (10), REDACTED (2), REDACTED (2). — One of this dimension's main actionable groups (14 warning-level).
Resolve the 2 Low IaC finding(s) in IaC & Container Security — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 recommendation-level).
Detailed fixes: d31_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 942 of the 1121 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 1 Change coupling finding(s) in Change Coupling — start with sensing.service.js. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
Resolve the 8 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (8 warning-level).
Resolve the 4 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (4 warning-level).
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).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether Kubernetes workloads restrict network EGRESS with a NetworkPolicy (or Cilium policy), limiting where a compromised pod can send data or reach a command-and-control server. Presence of committed egress-restricting policy, not runtime enforcement.
Method: Deterministic YAML-manifest inspection (no external tool, no Roslyn — language-agnostic): Kubernetes workloads gate applicability; credits a NetworkPolicy / Cilium policy that restricts egress (policyTypes: [Egress] / egress rules). Reward-leaning (neutral floor climbing to 10, never a deduction — baseline misconfigs stay with D31). Deterministic.
What it measures: Whether Kubernetes workloads confine the kernel boundary — a seccomp profile (RuntimeDefault/Localhost) plus an AppArmor/SELinux mandatory-access-control layer — shrinking the syscall attack surface a container escape would use. Presence of committed confinement config, not runtime enforcement.
Method: Deterministic YAML-manifest inspection (no external tool, no Roslyn): on Kubernetes workloads, credits a seccomp profile (RuntimeDefault/Localhost) and an AppArmor/SELinux MAC layer. Reward-leaning (neutral floor climbing to 10); NotApplicable without workloads. Deterministic.
What it measures: Whether the Kubernetes deployment wires runtime threat enforcement — a detection engine (Tetragon/Falco) and/or an admission-control policy gate (Kyverno / OPA Gatekeeper / PodSecurity). Presence of committed policy, not a runtime guarantee.
Method: Deterministic YAML-manifest inspection (no external tool, no Roslyn): on Kubernetes workloads, credits a runtime threat-detection engine (Tetragon TracingPolicy / Falco) and an admission-control policy (Kyverno / OPA Gatekeeper / PodSecurity). Reward-leaning; NotApplicable without workloads. Deterministic.
Resolve the 1 No runtime threat detection finding(s) in Runtime Threat Enforcement. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d42_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 1 platform declaration(s) and 29 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC1 · Text alternatives1.4 / 10Critical✓ Tool-verified
Other · Accessibility — Whether non-text content carries a text alternative — img/area/input[type=image] have alt, a meaningful svg has a title or aria-label, video has a captions track, and object/embed/canvas have a name or fallback content. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: every img/area/input[type=image] checked for alt, svg[role=img] for a title/aria-label, video for a captions <track>. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: image/media elements — img, area, input[type=image], svg, video, object, embed, canvas — across the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and dynamic-attribute elements are skipped. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is NOT read by any producer, so it contributes no element to this population; where such a frontend is present the card discloses it as an analyzer gap rather than scoring around it.
A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content. (×21) — integrations/iphone-lidar/web/index.html:26, ui/components/PoseDetectionCanvas.js:112, ui/components/SensingTab.js:65, …
What to do
Add a text alternative — alt on images (alt="" for purely decorative ones), a title or aria-label on meaningful svg, an aria-label or inner fallback content on canvas, and a captions <track> on video.
Do you agree with this assessment?
AC2 · Forms & labels5.1 / 10Adequate✓ Tool-verified
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. (×7) — dashboard/src/components/nv-app-store.ts:290, dashboard/src/components/nv-console.ts:260, dashboard/src/components/nv-help.ts:359, …
This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×12) — ui/components/LiveDemoTab.js:167, ui/components/LiveDemoTab.js:219, ui/components/PoseDetectionCanvas.js:101, …
This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. (×18) — ui/components/LiveDemoTab.js:184, ui/components/LiveDemoTab.js:188, ui/components/LiveDemoTab.js:192, …
This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed. — ui/mobile/src/screens/SettingsScreen/ServerUrlInput.tsx:40
This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id. — v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:788
This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. — v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:801
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one. (×5) — dashboard/src/components/nv-home.ts:229, ui/components/LiveDemoTab.js:182, v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:604, …
A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). — dashboard/src/components/nv-inspector.ts:311
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×9) — references/index.html:2, ui/icons/generate.html:2, ui/index.html:2, …
The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en"). (×2) — ui/icons/generate.html:2, REDACTED:2
user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta. — ui/mobile/src/assets/webview/gaussian-splats.html:5
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether interactive behaviour is keyboard-reachable — no click handler on a non-interactive element lacking a role, tabindex and key handler, no element the repo's own CSS styles `cursor: pointer` without giving it any of the three, no unfocusable element whose only binding is a mouse enter/leave pair or a double-click, no positive tabindex, no href-less anchor, no placeholder-href (#/javascript) link acting as a button. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: click handlers on non-interactive elements lacking role+tabindex+key handler, positive tabindex values, and href-less anchors. Components skipped, spreads suppressed. Deterministic, hard fact per element.
Coverage: Population: elements that pose a keyboard-semantics question, in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) — a non-natively-interactive element carrying a click handler, a double-click or hover enter/leave binding, a pointer-only gesture on a tabindex="0" element, or `cursor: pointer` from the repo's own CSS; an href-less or placeholder-href (#, javascript:) anchor; and any element with a positive tabindex. Natively interactive elements used correctly (<button>, <a href>, form controls) are NOT in the population — there is nothing to judge — so a page of nothing but correct controls gives AC4 nothing to measure. Keyboard reachability is judged from the markup, never from a rendered page. ★ An interactive element declared in a tagged-template (html`…`) or hyperscript frontend is NOT in this population — no producer reads either — so an empty population is reported as an analyzer gap, never as "this repository has no interactive elements".
A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler. (×12) — dashboard/src/components/nv-app-store.ts:301, dashboard/src/components/nv-app-store.ts:296, dashboard/src/components/nv-app-store.ts:309, …
This <span> announces itself as a role="switch" and binds a click, but nothing can put focus on it: no tabindex="0" in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabindex="0"="0" and an Enter/Space key handler, or make it a native <button>. If a parent widget owns the keyboard model, that parent must move focus onto the active role="switch" or point aria-activedescendant at it. (×3) — dashboard/src/components/nv-app-store.ts:391, dashboard/src/components/nv-settings-drawer.ts:174, dashboard/src/components/nv-settings-drawer.ts:187
The repo's own CSS styles .head with `cursor: pointer`, so this <div> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler. — dashboard/src/components/nv-help.ts:366
This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close. (×3) — dashboard/src/components/nv-help.ts:422, dashboard/src/components/nv-onboarding.ts:381, dashboard/src/components/nv-settings-drawer.ts:135
An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action. (×2) — dashboard/src/components/nv-home.ts:263, dashboard/src/components/nv-settings-drawer.ts:261
This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close. (×5) — ui/utils/data-export.js:53, v2/crates/wifi-densepose-privshield/ui/veil-console.html:536, v2/crates/wifi-densepose-privshield/ui/veil-console.html:542, …
A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler. (×6) — v2/crates/wifi-densepose-desktop/ui/src/pages/Dashboard.tsx:291, v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1111, v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1707, …
An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action. (×6) — v2/crates/wifi-densepose-privshield/ui/veil-console.html:527, v2/crates/wifi-densepose-privshield/ui/veil-console.html:528, v2/crates/wifi-densepose-privshield/ui/veil-console.html:529, …
What to do
Make custom controls keyboard-operable (role + tabindex + key handler), drop positive tabindex, and give anchors a real href.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
<div> moves — its inline style sets `animation: gradient-shift 4s ease infinite` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — v2/crates/wifi-densepose-desktop/ui/src/App.tsx:129
<div> moves — its inline style sets `transition: width 0.3s ease` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. (×2) — v2/crates/wifi-densepose-desktop/ui/src/pages/FlashFirmware.tsx:320, v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx:714
<div> moves — its inline style sets `transition: transform 0.1s, box-shadow 0.1s` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:930
<span> moves — its inline style sets `animation: isAnimating` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:. — v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:476
`.cmd-palette-input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — ui/style.css:3005
`#scenario-quick-select` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — ui/observatory/css/observatory.css:141
`.setting-row input[type="range"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — ui/observatory/css/observatory.css:522
`.css-in-js input[type="text"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. (×2) — dashboard/src/components/nv-console.ts:92, dashboard/src/components/nv-settings-drawer.ts:111
`.css-in-js .control input[type="range"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — dashboard/src/components/nv-ghost-murmur.ts:194
`.css-in-js input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — dashboard/src/components/nv-palette.ts:45
`.css-in-js input[type="range"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible. — dashboard/src/components/nv-sidebar.ts:97
`.card-glow::before` moves (`animation: gradient-shift 3s ease infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/wifi-densepose-desktop/ui/src/design-system.css:303
`.animate-fade-in` moves (`animation: fade-in 0.25s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/wifi-densepose-desktop/ui/src/design-system.css:414
`.page-transition` moves (`animation: fade-in-scale 0.3s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/wifi-densepose-desktop/ui/src/design-system.css:419
`.stagger-children > *` moves (`animation: fade-in 0.3s ease-out backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/wifi-densepose-desktop/ui/src/design-system.css:424
`.btn-gradient` moves (`transition: box-shadow var(--transition-normal), background-position 0.4s ease, transform var(--transition-fast)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/wifi-densepose-desktop/ui/src/design-system.css:495
`.card.clickable` moves (`transition: transform .12s, border-color .12s, box-shadow .12s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/homecore-server/ui/css/app.css:103
`.btn` moves (`transition: filter .12s, background .12s, transform .05s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/homecore-server/ui/css/app.css:126
`.bar > span` moves (`transition: width .3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/homecore-server/ui/css/app.css:150
`.collapsible > .head::before` moves (`transition: transform .15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — v2/crates/homecore-server/ui/css/app.css:214
`.hc-card` moves (`transition: transform 200ms, border-color 200ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — examples/frontend/src/styles/base.css:137
`.css-in-js .card` moves (`transition: transform 200ms, border-color 200ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — examples/frontend/src/components/StateCard.ts:33
`.css-in-js .card` moves (`transition: border-color 0.15s, transform 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-app-store.ts:112
`.css-in-js .toggle::after` moves (`transition: transform 0.15s, background 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — dashboard/src/components/nv-app-store.ts:216, dashboard/src/components/nv-settings-drawer.ts:95
`.css-in-js .skip-link` moves (`transition: top 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-app.ts:49
`.css-in-js .tier-bar .fill` moves (`transition: width 0.2s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-ghost-murmur.ts:239
`.css-in-js .modal` moves (`transition: transform 0.22s cubic-bezier(0.2,0.7,0.3,1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. (×2) — dashboard/src/components/nv-help.ts:118, dashboard/src/components/nv-modal.ts:43
`.css-in-js .cta` moves (`transition: transform 0.12s, border-color 0.12s, filter 0.12s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-home.ts:70
`.css-in-js .card` moves (`transition: transform 0.12s, border-color 0.12s, background 0.12s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-home.ts:114
`.css-in-js .card` moves (`transition: transform 0.22s cubic-bezier(0.2,0.7,0.3,1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-onboarding.ts:211
`.css-in-js .dot` moves (`transition: background 0.15s, border-color 0.15s, transform 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-onboarding.ts:299
`.css-in-js .crystal.anim` moves (`animation: spin 12s linear infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-scene.ts:73
`.css-in-js .panel` moves (`transition: transform 0.25s cubic-bezier(0.4, 0, 0.2, 1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-settings-drawer.ts:36
`.css-in-js :host` moves (`transition: opacity 0.2s, transform 0.2s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-toast.ts:24
`.css-in-js .pill .dot` moves (`animation: pulse 2s infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce. — dashboard/src/components/nv-topbar.ts:34
What to do
Keep a visible focus style (don't remove the outline without a replacement), guard animation with prefers-reduced-motion, and raise low-contrast colour pairs to at least 4.5:1.
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').
Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.
Other · Architecture — Whether read (query) handlers stay side-effect-free — a query that writes persistent state or raises events breaks CQS and makes reads unsafe to retry, cache, or route to a read replica.
Method: Roslyn scan: CQRS handlers classified query-vs-command by interface (IQueryHandler/ICommandHandler/IRequestHandler<TQuery,TResult>) and name convention (*Query/Get*/Find* vs *Command); each query handler's body checked for persistent-state writes (SaveChanges/repository Add-Update) or event publishes by resolved invocation. Deterministic, type-level, exhaustive over the detected handlers.
Coverage: Population: CQRS handlers identified by IQueryHandler/ICommandHandler/IRequestHandler interface + *Query/Get*/Find*/*Command NAME convention; query purity then checked exhaustively within that set — a query handler using neither convention is invisible, and mutation is a resolved persistence/publish CALL, not full dataflow.
Other · Event Sourcing — Whether the recovery-replay fold is deterministic — state derived purely from each event's own fields, no clock/random/IO on the replay path.
Method: Roslyn syntax scan (event-sourcing gated): Apply/When folds checked for forbidden tokens (DateTime.Now, Guid.NewGuid, Random, IO), stripped of comments/strings. Deterministic, hard fact per fold.
Other · Event Sourcing — Whether domain events stay immutable (private fields, set once) rather than carrying mutable state.
Method: Roslyn scan (event-sourcing gated): persisted events checked for public setters; immutability verified per property/field. Deterministic, hard fact.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add a README to the 48 of 93 project(s) that lack one — worth up to 1 pts.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
docs/validation/2026-08-31-esp32-c6-occupancy-integrity.md names Node.js 4, but the repository declares engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/validation/2026-08-31-esp32-c6-occupancy-integrity.md:44
v2/crates/README.md links to `wifi-densepose-config/`, but `v2/crates/wifi-densepose-config` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — v2/crates/README.md:33
v2/crates/README.md links to `wifi-densepose-db/`, but `v2/crates/wifi-densepose-db` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — v2/crates/README.md:34
v2/crates/README.md links to `wifi-densepose-api/`, but `v2/crates/wifi-densepose-api` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — v2/crates/README.md:69
What to do
Reconcile the README with reality: docs/validation/2026-08-31-esp32-c6-occupancy-integrity.md names Node.js 4, but the repository declares engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`; v2/crates/README.md links to `wifi-densepose-config/`, but `v2/crates/wifi-densepose-config` does not exist; v2/crates/README.md links to `wifi-densepose-db/`, but `v2/crates/wifi-densepose-db` does not exist; v2/crates/README.md links to `wifi-densepose-api/`, but `v2/crates/wifi-densepose-api` does not exist.
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.
`cargo +1.89.0 fmt` invokes cargo fmt in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner's throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one — it enforces nothing, and no other step in this file reads the result. `--check` is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted. — .github/workflows/ruforecast-ci.yml:164
What to do
Add `--check` to the cargo fmt step in `.github/workflows/ruforecast-ci.yml` so a change that is not formatted fails CI, instead of being silently reformatted into a checkout that is thrown away — or, if reformatting the branch is the intent, commit the result back so the fix reaches the repository.
Do you agree with this assessment?
P10 · Library API & versioning6.0 / 10Adequate✓ Tool-verified
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
2274/2707 types (84%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
What to do
Keep implementation types off the public surface (Rust: `pub(crate)`, or keep the module private; Swift: leave it `internal` (the default) instead of `public`) so internals can change without breaking consumers.
Do you agree with this assessment?
P2 · Observability8.7 / 10Strong✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
Only 23/41 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `aether-arena/space`, `harness/homecore`, `harness/ruview`, `harness/ruview-kernel` and 13 more.
`ui/app.js` reports through `console.*` at line 42 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:42
`ui/app.js` reports through `console.*` at line 60 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:60
`ui/app.js` reports through `console.*` at line 63 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:63
`ui/app.js` reports through `console.*` at line 73 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:73
`ui/app.js` reports through `console.*` at line 83 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:83
`ui/app.js` reports through `console.*` at line 91 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:91
`ui/app.js` reports through `console.*` at line 95 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:95
`ui/app.js` reports through `console.*` at line 98 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:98
`ui/app.js` reports through `console.*` at line 140 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:140
`ui/app.js` reports through `console.*` at line 192 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:192
`ui/app.js` reports through `console.*` at line 284 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:284
`ui/app.js` reports through `console.*` at line 288 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:288
`ui/app.js` reports through `console.*` at line 301 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:301
`ui/app.js` reports through `console.*` at line 303 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:303
`ui/app.js` reports through `console.*` at line 310 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:310
`ui/app.js` reports through `console.*` at line 335 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:335
`ui/app.js` reports through `console.*` at line 380 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:380
`ui/app.js` reports through `console.*` at line 403 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:403
`ui/app.js` reports through `console.*` at line 407 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:407
`ui/app.js` reports through `console.*` at line 416 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:416
`ui/app.js` reports through `console.*` at line 423 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:423
`ui/app.js` reports through `console.*` at line 444 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/app.js:444
`ui/sw.js` reports through `console.*` at line 62 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/sw.js:62
`ui/utils/backend-detector.js` reports through `console.*` at line 23 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/backend-detector.js:23
`ui/utils/backend-detector.js` reports through `console.*` at line 42 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/backend-detector.js:42
`ui/utils/backend-detector.js` reports through `console.*` at line 53 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/backend-detector.js:53
`ui/utils/backend-detector.js` reports through `console.*` at line 55 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/backend-detector.js:55
`ui/utils/backend-detector.js` reports through `console.*` at line 66 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/backend-detector.js:66
`ui/utils/backend-detector.js` reports through `console.*` at line 72 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/backend-detector.js:72
`ui/utils/backend-detector.js` reports through `console.*` at line 80 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/backend-detector.js:80
`ui/utils/backend-detector.js` reports through `console.*` at line 83 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/backend-detector.js:83
`ui/utils/idle-manager.js` reports through `console.*` at line 43 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/idle-manager.js:43
`ui/utils/idle-manager.js` reports through `console.*` at line 51 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/idle-manager.js:51
`ui/utils/idle-manager.js` reports through `console.*` at line 75 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/idle-manager.js:75
`ui/utils/mock-server.js` reports through `console.*` at line 221 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/mock-server.js:221
`ui/utils/mock-server.js` reports through `console.*` at line 231 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/mock-server.js:231
`ui/utils/pose-renderer.js` reports through `console.*` at line 102 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/pose-renderer.js:102
`ui/utils/pose-renderer.js` reports through `console.*` at line 103 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/pose-renderer.js:103
`ui/utils/pose-renderer.js` reports through `console.*` at line 104 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline. — ui/utils/pose-renderer.js:104
What to do
Extend structured logging to the remaining runnable modules so everything you run is diagnosable in production.
Route service-code `console.*` output through the module's structured logger (with named fields), so delivery outcomes and failures reach the log pipeline with a level.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
What to do
Dependabot is configured but does not watch `gitsubmodule` — add that `package-ecosystem` entry to REDACTED so those dependencies get the same automatic update and advisory pressure as the ones it already covers.
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.
Do you agree with this assessment?
P5 · DR & Backup7.0 / 10Strong✓ 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
No persistence guard on critical data stores — use Docker named volumes (or your orchestrator's persistent-volume equivalent) so the data store can't be wiped by a container recreate (or, in cloud, set purge-protection / soft-delete / prevent_destroy).
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
`ureq::get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×2) — v2/crates/cog-person-count/src/runtime.rs:61, v2/crates/cog-pose-estimation/src/runtime.rs:84
`reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout. (×3) — v2/crates/ruview-auth/src/login/flow.rs:66, v2/crates/wifi-densepose-cli/src/auth.rs:124, v2/crates/wifi-densepose-cli/src/spaces.rs:78
What to do
Give every client a whole-request bound: `reqwest::Client::builder().timeout(Duration::from_secs(10))` (never `reqwest::get` or `Client::new()`, which have none), ureq's `timeout_global`, or wrap the call in `tokio::time::timeout`; add retry with back-off (`reqwest-retry`'s `RetryTransientMiddleware`, `backoff`) around dependencies that fail.
Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.
Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
`configure_esp32_wifi` is async and calls thread::sleep — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs. — v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:470
`main` is async and calls thread::sleep — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs. — REDACTED:91
`train` is async and calls thread::sleep — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs. — REDACTED:192
`existsSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×3) — harness/homecore/bin/cli.js:157, harness/ruview/src/cli.js:298, harness/ruview/src/cli.js:307
`readFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×7) — harness/homecore/bin/cli.js:161, harness/homecore/bin/cli.js:287, harness/ruview-kernel/bin/cli.js:157, …
`writeFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — harness/ruview-kernel/bin/cli.js:123
`existsSync` in `callback to filter` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — harness/ruview/src/doctor.js:101
`existsSync` in `runDoctor` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — harness/ruview/src/doctor.js:109, harness/ruview/src/doctor.js:143
`readdirSync` in `runDoctor` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — harness/ruview/src/doctor.js:145
`existsSync` in `handler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — harness/ruview/src/tools.js:238
`existsSync` in `runTraining` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — harness/ruview/src/training.js:136
`mkdirSync` in `runTraining` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — harness/ruview/src/training.js:150
`mkdirSync` in `trainCount` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:180
`appendFileSync` in `trainCount` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:209
`openSync` in `trainCount` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — REDACTED:212, REDACTED:213
`closeSync` in `trainCount` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. (×2) — REDACTED:244, REDACTED:245
`appendFileSync` in `child.on("error")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:255
`appendFileSync` in `child.on("close")` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs. — REDACTED:261
What to do
Rust: `.await` the future instead of `block_on` (on a Tokio runtime thread it panics outright) and use `tokio::time::sleep(..).await` instead of `std::thread::sleep`; where synchronous code must run, move it to `tokio::task::spawn_blocking` or `block_in_place`.
TypeScript/JavaScript: use the promise APIs (fs/promises, a promisified child_process.execFile, the async zlib/crypto functions) and await them instead of the *Sync variants.
Do you agree with this assessment?
R1 · Type Safety4.4 / 10Weak✓ Tool-verified
React / JS · Code Health — How much of the frontend is typed TypeScript vs untyped JavaScript.
Method: Frontend file inventory: the share of typed TypeScript vs untyped JavaScript across the source tree. Deterministic, exhaustive over frontend files.
212 typed · 266 plain JS — the untyped files are harness/homecore/scripts/update-manifest.mjs, harness/homecore/scripts/verify-manifest.mjs, harness/homecore/src/brain.js, harness/homecore/src/capabilities.js, harness/homecore/src/guidance.js, harness/homecore/src/hosts/claude-code.js (+260 more).
What to do
Migrate the remaining .js/.jsx files to TypeScript.
React / JS · Code Health — Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm over JS/TS tokens, D-386): a block is reported only where its copies still agree on most of their own identifiers and literals, or were renamed as they were pasted but kept most of their constants, and where the copies carry enough code to stand on their own or the copied extent reaches 30 lines — so a re-implementation sharing neither names nor values, and a small pasted declaration, are both found and deliberately not reported, and a clean R10 is not a claim that nothing was copied.
Method: Near-exact copy-pasted blocks of substantial extent across the frontend (the D4 clone algorithm run over JS/TS tokens). Masking finds the candidates; a block is reported when its copies still agree on most of their own identifiers and literals, or when a renamed copy still agrees on most of its constants, AND the copies carry enough code to stand on their own — or when the copied extent reaches 30 lines. So a re-implementation sharing neither names nor values, and a small pasted declaration, are deliberately not counted. Deterministic.
18 duplicated blocks under ui/ have copies in at least two of the sibling directories components, mobile, observatory, pose-fusion, services, utils — 13 of them are reported below, and 5 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 18 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 18 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 18 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — ui/components/scene.js:55
17 duplicated blocks under the repository root have copies in at least two of the sibling directories harness, integrations, references, scripts, tools, ui (+2 more sibling(s) not listed) — 12 of them are reported below, and 5 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 17 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 17 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 17 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — harness/wifi-densepose-privshield/bin/cli.js:26
17 duplicated blocks under harness/ have copies in at least two of the sibling directories homecore, ruview, ruview-kernel — 16 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 17 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 17 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 17 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — harness/homecore/src/guidance.js:13
6 duplicated blocks under v2/crates/wifi-densepose-desktop/ui/src/ have copies in at least two of the sibling directories components, hooks, pages — 3 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on. — v2/crates/wifi-densepose-desktop/ui/src/components/NodeCard.tsx:125
REDACTED:1147 · REDACTED:451 — the two spans are one implementation copied and then locally edited — 2856 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:1147
scripts/device-fingerprint.js:50 · scripts/through-wall-detector.js:51 — the two spans are one implementation copied and then locally edited — 1805 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/device-fingerprint.js:50
REDACTED:2024 · REDACTED:1358 — the two spans are one implementation copied and then locally edited — 2055 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:2024
REDACTED:1696 · REDACTED:1018 — the two spans are one implementation copied and then locally edited — 1679 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:1696
harness/wifi-densepose-privshield/bin/cli.js:26 · wifi-veil/harness/bin/cli.js:26 — these 2 files are line-for-line copies of one another — 159 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done. — harness/wifi-densepose-privshield/bin/cli.js:26
scripts/passive-radar.js:359 · scripts/rf-tomography.js:239 — the two spans are one implementation copied and then locally edited — 1181 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/passive-radar.js:359
harness/homecore/src/guidance.js:13 · harness/ruview/src/guidance.js:368 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — harness/homecore/src/guidance.js:13
harness/homecore/src/brain.js:9 · harness/ruview/src/brain.js:10 — the two spans are one implementation copied and then locally edited — 1336 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — harness/homecore/src/brain.js:9
scripts/room-fingerprint.js:321 · scripts/stress-monitor.js:264 — the two spans are one implementation copied and then locally edited — 608 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/room-fingerprint.js:321
ui/services/model.service.js:6 · ui/services/training.service.js:7 — the two spans are one implementation copied and then locally edited — 659 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/services/model.service.js:6
scripts/csi-graph-visualizer.js:43 · scripts/mincut-person-counter.js:47 — the two spans are one implementation copied and then locally edited — 719 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/csi-graph-visualizer.js:43
scripts/gait-analyzer.js:47 · scripts/stress-monitor.js:43 — the two spans are one implementation copied and then locally edited — 630 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/gait-analyzer.js:47
tools/ruview-mcp/src/tools/count-infer.ts:18 · tools/ruview-mcp/src/tools/pose-infer.ts:20 — the two spans are one implementation copied and then locally edited — 332 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — tools/ruview-mcp/src/tools/count-infer.ts:18
scripts/material-detector.js:368 · scripts/room-fingerprint.js:369 — the two spans are one implementation copied and then locally edited — 384 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/material-detector.js:368
scripts/device-fingerprint.js:543 · scripts/material-classifier.js:491 — the two spans are one implementation copied and then locally edited — 463 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/device-fingerprint.js:543
REDACTED:314 · REDACTED:115 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it. — REDACTED:314
scripts/rf-tomography.js:462 · scripts/through-wall-detector.js:456 — the two spans are one implementation copied and then locally edited — 378 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/rf-tomography.js:462
tools/ruview-mcp/src/tools/bfld-last-scan.ts:27 · tools/ruview-mcp/src/tools/bfld-subscribe.ts:34 — the two spans are one implementation copied and then locally edited — 216 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — tools/ruview-mcp/src/tools/bfld-last-scan.ts:27
REDACTED:2423 · REDACTED:1692 — the two spans are one implementation copied and then locally edited — 590 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:2423
v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:285 · v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:371 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. — v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:285
scripts/material-classifier.js:499 · scripts/through-wall-detector.js:458 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts/material-classifier.js:499
harness/homecore/src/policy.js:5 · REDACTED:13 — the two spans are one implementation copied and then locally edited — 552 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — harness/homecore/src/policy.js:5
REDACTED:1357 · REDACTED:377 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:1357
harness/wifi-densepose-privshield/src/flywheel.ts:37 · wifi-veil/harness/src/flywheel.ts:37 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another. — harness/wifi-densepose-privshield/src/flywheel.ts:37
tools/ruview-cli/src/http.ts:7 · tools/ruview-mcp/src/http.ts:11 — the two spans are one implementation copied and then locally edited — 342 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — tools/ruview-cli/src/http.ts:7
REDACTED:515 · REDACTED:353 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:515
scripts/csi-spectrogram.js:469 · scripts/csi-spectrogram.js:580 — the two spans are one implementation copied and then locally edited — 311 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — scripts/csi-spectrogram.js:469
v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1577 · v2/crates/wifi-densepose-desktop/ui/src/pages/Nodes.tsx:119 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1577
tools/ruview-cli/src/commands/count.ts:31 · tools/ruview-cli/src/commands/pose.ts:26 — the two spans are one implementation copied and then locally edited — 259 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — tools/ruview-cli/src/commands/count.ts:31
ui/components/scene.js:55 · REDACTED:82 — the two spans are one implementation copied and then locally edited — 325 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/components/scene.js:55
scripts/train-wiflow-supervised.js:471 · scripts/wiflow-model.js:89 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts/train-wiflow-supervised.js:471
scripts/csi-graph-visualizer.js:185 · scripts/mincut-person-counter.js:193 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts/csi-graph-visualizer.js:185
REDACTED:712 · REDACTED:408 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — REDACTED:712
ui/mobile/src/screens/VitalsScreen/BreathingGauge.tsx:8 · ui/mobile/src/screens/VitalsScreen/HeartRateGauge.tsx:9 — the two spans are one implementation copied and then locally edited — 264 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — ui/mobile/src/screens/VitalsScreen/BreathingGauge.tsx:8
scripts/sleep-monitor.js:293 · scripts/stress-monitor.js:258 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported. — scripts/sleep-monitor.js:293
REDACTED:47 · REDACTED:178 — the two spans are one implementation copied and then locally edited — 156 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one. — REDACTED:47
What to do
Act on each finding's own remediation rather than one rule: the move depends on what recurs. Where the copies are executable blocks, give the shared part one home and call it from each site; where they are declarations, a listing, a specialisation already delegating to its base, or one shape repeated per entity, there is no call site and the move is a shared type, a generated set or a factory — sometimes there is nothing to extract.
React / JS · Architecture — Conformance to the detected frontend architecture layout (feature-sliced / layered src) plus cross-package deep-import rules (D-386).
Method: Conformance to the detected frontend layout (feature-sliced / layered src) plus cross-package deep-import rules, over the module graph. Deterministic.
ui/pose-fusion/js/cnn-embedder.js:105 reaches into another package with a relative path (./ruvector_cnn_wasm.js) — import the package by name instead. — ui/pose-fusion/js/cnn-embedder.js:105
What to do
Fix the listed violations: import through public entries (package exports / slice index), never reach into another layer or package's internals.
React / JS · Code Health — Per-function cyclomatic/cognitive complexity from the token-level function scanner (D-386) — real branching, not a regex heuristic.
Method: Per-function cyclomatic/cognitive complexity from a token-level function scanner (real branching, not a regex heuristic), computed over every frontend function. Deterministic.
runDoctor has cyclomatic complexity 98 and cognitive complexity 222; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — harness/ruview/src/doctor.js:63
run has cyclomatic complexity 96 and cognitive complexity 153; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — harness/ruview/src/cli.js:243
main has cyclomatic complexity 90 and cognitive complexity 175; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:1703
parseSpacesOutput has cyclomatic complexity 82 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — harness/ruview/src/spaces.js:80
generateWeakLabels has cyclomatic complexity 69 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:915
animate has cyclomatic complexity 64 and cognitive complexity 140; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx:447
_intrusionDetect has cyclomatic complexity 64 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/observatory/js/demo-data.js:715
run has cyclomatic complexity 62 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — harness/homecore/bin/cli.js:103
_searchRescue has cyclomatic complexity 61 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/observatory/js/demo-data.js:1121
main has cyclomatic complexity 55 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:1025
_fallEvent has cyclomatic complexity 53 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/observatory/js/demo-data.js:444
main has cyclomatic complexity 51 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — REDACTED:483
NetworkDiscovery has cyclomatic complexity 51 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:43
_securityPatrol has cyclomatic complexity 45 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/observatory/js/demo-data.js:1521
report has cyclomatic complexity 43 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/deep-scan.js:76
drawSkeleton has cyclomatic complexity 42 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/pose-fusion/js/canvas-renderer.js:33
_elderlyCare has cyclomatic complexity 42 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — ui/observatory/js/demo-data.js:1247
main has cyclomatic complexity 40 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — scripts/train-wiflow-supervised.js:1203
parsePacket has cyclomatic complexity 40 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — harness/ruview/src/devices/esp32.js:111
OtaUpdate has cyclomatic complexity 39 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes. — v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:38
What to do
Break down the listed branch-heavy functions; aim P95 cyclomatic ≤ 5.
Do you agree with this assessment?
R3 · Large Files6.0 / 10Adequate✓ Tool-verified
React / JS · Code Health — How many source files exceed the large-file threshold.
Method: Components/modules exceeding the large-file threshold, counted exhaustively across the frontend source tree. Deterministic.
v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx has 1729 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1
ui/components/LiveDemoTab.js has 1640 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/components/LiveDemoTab.js:1
ui/observatory/js/demo-data.js has 1626 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/observatory/js/demo-data.js:1
ui/components/PoseDetectionCanvas.js has 1316 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/components/PoseDetectionCanvas.js:1
v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx has 1210 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:1
ui/components/SettingsPanel.js has 851 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/components/SettingsPanel.js:1
v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx has 682 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx:1
ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx has 663 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx:1
ui/observatory/js/scenario-props.js has 655 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/observatory/js/scenario-props.js:1
harness/ruview/src/tools.js has 645 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — harness/ruview/src/tools.js:1
dashboard/src/components/nv-ghost-murmur.ts has 642 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — dashboard/src/components/nv-ghost-murmur.ts:1
ui/services/pose.service.js has 639 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/services/pose.service.js:1
v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx has 639 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:1
REDACTED has 634 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
ui/utils/pose-renderer.js has 629 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/utils/pose-renderer.js:1
ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_browser.js has 598 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_browser.js:1
ui/components/body-model.js has 562 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/components/body-model.js:1
ui/services/sensing.service.js has 554 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/services/sensing.service.js:1
v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx has 544 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:1
ui/services/websocket.service.js has 536 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/services/websocket.service.js:1
harness/ruview/src/guidance.js has 512 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — harness/ruview/src/guidance.js:1
ui/observatory/js/hud-controller.js has 504 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/observatory/js/hud-controller.js:1
ui/pose-fusion/js/pose-decoder.js has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/pose-fusion/js/pose-decoder.js:1
ui/observatory/js/pose-system.js has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/observatory/js/pose-system.js:1
harness/ruview/src/devices/esp32.js has 482 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — harness/ruview/src/devices/esp32.js:1
ui/observatory/js/figure-pool.js has 461 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/observatory/js/figure-pool.js:1
dashboard/src/components/nv-help.ts has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — dashboard/src/components/nv-help.ts:1
REDACTED has 438 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — REDACTED:1
dashboard/src/components/nv-inspector.ts has 419 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — dashboard/src/components/nv-inspector.ts:1
ui/app.js has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/app.js:1
ui/components/environment.js has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/components/environment.js:1
harness/ruview/src/cli.js has 403 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — harness/ruview/src/cli.js:1
ui/components/TrainingPanel.js has 403 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/components/TrainingPanel.js:1
dashboard/src/components/nv-onboarding.ts has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — dashboard/src/components/nv-onboarding.ts:1
ui/components/signal-viz.js has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module. — ui/components/signal-viz.js:1
What to do
Split each oversized file along the responsibilities already in it, into smaller focused modules in the same package.
Do you agree with this assessment?
R4 · Test Coverage6.2 / 10Adequate✓ Tool-verified
React / JS · Readiness — Static test reachability (D-386): the share of production files reachable from any test via the import graph — measured without running anything.
Method: Static test reachability: the share of production files reachable from any test via the import graph — measured without running anything. Deterministic.
No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one. (×40) — REDACTED:1, v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1, ui/observatory/js/demo-data.js:1, …
What to do
Add tests that import the unreached modules (directly or through their public entry).
React / JS · Readiness — How outdated the npm dependencies are (a maturity signal). JS/npm CVEs are scored separately in D30 (JS/npm Dependency Vulnerabilities).
Method: npm dependency staleness from manifest/registry metadata (a maturity signal; JS/npm CVEs are scored separately in D30, which answers dependency vulnerabilities for every ecosystem). Deterministic.
What to do
Bump outdated dependencies to current versions to limit upgrade debt.
Do you agree with this assessment?
R6 · Tooling10.0 / 10Exemplary✓ Tool-verified
React / JS · Readiness — Whether the project wires up test, lint and typecheck — detected from each package.json script's COMMAND (eslint / tsc / vitest / jest / playwright), not just its name, and corroborated against CI-workflow invocations so a tool run only in CI still counts.
Method: package.json scanned for test/lint/typecheck script wiring. Deterministic presence check.
Do you agree with this assessment?
R7 · Dead Code7.4 / 10Strong✓ Tool-verified
React / JS · Code Health — Files unreachable from every application/tooling/test entry point, and exports nothing imports (module-graph reachability, D-386).
Method: Dead code: files unreachable from every application/tooling/test entry point plus exports nothing imports, via module-graph reachability. Deterministic, exhaustive over the import graph.
Unreachable from the 168 application, 70 tooling and 134 test entry point(s) detected in this repo. Gate removals on `npm run build` — an undetected custom entry would make these reachable.
no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make (×21) — ui/observatory/js/convergence-engine.js, ui/observatory/js/vitals-oracle.js, ui/observatory/js/presence-cartography.js, …
Nothing imports this binding — it is safe to review for removal. (×18) — dashboard/src/components/nv-app-store.ts:45, dashboard/src/components/nv-app.ts:27, dashboard/src/components/nv-console.ts:12, …
What to do
Delete the dead files and unused exports — every line is maintenance cost and rebuild-estimate inflation with zero runtime value.
React / JS · Readiness — npm dependency truthfulness (D-386): unused dependencies, imports not declared anywhere, and type-/test-only packages shipped as production deps.
Method: npm dependency truthfulness: unused dependencies, imports declared nowhere, and type-/test-only packages shipped as production deps — from the manifest + import graph. Deterministic.
Imported but not declared in any reachable package.json — installs work only by hoisting accident. — ui/observatory/js/figure-pool.js:14
Declared in harness/ruview/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it. (×2)
Declared in ui/mobile/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
What to do
Remove unused dependencies, declare unlisted imports explicitly, and demote type-/test-only packages to devDependencies.
React / JS · Architecture — Import cycles in the module graph (D-386) — files that can only be understood and changed together.
Method: Import cycles in the module graph, detected exhaustively over JS/TS imports (the same cycle detection as the .NET coupling dimension). Deterministic.
Other · Security — Only what this repository's own non-C# files could be read for was assessed — markup this repository SHIPS is scored for third-party script integrity whether or not the repository serves it itself, since a page handed to a consumer runs in that consumer’s origin. Nothing else in this dimension was assessed: the transport, cookie, input-validation and crypto controls are read from a source model that was not loaded for this repository’s language, so their absence here is not a finding about this repository.
Method: Roslyn plus filesystem scan: HSTS/security headers, secure cookies, input validation, middleware order, weak crypto (MD5/SHA1/DES); HTTPS-metadata context-aware. On a repository with no .NET source it reads JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Elixir source itself (test, vendored, generated and minified paths not) for the arms that hold whether or not the code serves HTTP: a weak hash or cipher, key material fixed in the source, a TLS client that accepts any certificate, and (JavaScript/TypeScript, Ruby, Scala, Rust and Elixir) an obsolete TLS version; the server controls are not assessed there, and a Dart, Ruby, Scala, Rust or Elixir repository that serves no HTTP of its own is N/A on them. Deterministic.
`https://cdnjs.cloudflare.com/ajax/libs/three.js/r165/three.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. 7 such include(s) across the repository's markup. — ui/mobile/src/assets/webview/gaussian-splats.html:34
What to do
Pin third-party scripts and verify them: name an exact version in the URL and add an `integrity="sha384-…"` hash alongside `crossorigin="anonymous"` (both are required — an integrity hash on a cross-origin script without `crossorigin` is not evaluated, it blocks the script). Where the vendor ships a continuously-updated loader and publishes no stable hash (tag managers, analytics, chat widgets), Subresource Integrity is not available: constrain it instead with a `Content-Security-Policy` that names the exact origins allowed to execute, and drop the script from the pages that do not need it. Where the page is shipped inside a package that others host, prefer vendoring the asset and serving it from the app’s own origin, so no consumer inherits a third-party dependency they did not choose.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
This `async` body is polled on an executor's worker thread, and `std::thread::sleep` blocks that thread: for the whole delay no other task scheduled on it makes progress — the Rust form of blocking on a task. Use `tokio::time::sleep(…).await` (or the runtime's own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with `tokio::task::spawn_blocking(…).await`. (×5) — REDACTED:141, REDACTED:225, v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:491, …
The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception. — archive/v1/src/main.py:28
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
This function unwraps IPv4-MAPPED IPv6 (`::ffff:`, line 114) and then rejects `10.0.0.0/8` on its IPv4 path — but the IPv6 decision at line 112 classifies the address as written, and IPv4 reaches IPv6 through three MORE embeddings this function never mentions: IPv4-compatible (`::a.b.c.d`), 6to4 (`2002::/16`) and NAT64 (`64:ff9b::/96`). So `::10.0.0.1`, `2002:0a00:0001::` and `64:ff9b::10.0.0.0` all name a host inside `10.0.0.0/8` — the range this same function declares non-public — and all reach the IPv6 decision un-unwrapped, taking the opposite verdict. Unwrap every embedding to its IPv4 form before classifying, or reject any IPv6 address carrying an embedded IPv4 outright. — harness/ruview/src/devices/esphome.js:112
What to do
Each finding names the IPv4 branch that rejects the host and the IPv6 branch that accepts the same host in another notation. Confirm from the two, then unwrap every IPv4-in-IPv6 embedding before classifying, or reject non-native IPv6 outright.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader3.0 / 10Weak✓ Tool-verified
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
`n` is read from the bytes being parsed at line 423 (`u32::from_le_bytes`), then used to size a `Vec::with_capacity` at line 428 — and nowhere in its scope is `n` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `n` against the bytes actually remaining and a maximum the format allows before allocating. — v2/crates/wifi-densepose-signal/src/ruvsense/calibration.rs:428
`count` is read from the bytes being parsed at line 865 (`u32::from_le_bytes`), then used to size a `Vec::with_capacity` at line 873 — and nowhere in its scope is `count` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `count` against the bytes actually remaining and a maximum the format allows before allocating. — v2/crates/wifi-densepose-aether/src/embedding.rs:873
`header_len` is read from the bytes being parsed at line 50 (`struct.unpack("<Q")`), then passed as the size of `read` at line 51 — and nowhere in its function is `header_len` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: the call reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB (a 64-bit one for more than any machine has), and the reservation either raises `MemoryError` out of a parser whose failure path was written for malformed input, not for hostile input, or succeeds and holds gigabytes for a few bytes on the wire. Bound `header_len` against the bytes actually remaining and a maximum the format allows before reading. — scripts/export-onnx.py:51
What to do
Each finding names the read that takes the length from the input and the site that spends it, and states that the value is never compared in between. Confirm from the two, then bound the length against the remaining stream before using it.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether async functions that make a cancellable request accept or pass on an AbortSignal (adoption curve).
Method: Roslyn scan: every async method (excluding framework-fixed overrides/Blazor handlers) checked for CancellationToken parameter presence. Deterministic, adoption percentage. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same question: every named async function that itself makes a request an AbortSignal can cancel (global `fetch`, axios and its file-local instances, ky, ofetch) counts, and it is compliant when its parameters or body name a signal or it hands one of its own parameters to the request as options; signatures a framework fixes (JSX event handlers, route and lifecycle exports, request-first handlers, `override`, `'use server'` modules, TanStack `mutationFn`) are exempt unless they take a signal. Deterministic, adoption percentage.
Only 4/15 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
`_get` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — v2/crates/homecore-server/ui/js/api.js:39
`_post` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — v2/crates/homecore-server/ui/js/api.js:44
`_delete` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — v2/crates/homecore-server/ui/js/api.js:53
`refreshSignInPanel` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/utils/quick-settings.js:298
`request` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/services/api.service.js:68
`_detectServerSource` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/services/sensing.service.js:480
`mintTicket` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/services/ws-ticket.js:37
`probeWsAuthRequired` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/services/ws-ticket.js:100
`__wbg_init` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/pose-fusion/pkg/ruvector_cnn_wasm/ruvector_cnn_wasm.js:776
`initWasm` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_browser.js:599
`exportProofBundle` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`. — dashboard/src/transport/WsClient.ts:193
What to do
Thread an AbortSignal through async functions that make requests, so the work stops when its caller gives up.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
`debug` at line 322 is called with an argument built by `Object.keys(convertedData.zone_summary || { })` (line 324), whose cost grows with the collection it walks. JavaScript evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isLevelEnabled`/`isDebugEnabled` test, no debug flag, no `NODE_ENV` build switch. — ui/services/pose.service.js:322
What to do
Each finding names the diagnostic call and the expression inside its argument whose cost scales with a collection. Confirm from the two that the argument is built before the call — that is JavaScript's evaluation order, not a guess — then put the construction behind the level check the logger offers (`if (logger.isLevelEnabled('debug'))` for pino and winston, `isDebugEnabled()` for log4js, the repository's own debug flag where it has one), or hand the logger the object and a format string (`logger.debug({ payload }, 'raw request')`) so the serialising happens only when the line is written. Moving the call is not the fix: it is the join/projection/stringify in the argument that is paid, wherever the call sits.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped3.8 / 10Weak✓ Tool-verified
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
`this.trainingState.status` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — ui/components/LiveDemoTab.js:1784
`am.frames_processed??0` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — ui/components/ModelPanel.js:160
`this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. (×37) — ui/components/PoseDetectionCanvas.js:92, ui/components/PoseDetectionCanvas.js:93, ui/components/PoseDetectionCanvas.js:96, …
`zone` is text this program did not author, and it is written into a quoted attribute value through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — ui/components/SettingsPanel.js:138
What to do
Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `RefCell` it is walking alone — safe Rust rejects a body that changes the collection its loop borrows at compile time, except through interior mutability: a `RefCell` borrowed in the loop's header stays borrowed until the loop ends, so a `borrow_mut()` of it inside the body panics with `already borrowed: BorrowMutError` and the remaining elements are never seen. Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
`except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — wifi_densepose/__init__.py:94
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×37) — wifi_densepose/__init__.py:102, v2/crates/wifi-densepose-desktop/ui/src/App.tsx:83, v2/crates/wifi-densepose-desktop/ui/src/pages/Settings.tsx:28, …
`catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. — v2/crates/homecore-server/ui/js/ws.js:28
`.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. — v2/crates/homecore-server/ui/js/panels/events.js:193
What to do
Swallowed exception (caught, then discarded)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
`info` at line 215 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/collect-training-data.py:215
`info` at line 267 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. (×2) — scripts/collect-training-data.py:267, archive/v1/src/cli.py:267
`warning` at line 287 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — scripts/collect-training-data.py:287
`info` at line 310 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/collect-training-data.py:310
`info` at line 314 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/collect-training-data.py:314
`info` at line 348 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/collect-training-data.py:348
`info` at line 375 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — scripts/collect-training-data.py:375
`warning` at line 386 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — scripts/collect-training-data.py:386
`debug` at line 245 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/__init__.py:245
`error` at line 47 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/app.py:47
`error` at line 160 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/app.py:160
`error` at line 264 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/app.py:264
`error` at line 288 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/app.py:288
`error` at line 321 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/app.py:321
`error` at line 126 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:126
`error` at line 159 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:159
`error` at line 191 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:191
`warning` at line 241 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:241
`error` at line 246 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:246
`error` at line 270 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:270
`info` at line 292 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:292
`error` at line 295 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:295
`info` at line 327 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:327
`info` at line 332 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:332
`info` at line 337 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:337
`error` at line 342 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:342
`error` at line 376 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:376
`error` at line 431 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:431
`error` at line 501 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:501
`warning` at line 530 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:530
`error` at line 592 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:592
`error` at line 610 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/cli.py:610
`info` at line 119 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/logger.py:119
`debug` at line 265 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/logger.py:265
`debug` at line 269 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/logger.py:269
`error` at line 272 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/logger.py:272
`debug` at line 285 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/logger.py:285
`debug` at line 289 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/logger.py:289
`error` at line 292 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog. — archive/v1/src/logger.py:292
Other · Code Health — Whether strict null checking is enabled and not undermined by heavy `!` assertion — TypeScript's `strictNullChecks` (which `strict` turns on) is what makes `string` exclude `null` and `undefined`, and the postfix `!` is the operator that silences it.
Method: Roslyn compiler-options scan: NullableContextOptions per project; null-forgiving (!) suppression density per 1k syntax nodes. Deterministic, adoption plus suppression penalty.
~0.6 `!` null assertions per 1k TypeScript source lines — 14 assertion(s) across the 24053 source line(s) of the 162 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: dashboard/src/transport/worker.ts (8), ui/mobile/src/utils/ringBuffer.ts (2), dashboard/src/components/nv-console.ts (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
What to do
The findings name the configuration each number was taken from and, for the assertions, the files that hold them. Turn null checking on where it is off — `"strict": true` in the base tsconfig that the others extend switches `strictNullChecks` on with the rest of the family — and then resolve the assertions rather than adding to them. A `!` on a value the checker could show to be null is a promise the author cannot check from where they are standing, and each one is a `TypeError: Cannot read properties of null` waiting for the path that makes it true; where the value genuinely cannot be null, say something the checker can see instead (narrow it with a test, make the property required, drop the `?`).
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 15 of 55 WCAG 2.2 Level A/AA success criteria (27%; ≈30% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 40 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 17 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X9 Subsumed condition operand — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 3 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
C3 Audit Trail — Not assessed: these audit controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks audit controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C4 Data Retention — Not assessed: these retention controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks retention controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C5 Data-Subject Rights — Not assessed: these data-subject rights controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks data-subject rights controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
Not included — 33 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AX1 Captive dependencies — Not applicable: this repository's JavaScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; Rust with no dependency-injection crate has no container to hand one lifetime's instance to another — every value is owned by the code that builds it, and the borrow checker rejects a longer-lived value keeping a borrow of a shorter-lived one; this repository's Swift imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's; this repository's TypeScript imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. No Swift request handler (a Vapor, Hummingbird, Kitura, Swifter or Perfect route handler, as a method or a registered closure) is declared, so no state is shared between request threads. Rust's compiler refuses unsynchronised shared mutation — a value shared across threads must be Sync — so the race this check looks for cannot be written. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
AXR1 Runtime accessibility — compose up failed (exit 17 — an image could not be built) — sensing-server Pulling sensing-server Warning Get "https://registry-1.docker.io/v2/": Forbidden failed to solve: python:3.11-slim-bookworm: failed to resolve source metadata for docker.io/library/python:3.11-slim-bookworm: failed to do request: Head "https://registry-1.docker.io/v2/library/python/manifests/3.11-slim-bookworm": Forbidden; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — Not assessed: these authorization controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks authorization controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D21 Naming Consistency — Naming consistency is measured on C# only; JavaScript, Python, Rust, Swift, TypeScript, html not measured.
D22 Internal API Consistency — API consistency is measured on C# only; the exposed JavaScript, Python, Rust, TypeScript surface was not measured.
D24 Comment Value — D24 reads C# and Visual Basic comments only — this repository's production source is .py, .rs, .swift, .ts, .tsx, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.rs), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D32 Data Compliance (PII/GDPR) — 2 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D8 Code Coverage — Coverage not measured — polyglot repository, one half has no runner
DM1 Domain Modelling — applicable but not scored (4 signals for this style, 3 needed — the count is met but a required primary signal is absent): 9 aggregate root(s) (types guarding their own state behind command methods — this language has no AggregateRoot base to inherit); 162 value object(s); 9 domain event(s); its domain events are published by services or handlers — no domain entity raises one; a Domain/Aggregates/ValueObjects layer; a Rust domain-layer crate (a .../domain/ clean-architecture layer); a top-level examples/ tree: a library or framework whose examples are its consumers — these types are building blocks, not a domain
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and this analysis resolves a call's owner only where the receiver's type is written down in the source. Reported as guidance rather than measured
ED2 Event/command shape — not scored — deciding whether a command has more than one competing handler requires resolving the call graph, and a call made through an inferred or generic receiver has no resolvable owner in the source. Reported as guidance rather than measured
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
P8 Schema migrations — Alembic, SQLAlchemy, sqlx is declared, but the schema-migration mechanism could not be identified. Our limit, not a verdict on this repository.
P9 Domain vs controller coverage — coverage data present for 146 file(s), but no domain-layer files were identified: no covered file's path contains any of the markers this check keys on (/domain/, /aggregates/, /valueobjects/, /domainmodel/, .domain/, /entities/), which are matched case-insensitively anywhere in the path. With no domain partition there is nothing to compare the web/controller layer against — if this repository keeps its business rules under a folder named none of those, that naming is what the check cannot see, not the domain logic.
PF2 Allocation hygiene — Not applicable: allocation awareness is rated where code engineers for it — at least 400 production lines that ship benchmarks or already use allocation-aware idioms (8 or more). This repository's Swift code has 547 production line(s), 2 such use(s) and no benchmarks, so there is no allocation work to rate. The card is reward-only: its absence costs nothing.
SC1 Supply-chain hygiene — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
AC2 · Forms & labels· <label> that labels no control · ×19
<label> that labels no control ui/components/LiveDemoTab.js:184— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:188— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:192— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:196— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:200— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:218— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:242— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:293— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:297— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:301— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:1783— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/LiveDemoTab.js:1787— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/SensingTab.js:73— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/SensingTab.js:78— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/SensingTab.js:83— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/SensingTab.js:88— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/components/SensingTab.js:101— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control ui/pose-fusion.html:165— This <label> has no for and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label for="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
<label> that labels no control v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:788— This <label> has no htmlFor and wraps no form control, so it names nothing: assistive tech never announces it, and clicking the caption focuses no field. Note that an id on the label is not an association — it is the TARGET of one, so a control still has to point at it. Give the label htmlFor="<the control's id>", move the control inside the label, or point the control's aria-labelledby at this label's id.
AC4 · Keyboard semantics· Click handler on a non-interactive <span> · ×11
Click handler on a non-interactive <span> dashboard/src/components/nv-app-store.ts:301— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-app-store.ts:296— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-app-store.ts:309— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-app-store.ts:310— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-app-store.ts:311— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-app-store.ts:312— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-debug-hud.ts:79— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-scene.ts:355— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-sidebar.ts:158— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-topbar.ts:112— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <span> dashboard/src/components/nv-topbar.ts:116— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
AC2 · Forms & labels· <input> without a programmatic label · ×8
<input> without a programmatic label dashboard/src/components/nv-app-store.ts:290— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label dashboard/src/components/nv-console.ts:260— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label dashboard/src/components/nv-help.ts:359— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label dashboard/src/components/nv-palette.ts:228— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label dashboard/src/components/nv-settings-drawer.ts:213— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label ui/pose-fusion.html:166— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label ui/pose-fusion.html:173— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label ui/utils/quick-settings.js:91— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
AC2 · Forms & labels· <select> without a programmatic label · ×8
<select> without a programmatic label ui/components/LiveDemoTab.js:167— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label ui/components/LiveDemoTab.js:219— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label ui/components/PoseDetectionCanvas.js:101— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label ui/pose-fusion.html:18— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js:2109— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js:2145— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js:2147— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:801— This control has no associated label. Add a <label htmlFor> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC2 · Forms & labels· <textarea> without a programmatic label · ×4
<textarea> without a programmatic label v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js:2245— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<textarea> without a programmatic label v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js:2268— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<textarea> without a programmatic label v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js:2272— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<textarea> without a programmatic label v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js:2276— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC4 · Keyboard semantics· Click handler on a non-interactive <div> · ×4
Click handler on a non-interactive <div> dashboard/src/components/nv-palette.ts:234— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabindex="0" + a key handler.
Click handler on a non-interactive <div> v2/crates/wifi-densepose-desktop/ui/src/pages/Dashboard.tsx:291— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1111— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <div> v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:930— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
AC4 · Keyboard semantics· Clickable role="switch" that no keyboard user can reach · ×3
Clickable role="switch" that no keyboard user can reach dashboard/src/components/nv-app-store.ts:391— This <span> announces itself as a role="switch" and binds a click, but nothing can put focus on it: no tabindex="0" in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabindex="0"="0" and an Enter/Space key handler, or make it a native <button>. If a parent widget owns the keyboard model, that parent must move focus onto the active role="switch" or point aria-activedescendant at it.
Clickable role="switch" that no keyboard user can reach dashboard/src/components/nv-settings-drawer.ts:174— This <span> announces itself as a role="switch" and binds a click, but nothing can put focus on it: no tabindex="0" in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabindex="0"="0" and an Enter/Space key handler, or make it a native <button>. If a parent widget owns the keyboard model, that parent must move focus onto the active role="switch" or point aria-activedescendant at it.
Clickable role="switch" that no keyboard user can reach dashboard/src/components/nv-settings-drawer.ts:187— This <span> announces itself as a role="switch" and binds a click, but nothing can put focus on it: no tabindex="0" in any spelling, no key handler, and nothing in this file moves focus or sets aria-activedescendant. The role tells assistive tech what the control IS; it does not make the control reachable, so a keyboard user cannot operate it at all (WCAG 2.1.1). Give it tabindex="0"="0" and an Enter/Space key handler, or make it a native <button>. If a parent widget owns the keyboard model, that parent must move focus onto the active role="switch" or point aria-activedescendant at it.
<html> without a lang ui/icons/generate.html:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
<html> without a lang REDACTED:2— The page declares no language, so assistive tech can't pick the right pronunciation. Add lang (e.g. lang="en").
AC4 · Keyboard semantics· Click handler on a non-interactive <tr> · ×2
Click handler on a non-interactive <tr> v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1707— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Click handler on a non-interactive <tr> v2/crates/wifi-densepose-desktop/ui/src/pages/Nodes.tsx:181— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
Viewport restricts zoom ui/mobile/src/assets/webview/gaussian-splats.html:5— user-scalable=no/0 or a maximum-scale below 2 stops low-vision users zooming to 200%. Remove the zoom restriction from the viewport meta.
AC4 · Keyboard semantics· Clickable element isn't keyboard-operable · ×1
Clickable element isn't keyboard-operable dashboard/src/components/nv-help.ts:366— The repo's own CSS styles .head with `cursor: pointer`, so this <div> is a control — but it has no role, no tabindex="0" and no key handler, so it can only be reached with a mouse. Use a <button>, or add role + tabindex="0" + a key handler.
AC4 · Keyboard semantics· Click handler on a non-interactive <canvas> · ×1
Click handler on a non-interactive <canvas> v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:541— A click handler on a plain element isn't keyboard-operable. Use a <button>, or add role + tabIndex={0} + a key handler.
D11 · Test Reliability· Test suite declares a test script but contains no test files · ×1
Test suite declares a test script but contains no test files: dashboard/ — The vitest suite in dashboard/ was installed and launched successfully, and the runner then found no test files to run — No test files found, exiting with code 0. The package declares a test script, so it reads as a tested package to anyone who checks its manifest, but there is nothing behind the declaration: no test case exists, so it cannot detect a regression and its presence overstates how much of this repository is tested. The ask is the owner's: write the first test for this package, or remove the test script from a package that has none. This is not a report that the tests FAIL — there are none.
D11 · Test Reliability· Test suite cannot be installed from its own lockfile · ×1
Test suite cannot be installed from its own lockfile: ui/mobile/ — The jest suite in ui/mobile/ was never exercised because its dependency install refused the committed lockfile — the dependency install for ui/mobile/ refused the committed lockfile (npm error code ERESOLVE), so the suite never ran. The suite is declared and committed but cannot be installed from what the repository ships, so neither this scan nor a new contributor can run it. The ask is the one the owner performs: run the install locally and commit the lockfile it writes.
Unlisted import 'three' ui/observatory/js/figure-pool.js:14— Imported but not declared in any reachable package.json — installs work only by hoisting accident.
FunctionTooLong: wifi_densepose_sensing_server::main v2/crates/wifi-densepose-sensing-server/src/main.rs:13795— FunctionTooLong — wifi_densepose_sensing_server::main runs 1024 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 924 over it, 10.24× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: NetworkDiscovery.NetworkDiscovery v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:43— FunctionTooLong — NetworkDiscovery runs 707 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 607 over it, 7.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.
FunctionTooLong: wifi_densepose_sensing_server::udp_receiver_task v2/crates/wifi-densepose-sensing-server/src/main.rs:12218— FunctionTooLong — wifi_densepose_sensing_server::udp_receiver_task runs 660 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 560 over it, 6.60× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: train-camera-free.main REDACTED:1703— FunctionTooLong — main runs 475 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 375 over it, 4.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: train-ruvllm.main REDACTED:1025— FunctionTooLong — main runs 412 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 312 over it, 4.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: MeshView.MeshView v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:143— FunctionTooLong — MeshView runs 395 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 295 over it, 3.95× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: Sensing.Sensing v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx:300— FunctionTooLong — Sensing runs 348 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 248 over it, 3.48× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: wifi_densepose_sensing_server::training_api::run_training_job v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1108— FunctionTooLong — wifi_densepose_sensing_server::training_api::run_training_job runs 338 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 238 over it, 3.38× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: GaussianSplatWebView.web.GaussianSplatWebViewWeb ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx:277— FunctionTooLong — GaussianSplatWebViewWeb runs 333 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 233 over it, 3.33× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: EdgeModules.ModuleLibraryTab v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:983— FunctionTooLong — ModuleLibraryTab runs 320 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 220 over it, 3.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: OtaUpdate.OtaUpdate v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:38— FunctionTooLong — OtaUpdate runs 305 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 205 over it, 3.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: train-wiflow-supervised.main scripts/train-wiflow-supervised.js:1203— FunctionTooLong — main runs 293 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 193 over it, 2.93× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: App.App v2/crates/wifi-densepose-desktop/ui/src/App.tsx:49— FunctionTooLong — App runs 263 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 163 over it, 2.63× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: EdgeModules.EdgeModules v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:602— FunctionTooLong — EdgeModules runs 252 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 152 over it, 2.52× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: train-wiflow.main REDACTED:483— FunctionTooLong — main runs 251 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 151 over it, 2.51× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: benchmark-ruvllm.main REDACTED:277— FunctionTooLong — main runs 237 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 137 over it, 2.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: wifi_densepose_sensing_server::calibration_promote_bootstrap v2/crates/wifi-densepose-sensing-server/src/main.rs:9897— FunctionTooLong — wifi_densepose_sensing_server::calibration_promote_bootstrap runs 204 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 104 over it, 2.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: wifi_densepose_sensing_server::wifi_task v2/crates/wifi-densepose-sensing-server/src/main.rs:4874— FunctionTooLong — wifi_densepose_sensing_server::wifi_task runs 198 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 98 over it, 1.98× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: FlashFirmware.FlashFirmware v2/crates/wifi-densepose-desktop/ui/src/pages/FlashFirmware.tsx:8— FunctionTooLong — FlashFirmware runs 191 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 91 over it, 1.91× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: wifi_densepose_sensing_server::calibration_refine_bootstrap v2/crates/wifi-densepose-sensing-server/src/main.rs:10167— FunctionTooLong — wifi_densepose_sensing_server::calibration_refine_bootstrap runs 188 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 88 over it, 1.88× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: wifi_densepose_sensing_server::adaptive_classifier::train_from_recordings v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:468— FunctionTooLong — wifi_densepose_sensing_server::adaptive_classifier::train_from_recordings runs 182 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 82 over it, 1.82× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: app.initDemo references/app.js:80— FunctionTooLong — initDemo runs 181 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 81 over it, 1.81× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: train-camera-free.generateWeakLabels REDACTED:915— FunctionTooLong — generateWeakLabels runs 157 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 57 over it, 1.57× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: wifi_densepose_cli::calibrate_api::ingest_loop v2/crates/wifi-densepose-cli/src/calibrate_api.rs:388— FunctionTooLong — wifi_densepose_cli::calibrate_api::ingest_loop runs 156 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 56 over it, 1.56× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: ruforecast_autogenous_bridge::main v2/crates/ruforecast-autogenous-bridge/src/main.rs:185— FunctionTooLong — ruforecast_autogenous_bridge::main runs 155 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 55 over it, 1.55× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FileTooLong: REDACTED v2/crates/wifi-densepose-sensing-server/src/main.rs— FileTooLong — 7548 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 174 free functions. The bar is 500 significant lines; this is 7048 over it, 15.10× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1618 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1118 over it, 3.24× 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: pages/EdgeModules.tsx v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx— FileTooLong — 1438 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 938 over it, 2.88× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: components/LiveDemoTab.js ui/components/LiveDemoTab.js— FileTooLong — 1330 significant lines (blank, comment-only and punctuation-only lines excluded), about 99% of them inside a single declaration: LiveDemoTab (13-1891). The bar is 500 significant lines; this is 830 over it, 2.66× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/training_api.rs v2/crates/wifi-densepose-sensing-server/src/training_api.rs— FileTooLong — 1279 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), declaring 40 free functions. The bar is 500 significant lines; this is 779 over it, 2.56× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: js/demo-data.js ui/observatory/js/demo-data.js— FileTooLong — 1226 significant lines (blank, comment-only and punctuation-only lines excluded; the length bar is tripled for a single-responsibility module of 4 or fewer top-level units), about 95% of them inside a single declaration: DemoDataGenerator (121-1794). The bar is 500 significant lines; this is 726 over it, 2.45× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1085 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 585 over it, 2.17× 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: pages/NetworkDiscovery.tsx v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx— FileTooLong — 1077 significant lines (blank, comment-only and punctuation-only lines excluded), about 66% of them inside a single declaration: NetworkDiscovery (43-850). The bar is 500 significant lines; this is 577 over it, 2.15× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: components/PoseDetectionCanvas.js ui/components/PoseDetectionCanvas.js— FileTooLong — 1006 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: PoseDetectionCanvas (7-1553). The bar is 500 significant lines; this is 506 over it, 2.01× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/mat.rs v2/crates/wifi-densepose-wasm/src/mat.rs— FileTooLong — 979 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 60% of them inside a single declaration: MatDashboard (3 blocks, 479-1506). The bar is 500 significant lines; this is 479 over it, 1.96× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: integration/hardware_adapter.rs v2/crates/wifi-densepose-mat/src/integration/hardware_adapter.rs— FileTooLong — 968 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 65% of them inside a single declaration: HardwareAdapter (3 blocks, 462-1602). The bar is 500 significant lines; this is 468 over it, 1.94× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: ruvsense/field_model.rs v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs— FileTooLong — 967 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), about 65% of them inside a single declaration: FieldModel (2 blocks, 455-1630). The bar is 500 significant lines; this is 467 over it, 1.93× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: scripts/train-wiflow-supervised.js scripts/train-wiflow-supervised.js— FileTooLong — 933 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 433 over it, 1.87× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/csi.rs v2/crates/wifi-densepose-sensing-server/src/csi.rs— FileTooLong — 818 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 318 over it, 1.64× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: ruvector-attention/ruvector_attention_wasm.js ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js— FileTooLong — 815 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 315 over it, 1.63× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/types.rs v2/crates/wifi-densepose-core/src/types.rs— FileTooLong — 806 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 306 over it, 1.61× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/trainer.rs v2/crates/wifi-densepose-sensing-server/src/trainer.rs— FileTooLong — 789 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 289 over it, 1.58× 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: integration/csi_receiver.rs v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs— FileTooLong — 778 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 278 over it, 1.56× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: src/server.rs v2/crates/homecore-hap/src/server.rs— FileTooLong — 776 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 276 over it, 1.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: scripts/qemu_swarm.py scripts/qemu_swarm.py— FileTooLong — 769 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 269 over it, 1.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: src/mat.rs v2/crates/wifi-densepose-cli/src/mat.rs— FileTooLong — 750 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 250 over it, 1.50× 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: bfi_learning/train.py tools/bfi_learning/train.py— FileTooLong — 729 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 229 over it, 1.46× 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: scripts/wiflow-model.js scripts/wiflow-model.js— FileTooLong — 713 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 213 over it, 1.43× 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: components/SettingsPanel.js ui/components/SettingsPanel.js— FileTooLong — 704 significant lines (blank, comment-only and punctuation-only lines excluded), about 100% of them inside a single declaration: SettingsPanel (6-972). The bar is 500 significant lines; this is 204 over it, 1.41× the bar. Moving the declarations that sit BESIDE it into sibling files will not shorten this file. Extract from INSIDE that declaration instead: lift each cohesive group of its body — the parts that share the same inputs and are named together — into its own unit in a sibling file, and have the original call them.
FileTooLong: src/groundtruth.rs v2/crates/wifi-densepose-vitals/src/groundtruth.rs— FileTooLong — 684 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 184 over it, 1.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.
Duplicated block (6 lines × 2) v2/crates/homecore-api/src/rest.rs:527— v2/crates/homecore-api/src/rest.rs:527-532 | v2/crates/homecore-api/src/ws.rs:274-279 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) v2/crates/ruview-cognitum-spaces/src/lib.rs:418— v2/crates/ruview-cognitum-spaces/src/lib.rs:418-423 | v2/crates/ruview-cognitum-spaces/src/lib.rs:468-473 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-aether/src/embedding.rs:196— v2/crates/wifi-densepose-aether/src/embedding.rs:196-201 | v2/crates/wifi-densepose-aether/src/embedding.rs:208-213 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-aether/src/embedding.rs:202— v2/crates/wifi-densepose-aether/src/embedding.rs:202-207 | v2/crates/wifi-densepose-aether/src/embedding.rs:231-236 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-aether/src/embedding.rs:225— v2/crates/wifi-densepose-aether/src/embedding.rs:225-230 | v2/crates/wifi-densepose-aether/src/embedding.rs:237-242 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-desktop/src/commands/provision.rs:101— v2/crates/wifi-densepose-desktop/src/commands/provision.rs:101-106 | v2/crates/wifi-densepose-desktop/src/commands/provision.rs:188-193 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:234— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:234-239 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:222-227 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-hardware/src/radio_ops.rs:359— v2/crates/wifi-densepose-hardware/src/radio_ops.rs:359-364 | v2/crates/wifi-densepose-hardware/src/radio_ops.rs:384-389 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:940— v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:940-945 | v2/crates/wifi-densepose-train/src/dataset/widar.rs:258-263 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-privshield/src/identity.rs:123— v2/crates/wifi-densepose-privshield/src/identity.rs:123-128 | wifi-veil/src/identity.rs:123-128 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/identity.rs` and `wifi-veil/src/identity.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-ruvector/src/viewpoint/attention.rs:398— v2/crates/wifi-densepose-ruvector/src/viewpoint/attention.rs:398-405 | v2/crates/wifi-densepose-ruvector/src/viewpoint/attention.rs:497-502 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7181— v2/crates/wifi-densepose-sensing-server/src/main.rs:7181-7186 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:105-112 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:508— v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:508-513 | v2/crates/wifi-densepose-train/src/subcarrier.rs:359-364 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-cli/src/room.rs:28— v2/crates/wifi-densepose-cli/src/room.rs:28-33 | v2/crates/wifi-densepose-sensing-server/src/browser_session.rs:110-115 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:168— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:168-173 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:156-161 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-privshield/src/optimize.rs:273— v2/crates/wifi-densepose-privshield/src/optimize.rs:273-278 | wifi-veil/src/optimize.rs:273-278 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/optimize.rs` and `wifi-veil/src/optimize.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1178— v2/crates/wifi-densepose-sensing-server/src/csi.rs:1178-1183 | v2/crates/wifi-densepose-sensing-server/src/main.rs:10534-10539 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7612— v2/crates/wifi-densepose-sensing-server/src/main.rs:7612-7617 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:279-284 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-sensing-server/src/vendor_origin_plume.rs:446— v2/crates/wifi-densepose-sensing-server/src/vendor_origin_plume.rs:446-451 | v2/crates/wifi-densepose-train/src/protocols.rs:227-232 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-mat/src/domain/survivor.rs:106— v2/crates/wifi-densepose-mat/src/domain/survivor.rs:106-111 | v2/crates/wifi-densepose-signal/src/ruvsense/attractor_drift.rs:192-197 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-signal/src/csi_processor.rs:619— v2/crates/wifi-densepose-signal/src/csi_processor.rs:619-624 | v2/crates/wifi-densepose-signal/src/motion.rs:546-551 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/med_gait_analysis.rs:310— v2/crates/wifi-densepose-wasm-edge/src/med_gait_analysis.rs:310-315 | v2/crates/wifi-densepose-wasm-edge/src/med_respiratory_distress.rs:225-232 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:97— v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:97-102 | v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:270-276 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:105— v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:105-110 | v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:279-285 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:89— v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:89-94 | v2/crates/wifi-densepose-sensing-server/src/rvf_pipeline.rs:261-267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
+ 18 more in this group — see findings.md.
R4 · Test Coverage· No test reaches this file · ×40
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file ui/observatory/js/demo-data.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/train-wiflow-supervised.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/wiflow-model.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/rf-scan-multifreq.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/mincut-person-counter.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file ui/observatory/js/scenario-props.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file REDACTED:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/device-fingerprint.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/passive-radar.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/csi-graph-visualizer.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/csi-spectrogram.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file dashboard/src/components/nv-ghost-murmur.ts:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/mesh-graph-transformer.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file ui/components/body-model.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/eval-wiflow.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/rf-scan.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/material-classifier.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
No test reaches this file scripts/through-wall-detector.js:1— No test imports this module directly or transitively. Import reachability cannot see a test that executes a file by path instead of importing it, nor one that drives it through a running browser by navigating to a URL — if neither does, no test reaches this one.
+ 15 more in this group — see findings.md.
X24 · Document value interpolated into markup unescaped· Untrusted text written into markup unescaped · ×40
Untrusted text written into markup unescaped ui/components/LiveDemoTab.js:1784— `this.trainingState.status` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/ModelPanel.js:160— `am.frames_processed??0` is text this program did not author, and it is written into the text of an element through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:92— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:93— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:96— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:97— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:98— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:99— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:100— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:101— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:107— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:108— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:112— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:113— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:114— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:115— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/PoseDetectionCanvas.js:1242— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/SettingsPanel.js:124— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/SettingsPanel.js:125— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/SettingsPanel.js:126— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/SettingsPanel.js:135— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/SettingsPanel.js:136— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/SettingsPanel.js:138— `zone` is text this program did not author, and it is written into a quoted attribute value through markup built here with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/SettingsPanel.js:143— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped ui/components/SettingsPanel.js:144— `this.containerId` is text this program did not author, and it is written into a quoted attribute value through `innerHTML` with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Swallowed exception (empty catch) wifi_densepose/__init__.py:102— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/wifi-densepose-desktop/ui/src/App.tsx:83— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/wifi-densepose-desktop/ui/src/pages/Settings.tsx:28— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/api.js:26— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/api.js:27— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/api.js:28— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/app.js:105— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/ws.js:53— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/ws.js:65— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/panels/cogs.js:51— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/panels/entities.js:204— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/panels/events.js:124— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) v2/crates/homecore-server/ui/js/panels/events.js:193— `.catch(() => {})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
Swallowed exception (empty catch) ui/utils/i18n.js:186— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/i18n.js:200— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/mock-server.js:316— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/notification-center.js:216— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/notification-center.js:225— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/onboarding.js:74— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/quick-settings.js:166— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/quick-settings.js:175— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/quick-settings.js:186— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/quick-settings.js:192— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/quick-settings.js:230— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) ui/utils/quick-settings.js:280— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
wifi_densepose_sensing_server::udp_receiver_task (cognitive 289) v2/crates/wifi-densepose-sensing-server/src/main.rs:12218— wifi_densepose_sensing_server::udp_receiver_task has cognitive complexity 289 (threshold 15). Drivers by points: if/else 74 (251 pts), match/switch 8 (28 pts), boolean chains 9, loops 1 (nesting depth added 197). 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.
wifi_densepose_sensing_server::main (cognitive 185) v2/crates/wifi-densepose-sensing-server/src/main.rs:13795— wifi_densepose_sensing_server::main has cognitive complexity 185 (threshold 15). Drivers by points: if/else 68 (111 pts), match/switch 26 (52 pts), loops 7 (17 pts), boolean chains 5 (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.
wifi_densepose_sensing_server::training_api::run_training_job (cognitive 86) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1108— wifi_densepose_sensing_server::training_api::run_training_job has cognitive complexity 86 (threshold 15). Drivers by points: if/else 30 (49 pts), loops 11 (33 pts), match/switch 1 (3 pts), boolean chains 1 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::adaptive_classifier::train_from_recordings (cognitive 75) v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:468— wifi_densepose_sensing_server::adaptive_classifier::train_from_recordings has cognitive complexity 75 (threshold 15). Drivers by points: loops 26 (52 pts), if/else 10 (21 pts), boolean chains 2 (nesting depth added 37). 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.
wifi_densepose_sensing_server::handle_ws_pose_client (cognitive 53) v2/crates/wifi-densepose-sensing-server/src/main.rs:5924— wifi_densepose_sensing_server::handle_ws_pose_client has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (44 pts), match/switch 3 (8 pts), loops 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::mqtt::publisher::run (cognitive 52) v2/crates/wifi-densepose-sensing-server/src/mqtt/publisher.rs:209— wifi_densepose_sensing_server::mqtt::publisher::run has cognitive complexity 52 (threshold 15). Drivers by points: if/else 9 (31 pts), loops 4 (13 pts), match/switch 3 (8 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.
wifi_densepose_sensing_server::bearer_auth::require_bearer (cognitive 46) v2/crates/wifi-densepose-sensing-server/src/bearer_auth.rs:519— wifi_densepose_sensing_server::bearer_auth::require_bearer has cognitive complexity 46 (threshold 15). Drivers by points: if/else 20 (41 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
wifi_densepose_sensing_server::training_api::compute_teacher_targets (cognitive 42) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:666— wifi_densepose_sensing_server::training_api::compute_teacher_targets has cognitive complexity 42 (threshold 15). Drivers by points: if/else 24 (37 pts), match/switch 2 (4 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::training_api::extract_features_for_frame (cognitive 41) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:530— wifi_densepose_sensing_server::training_api::extract_features_for_frame has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (32 pts), loops 5 (6 pts), match/switch 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::calibration_refine_bootstrap (cognitive 39) v2/crates/wifi-densepose-sensing-server/src/main.rs:10167— wifi_densepose_sensing_server::calibration_refine_bootstrap has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (24 pts), boolean chains 8, match/switch 4, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::calibration_promote_bootstrap (cognitive 37) v2/crates/wifi-densepose-sensing-server/src/main.rs:9897— wifi_densepose_sensing_server::calibration_promote_bootstrap has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (21 pts), boolean chains 10, loops 3 (4 pts), match/switch 2 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
wifi_densepose_sensing_server::wifi_task (cognitive 34) v2/crates/wifi-densepose-sensing-server/src/main.rs:4874— wifi_densepose_sensing_server::wifi_task has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (30 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::csi::estimate_persons_from_correlation (cognitive 33) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1000— wifi_densepose_sensing_server::csi::estimate_persons_from_correlation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 7 (12 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::estimate_persons_from_correlation (cognitive 33) v2/crates/wifi-densepose-sensing-server/src/main.rs:6524— wifi_densepose_sensing_server::estimate_persons_from_correlation has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 7 (12 pts), boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::start_recording (cognitive 30) v2/crates/wifi-densepose-sensing-server/src/main.rs:8259— wifi_densepose_sensing_server::start_recording has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (17 pts), match/switch 5 (12 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.
wifi_densepose_sensing_server::matter::bridge::build_bridge_tree (cognitive 30) v2/crates/wifi-densepose-sensing-server/src/matter/bridge.rs:62— wifi_densepose_sensing_server::matter::bridge::build_bridge_tree has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 2 (3 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
wifi_densepose_sensing_server::training_api::extract_features_and_targets (cognitive 28) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:864— wifi_densepose_sensing_server::training_api::extract_features_and_targets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6 (11 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.
wifi_densepose_sensing_server::handle_ws_client (cognitive 26) v2/crates/wifi-densepose-sensing-server/src/main.rs:5807— wifi_densepose_sensing_server::handle_ws_client has cognitive complexity 26 (threshold 15). Drivers by points: match/switch 4 (13 pts), if/else 4 (12 pts), loops 1 (nesting depth added 17). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
wifi_densepose_sensing_server::simulated_data_task (cognitive 26) v2/crates/wifi-densepose-sensing-server/src/main.rs:13323— wifi_densepose_sensing_server::simulated_data_task has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sensing_server::tracker_bridge::tracker_update (cognitive 26) v2/crates/wifi-densepose-sensing-server/src/tracker_bridge.rs:200— wifi_densepose_sensing_server::tracker_bridge::tracker_update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 6 (7 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.
wifi_densepose_sensing_server::vital_signs::bandpass_filter (cognitive 23) v2/crates/wifi-densepose-sensing-server/src/vital_signs.rs:412— wifi_densepose_sensing_server::vital_signs::bandpass_filter has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (6 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.
wifi_densepose_sensing_server::csi::generate_signal_field (cognitive 22) v2/crates/wifi-densepose-sensing-server/src/csi.rs:340— wifi_densepose_sensing_server::csi::generate_signal_field has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 6 (7 pts) (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.
wifi_densepose_sensing_server::csi::smooth_vitals (cognitive 22) v2/crates/wifi-densepose-sensing-server/src/csi.rs:811— wifi_densepose_sensing_server::csi::smooth_vitals has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (wifi_densepose_sensing_server::csi::smooth_vitals_node) 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.
wifi_densepose_sensing_server::csi::smooth_vitals_node (cognitive 22) v2/crates/wifi-densepose-sensing-server/src/csi.rs:865— wifi_densepose_sensing_server::csi::smooth_vitals_node has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 4 (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. This shape REPEATS in the file: one other method here (wifi_densepose_sensing_server::csi::smooth_vitals) 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.
wifi_densepose_sensing_server::generate_signal_field (cognitive 22) v2/crates/wifi-densepose-sensing-server/src/main.rs:3930— wifi_densepose_sensing_server::generate_signal_field has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (15 pts), if/else 6 (7 pts) (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.
MethodTooLong: LiveDemoTab.addEnhancedStyles ui/components/LiveDemoTab.js:331— MethodTooLong — addEnhancedStyles runs 486 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 386 over it, 4.86× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DashboardHUD._build ui/components/dashboard-hud.js:29— MethodTooLong — _build runs 245 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 145 over it, 2.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: PhysicsEngine.process_with_context v2/crates/wifi-densepose-physics/src/engine.rs:206— MethodTooLong — process_with_context runs 231 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 131 over it, 2.31× 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: SettingsPanel.createDOMStructure ui/components/SettingsPanel.js:118— MethodTooLong — createDOMStructure runs 211 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 111 over it, 2.11× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PoseDetectionCanvas.addComponentStyles ui/components/PoseDetectionCanvas.js:125— MethodTooLong — addComponentStyles runs 196 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 96 over it, 1.96× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: NvGhostMurmur.render dashboard/src/components/nv-ghost-murmur.ts:470— MethodTooLong — render runs 186 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 86 over it, 1.86× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: FieldModel.finalize_calibration v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1045— MethodTooLong — finalize_calibration runs 179 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 79 over it, 1.79× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Connection.handle_cmd v2/crates/homecore-api/src/ws.rs:241— MethodTooLong — handle_cmd runs 175 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 75 over it, 1.75× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: LiveDemoTab.createEnhancedStructure ui/components/LiveDemoTab.js:142— MethodTooLong — createEnhancedStructure runs 172 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 72 over it, 1.72× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SurvivorTracker.update v2/crates/wifi-densepose-mat/src/tracking/tracker.rs:173— MethodTooLong — update runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Trainer.train v2/crates/wifi-densepose-train/src/trainer.rs:115— MethodTooLong — train runs 162 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted) in one body. The bar is 100 significant lines; this is 62 over it, 1.62× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SettingsPanel.addSettingsStyles ui/components/SettingsPanel.js:343— MethodTooLong — addSettingsStyles runs 146 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 46 over it, 1.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: PoseDecoder._trackFromMotionGrid ui/pose-fusion/js/pose-decoder.js:188— MethodTooLong — _trackFromMotionGrid runs 137 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 37 over it, 1.37× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: QuickSettings.createPanel ui/utils/quick-settings.js:34— MethodTooLong — createPanel runs 136 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 36 over it, 1.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: NvGhostMurmur.renderDemo dashboard/src/components/nv-ghost-murmur.ts:336— MethodTooLong — renderDemo runs 126 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 26 over it, 1.26× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: Esp32CsiParser.parse_frame v2/crates/wifi-densepose-hardware/src/esp32_parser.rs:101— MethodTooLong — parse_frame runs 120 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 20 over it, 1.20× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DemoDataGenerator._securityPatrol ui/observatory/js/demo-data.js:1521— MethodTooLong — _securityPatrol runs 114 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 14 over it, 1.14× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: SeizureDetector.process_frame v2/crates/wifi-densepose-wasm-edge/src/med_seizure_detect.rs:171— MethodTooLong — process_frame runs 112 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 12 over it, 1.12× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DataProcessor._buildDemoPoses ui/services/data-processor.js:211— MethodTooLong — _buildDemoPoses runs 110 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: GhostHunterDetector.process_frame v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:201— MethodTooLong — process_frame runs 110 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 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PerimeterBreachDetector.process_frame v2/crates/wifi-densepose-wasm-edge/src/sec_perimeter_breach.rs:143— MethodTooLong — process_frame runs 110 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 10 over it, 1.10× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: PoseDetectionCanvas.addModalStyles ui/components/PoseDetectionCanvas.js:1317— MethodTooLong — addModalStyles runs 108 significant lines (blank, comment-only and punctuation-only lines excluded) 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.
MethodTooLong: TrainingConfig.validate v2/crates/wifi-densepose-train/src/config.rs:364— MethodTooLong — validate runs 106 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 6 over it, 1.06× 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: DiscoveryBuilder.build v2/crates/wifi-densepose-sensing-server/src/mqtt/discovery.rs:336— MethodTooLong — build runs 105 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 5 over it, 1.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
MethodTooLong: DemoDataGenerator._sleepMonitoring ui/observatory/js/demo-data.js:571— MethodTooLong — _sleepMonitoring runs 104 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 4 over it, 1.04× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Duplicated block (7 lines × 2) python/src/bindings/aether.rs:302— python/src/bindings/aether.rs:302-308 | v2/crates/wifi-densepose-aether/src/embedding.rs:462-468 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) v2/crates/homecore-assist/src/handler.rs:67— v2/crates/homecore-assist/src/handler.rs:67-73 | v2/crates/homecore-assist/src/handler.rs:100-106 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) v2/crates/ruview-groundtruth/src/autolabel.rs:56— v2/crates/ruview-groundtruth/src/autolabel.rs:56-62 | v2/crates/ruview-groundtruth/src/radar.rs:136-142 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) v2/crates/ruview-unified/src/gaussian/primitive.rs:258— v2/crates/ruview-unified/src/gaussian/primitive.rs:258-264 | v2/crates/ruview-unified/src/gaussian/primitive.rs:272-278 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-bfld/src/ha_discovery.rs:199— v2/crates/wifi-densepose-bfld/src/ha_discovery.rs:199-205 | v2/crates/wifi-densepose-bfld/src/mqtt_topics.rs:170-176 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:96— v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:96-102 | v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs:108-114 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs` and `v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-mat/src/localization/triangulation.rs:75— v2/crates/wifi-densepose-mat/src/localization/triangulation.rs:75-81 | v2/crates/wifi-densepose-mat/src/localization/triangulation.rs:103-109 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-privshield/src/attacker.rs:213— v2/crates/wifi-densepose-privshield/src/attacker.rs:213-219 | wifi-veil/src/attacker.rs:213-219 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/attacker.rs` and `wifi-veil/src/attacker.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-privshield/src/experiment.rs:207— v2/crates/wifi-densepose-privshield/src/experiment.rs:207-213 | wifi-veil/src/experiment.rs:207-213 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/experiment.rs` and `wifi-veil/src/experiment.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-privshield/src/identity.rs:148— v2/crates/wifi-densepose-privshield/src/identity.rs:148-154 | wifi-veil/src/identity.rs:148-154 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/identity.rs` and `wifi-veil/src/identity.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-privshield/src/prng.rs:75— v2/crates/wifi-densepose-privshield/src/prng.rs:75-81 | wifi-veil/src/prng.rs:75-81 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:398— v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:398-405 | v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:461-467 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:446— v2/crates/wifi-densepose-sensing-server/src/csi.rs:446-452 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:465-471 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-signal/src/ruvsense/cir.rs:934— v2/crates/wifi-densepose-signal/src/ruvsense/cir.rs:934-940 | v2/crates/wifi-densepose-signal/src/ruvsense/cir.rs:953-959 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) v2/patches/ruvector-crv/src/session.rs:171— v2/patches/ruvector-crv/src/session.rs:171-177 | v2/patches/ruvector-crv/src/session.rs:246-252 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) v2/crates/cog-person-count/src/inference.rs:237— v2/crates/cog-person-count/src/inference.rs:237-243 | v2/crates/cog-pose-estimation/src/inference.rs:349-355 — before extracting anything, compare `v2/crates/cog-person-count/src/inference.rs` and `v2/crates/cog-pose-estimation/src/inference.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/ruview-certify/src/lib.rs:117— v2/crates/ruview-certify/src/lib.rs:117-123 | v2/crates/ruview-policy/src/lib.rs:448-454 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:23— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:23-29 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:23-29 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:158— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:158-164 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:146-152 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:174— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:174-180 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:162-168 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:542— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:542-548 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:532-538 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs:50— v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs:50-56 | v2/crates/wifi-densepose-sensing-server/src/udp_bind.rs:125-131 — before extracting anything, compare `v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs` and `v2/crates/wifi-densepose-sensing-server/src/udp_bind.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs:58— v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs:58-64 | v2/crates/wifi-densepose-sensing-server/src/udp_bind.rs:133-139 — before extracting anything, compare `v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs` and `v2/crates/wifi-densepose-sensing-server/src/udp_bind.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-physics/src/projector/pbd.rs:195— v2/crates/wifi-densepose-physics/src/projector/pbd.rs:195-201 | v2/crates/wifi-densepose-physics/src/skeleton.rs:132-138 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (7 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:324— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:324-330 | wifi-veil/src/bin/veil.rs:324-330 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) v2/crates/homecore-hap/src/mdns.rs:56— v2/crates/homecore-hap/src/mdns.rs:56-60 | v2/crates/homecore-hap/src/pairing.rs:487-491 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) v2/crates/ruview-groundtruth/src/align.rs:177— v2/crates/ruview-groundtruth/src/align.rs:177-181 | v2/crates/wifi-densepose-vitals/src/breathing.rs:317-322 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) v2/crates/ruview-unified/src/heads.rs:50— v2/crates/ruview-unified/src/heads.rs:50-54 | v2/crates/ruview-unified/src/heads.rs:225-229 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/ruview-unified/src/heads.rs:137— v2/crates/ruview-unified/src/heads.rs:137-141 | v2/crates/ruview-unified/src/heads.rs:311-315 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-mat/src/detection/breathing.rs:186— v2/crates/wifi-densepose-mat/src/detection/breathing.rs:186-190 | v2/crates/wifi-densepose-mat/src/detection/heartbeat.rs:289-296 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-mat/src/detection/breathing.rs:217— v2/crates/wifi-densepose-mat/src/detection/breathing.rs:217-221 | v2/crates/wifi-densepose-mat/src/detection/heartbeat.rs:322-326 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-privshield/src/optimize.rs:84— v2/crates/wifi-densepose-privshield/src/optimize.rs:84-88 | wifi-veil/src/optimize.rs:84-88 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/optimize.rs` and `wifi-veil/src/optimize.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-privshield/src/prng.rs:34— v2/crates/wifi-densepose-privshield/src/prng.rs:34-38 | wifi-veil/src/prng.rs:34-38 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-privshield/src/proof.rs:41— v2/crates/wifi-densepose-privshield/src/proof.rs:41-45 | wifi-veil/src/proof.rs:41-45 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-privshield/src/proof.rs:49— v2/crates/wifi-densepose-privshield/src/proof.rs:49-53 | wifi-veil/src/proof.rs:49-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-privshield/src/throughput.rs:105— v2/crates/wifi-densepose-privshield/src/throughput.rs:105-109 | wifi-veil/src/throughput.rs:105-109 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-ruvector/src/estimator.rs:168— v2/crates/wifi-densepose-ruvector/src/estimator.rs:168-172 | v2/crates/wifi-densepose-ruvector/src/estimator.rs:288-292 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:77— v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:77-81 | v2/crates/wifi-densepose-sensing-server/src/training_api.rs:387-391 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:347— v2/crates/wifi-densepose-sensing-server/src/csi.rs:347-351 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3937-3942 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-privshield/src/optimize.rs:282— v2/crates/wifi-densepose-privshield/src/optimize.rs:282-286 | wifi-veil/src/optimize.rs:282-286 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/optimize.rs` and `wifi-veil/src/optimize.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-privshield/src/prng.rs:52— v2/crates/wifi-densepose-privshield/src/prng.rs:52-56 | wifi-veil/src/prng.rs:52-56 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:48— v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:48-52 | v2/crates/wifi-densepose-ruvector/src/coverage.rs:59-63 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-train/src/trainer.rs:591— v2/crates/wifi-densepose-train/src/trainer.rs:591-595 | v2/crates/wifi-densepose-train/src/trainer.rs:596-600 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-sensing-server/src/mqtt/discovery.rs:410— v2/crates/wifi-densepose-sensing-server/src/mqtt/discovery.rs:410-414 | v2/crates/wifi-densepose-sensing-server/src/mqtt/discovery.rs:417-421 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:1163— v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:1163-1167 | v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:1169-1173 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-train/src/trainer.rs:596— v2/crates/wifi-densepose-train/src/trainer.rs:596-600 | v2/crates/wifi-densepose-train/src/trainer.rs:650-654 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/homecore-hap/src/pair_setup.rs:259— v2/crates/homecore-hap/src/pair_setup.rs:259-263 | v2/crates/homecore-hap/src/pair_verify.rs:100-104 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) v2/crates/ruview-unified/src/heads.rs:296— v2/crates/ruview-unified/src/heads.rs:296-300 | v2/crates/ruview-unified/src/heads.rs:320-324 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-occworld-candle/src/transformer.rs:106— v2/crates/wifi-densepose-occworld-candle/src/transformer.rs:106-110 | v2/crates/wifi-densepose-occworld-candle/src/transformer.rs:196-200 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) v2/crates/wifi-densepose-occworld-candle/src/vqvae.rs:217— v2/crates/wifi-densepose-occworld-candle/src/vqvae.rs:217-221 | v2/crates/wifi-densepose-occworld-candle/src/vqvae.rs:249-253 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
+ 7 more in this group — see findings.md.
AC6 · Visual & motion safety· Animation without a prefers-reduced-motion guard · ×31
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/App.tsx:129— <div> moves — its inline style sets `animation: gradient-shift 4s ease infinite` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/pages/FlashFirmware.tsx:320— <div> moves — its inline style sets `transition: width 0.3s ease` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:930— <div> moves — its inline style sets `transition: transform 0.1s, box-shadow 0.1s` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:476— <span> moves — its inline style sets `animation: isAnimating` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx:714— <div> moves — its inline style sets `transition: width 0.3s ease` — and nothing reads prefers-reduced-motion for it, so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Gate it on @media (prefers-reduced-motion: no-preference) or motion-safe:.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/design-system.css:303— `.card-glow::before` moves (`animation: gradient-shift 3s ease infinite`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/design-system.css:414— `.animate-fade-in` moves (`animation: fade-in 0.25s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/design-system.css:419— `.page-transition` moves (`animation: fade-in-scale 0.3s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/design-system.css:424— `.stagger-children > *` moves (`animation: fade-in 0.3s ease-out backwards`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard v2/crates/wifi-densepose-desktop/ui/src/design-system.css:495— `.btn-gradient` moves (`transition: box-shadow var(--transition-normal), background-position 0.4s ease, transform var(--transition-fast)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard v2/crates/homecore-server/ui/css/app.css:103— `.card.clickable` moves (`transition: transform .12s, border-color .12s, box-shadow .12s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard v2/crates/homecore-server/ui/css/app.css:126— `.btn` moves (`transition: filter .12s, background .12s, transform .05s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard v2/crates/homecore-server/ui/css/app.css:150— `.bar > span` moves (`transition: width .3s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard v2/crates/homecore-server/ui/css/app.css:214— `.collapsible > .head::before` moves (`transition: transform .15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard examples/frontend/src/styles/base.css:137— `.hc-card` moves (`transition: transform 200ms, border-color 200ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard examples/frontend/src/components/StateCard.ts:33— `.css-in-js .card` moves (`transition: transform 200ms, border-color 200ms`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-app-store.ts:112— `.css-in-js .card` moves (`transition: border-color 0.15s, transform 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-app-store.ts:216— `.css-in-js .toggle::after` moves (`transition: transform 0.15s, background 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-app.ts:49— `.css-in-js .skip-link` moves (`transition: top 0.15s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-ghost-murmur.ts:239— `.css-in-js .tier-bar .fill` moves (`transition: width 0.2s ease-out`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-help.ts:118— `.css-in-js .modal` moves (`transition: transform 0.22s cubic-bezier(0.2,0.7,0.3,1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-home.ts:70— `.css-in-js .cta` moves (`transition: transform 0.12s, border-color 0.12s, filter 0.12s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-home.ts:114— `.css-in-js .card` moves (`transition: transform 0.12s, border-color 0.12s, background 0.12s`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-modal.ts:43— `.css-in-js .modal` moves (`transition: transform 0.22s cubic-bezier(0.2,0.7,0.3,1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Animation without a prefers-reduced-motion guard dashboard/src/components/nv-onboarding.ts:211— `.css-in-js .card` moves (`transition: transform 0.22s cubic-bezier(0.2,0.7,0.3,1)`) and nothing reads prefers-reduced-motion for it — no @media (prefers-reduced-motion) rule for this element, no reset this project loads — so a motion-sensitive user cannot turn it off (WCAG 2.3.3). Declare it under @media (prefers-reduced-motion: no-preference), or neutralise it under reduce.
Sync-over-async blocking v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:470— `configure_esp32_wifi` is async and calls thread::sleep — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs.
Sync-over-async blocking REDACTED:91— `main` is async and calls thread::sleep — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs.
Sync-over-async blocking REDACTED:192— `train` is async and calls thread::sleep — a blocking call inside async code stalls the executor thread, and every task scheduled on it for as long as it runs.
Sync-over-async blocking harness/homecore/bin/cli.js:157— `existsSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/homecore/bin/cli.js:161— `readFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/homecore/bin/cli.js:287— `readFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview-kernel/bin/cli.js:123— `writeFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview-kernel/bin/cli.js:157— `readFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/cli.js:255— `readFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/cli.js:275— `readFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/cli.js:298— `existsSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/cli.js:299— `readFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/cli.js:307— `existsSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/cli.js:421— `readFileSync` in `run` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/doctor.js:101— `existsSync` in `callback to filter` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/doctor.js:109— `existsSync` in `runDoctor` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/doctor.js:143— `existsSync` in `runDoctor` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/doctor.js:145— `readdirSync` in `runDoctor` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/tools.js:238— `existsSync` in `handler` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/training.js:136— `existsSync` in `runTraining` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking harness/ruview/src/training.js:150— `mkdirSync` in `runTraining` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:180— `mkdirSync` in `trainCount` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:209— `appendFileSync` in `trainCount` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:212— `openSync` in `trainCount` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Sync-over-async blocking REDACTED:213— `openSync` in `trainCount` blocks the event loop until it finishes — a blocking call inside async code stalls the event loop — every other request waits for as long as it runs.
Duplicated block (8 lines × 2) v2/crates/ruview-unified/src/gaussian/map.rs:97— v2/crates/ruview-unified/src/gaussian/map.rs:97-104 | v2/crates/ruview-unified/src/gaussian/map.rs:228-235 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/ruview-unified/src/heads.rs:162— v2/crates/ruview-unified/src/heads.rs:162-169 | v2/crates/ruview-unified/src/heads.rs:333-340 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:321— v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:321-329 | v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:425-432 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs:107— v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs:107-114 | v2/crates/wifi-densepose-sensing-server/src/udp_bind.rs:196-203 — before extracting anything, compare `v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs` and `v2/crates/wifi-densepose-sensing-server/src/udp_bind.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:680— v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:680-687 | v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:703-710 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-sensing-server/src/dataset.rs:538— v2/crates/wifi-densepose-sensing-server/src/dataset.rs:538-545 | v2/crates/wifi-densepose-sensing-server/src/dataset.rs:687-694 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-sensing-server/src/rvf_container.rs:590— v2/crates/wifi-densepose-sensing-server/src/rvf_container.rs:590-597 | v2/crates/wifi-densepose-sensing-server/src/rvf_container.rs:617-624 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-sensing-server/src/trainer.rs:115— v2/crates/wifi-densepose-sensing-server/src/trainer.rs:115-122 | v2/crates/wifi-densepose-sensing-server/src/trainer.rs:375-382 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-sensing-server/src/vendor_mist_netgear.rs:504— v2/crates/wifi-densepose-sensing-server/src/vendor_mist_netgear.rs:504-511 | v2/crates/wifi-densepose-sensing-server/src/vendor_origin_plume.rs:377-384 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-signal/src/phase_sanitizer.rs:316— v2/crates/wifi-densepose-signal/src/phase_sanitizer.rs:316-323 | v2/crates/wifi-densepose-signal/src/phase_sanitizer.rs:387-394 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-train/src/losses.rs:430— v2/crates/wifi-densepose-train/src/losses.rs:430-437 | v2/crates/wifi-densepose-train/src/losses.rs:441-448 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-train/src/subcarrier.rs:76— v2/crates/wifi-densepose-train/src/subcarrier.rs:76-83 | v2/crates/wifi-densepose-train/src/subcarrier.rs:187-194 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-aether/src/embedding.rs:33— v2/crates/wifi-densepose-aether/src/embedding.rs:33-40 | v2/crates/wifi-densepose-aether/src/graph_transformer.rs:22-29 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:78— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:78-85 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:84-91 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-privshield/src/prng.rs:63— v2/crates/wifi-densepose-privshield/src/prng.rs:63-70 | wifi-veil/src/prng.rs:63-70 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:421— v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:421-428 | v2/crates/wifi-densepose-wasm-edge/src/sig_mincut_person_match.rs:342-349 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-desktop/src/commands/wasm.rs:109— v2/crates/wifi-densepose-desktop/src/commands/wasm.rs:109-116 | v2/crates/wifi-densepose-desktop/src/commands/wasm.rs:171-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/wifi-densepose-vitals/src/anomaly.rs:171— v2/crates/wifi-densepose-vitals/src/anomaly.rs:171-178 | v2/crates/wifi-densepose-vitals/src/anomaly.rs:202-209 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) v2/crates/ruview-unified/src/heads.rs:122— v2/crates/ruview-unified/src/heads.rs:122-129 | v2/crates/ruview-unified/src/heads.rs:146-153 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) references/script_2.py:46— references/script_2.py:46-54 | references/script_4.py:40-47 — before extracting anything, compare `references/script_2.py` and `references/script_4.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 51 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 2) scripts/provision.py:48— scripts/provision.py:48-55 | scripts/provision.py:59-66 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) scripts/collect-training-data.py:75— scripts/collect-training-data.py:75-82 | scripts/record-csi-udp.py:31-38 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) examples/medical/bp_estimator.py:315— examples/medical/bp_estimator.py:315-322 | examples/stress/hrv_stress_monitor.py:94-101 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (8 lines × 2) examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:40— examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:40-47 | examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py:37-44 — before extracting anything, compare `examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py` and `examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) v2/crates/ruview-unified/src/heads.rs:174— v2/crates/ruview-unified/src/heads.rs:174-182 | v2/crates/ruview-unified/src/heads.rs:345-353 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:417— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:417-425 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:407-415 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-mat/src/domain/scan_zone.rs:147— v2/crates/wifi-densepose-mat/src/domain/scan_zone.rs:147-155 | v2/crates/wifi-densepose-wasm/src/mat.rs:381-389 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-mat/src/ml/debris_model.rs:406— v2/crates/wifi-densepose-mat/src/ml/debris_model.rs:406-414 | v2/crates/wifi-densepose-mat/src/ml/vital_signs_classifier.rs:414-422 — before extracting anything, compare `v2/crates/wifi-densepose-mat/src/ml/debris_model.rs` and `v2/crates/wifi-densepose-mat/src/ml/vital_signs_classifier.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-physics/src/engine.rs:376— v2/crates/wifi-densepose-physics/src/engine.rs:376-384 | v2/crates/wifi-densepose-physics/src/engine.rs:625-633 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-privshield/src/optimize.rs:306— v2/crates/wifi-densepose-privshield/src/optimize.rs:306-314 | wifi-veil/src/optimize.rs:306-314 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/optimize.rs` and `wifi-veil/src/optimize.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:801— v2/crates/wifi-densepose-sensing-server/src/csi.rs:801-809 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4828-4836 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:4064— v2/crates/wifi-densepose-sensing-server/src/main.rs:4064-4072 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4087-4095 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:10032— v2/crates/wifi-densepose-sensing-server/src/main.rs:10032-10040 | v2/crates/wifi-densepose-sensing-server/src/main.rs:10096-10104 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-sensing-server/src/model_manager.rs:125— v2/crates/wifi-densepose-sensing-server/src/model_manager.rs:125-133 | v2/crates/wifi-densepose-sensing-server/src/recording.rs:228-236 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-signal/src/bin/calibration_proof_runner.rs:269— v2/crates/wifi-densepose-signal/src/bin/calibration_proof_runner.rs:269-277 | v2/crates/wifi-densepose-signal/src/bin/cir_proof_runner.rs:208-216 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/bin/ghost_hunter.rs:63— v2/crates/wifi-densepose-wasm-edge/src/bin/ghost_hunter.rs:63-71 | v2/crates/wifi-densepose-wasm-edge/src/lib.rs:677-685 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-wifiscan/src/adapter/wlanapi_scanner.rs:293— v2/crates/wifi-densepose-wifiscan/src/adapter/wlanapi_scanner.rs:293-301 | v2/crates/wifi-densepose-wifiscan/src/adapter/wlanapi_scanner.rs:344-352 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-mat/src/ml/debris_model.rs:484— v2/crates/wifi-densepose-mat/src/ml/debris_model.rs:484-492 | v2/crates/wifi-densepose-mat/src/ml/vital_signs_classifier.rs:657-665 — before extracting anything, compare `v2/crates/wifi-densepose-mat/src/ml/debris_model.rs` and `v2/crates/wifi-densepose-mat/src/ml/vital_signs_classifier.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-nn/src/densepose.rs:245— v2/crates/wifi-densepose-nn/src/densepose.rs:245-253 | v2/crates/wifi-densepose-nn/src/translator.rs:296-304 — before extracting anything, compare `v2/crates/wifi-densepose-nn/src/densepose.rs` and `v2/crates/wifi-densepose-nn/src/translator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:43— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:43-51 | wifi-veil/src/bin/veil.rs:43-51 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-privshield/src/throughput.rs:67— v2/crates/wifi-densepose-privshield/src/throughput.rs:67-75 | wifi-veil/src/throughput.rs:67-75 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-privshield/src/throughput.rs:91— v2/crates/wifi-densepose-privshield/src/throughput.rs:91-99 | wifi-veil/src/throughput.rs:91-99 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (9 lines × 2) v2/crates/wifi-densepose-desktop/src/commands/provision.rs:64— v2/crates/wifi-densepose-desktop/src/commands/provision.rs:64-72 | v2/crates/wifi-densepose-desktop/src/commands/provision.rs:139-147 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) archive/v1/src/database/connection.py:197— archive/v1/src/database/connection.py:197-205 | archive/v1/src/database/connection.py:279-287 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) references/script_7.py:21— references/script_7.py:21-29 | references/script_7.py:37-46 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) references/wifi_densepose_pytorch.py:121— references/wifi_densepose_pytorch.py:121-129 | references/wifi_densepose_pytorch.py:133-141 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `references/wifi_densepose_pytorch.py:121` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
AC1 · Text alternatives· <canvas> without a text alternative · ×21
<canvas> without a text alternative integrations/iphone-lidar/web/index.html:26— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/components/PoseDetectionCanvas.js:112— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/components/SensingTab.js:65— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/icons/generate.html:6— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/icons/generate.html:7— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/mobile/src/assets/webview/mat-dashboard.html:51— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/observatory.html:10— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/pose-fusion.html:39— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/pose-fusion.html:82— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/pose-fusion.html:99— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/pose-fusion.html:107— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/utils/perf-monitor.js:34— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/utils/perf-monitor.js:39— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative ui/utils/perf-monitor.js:44— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:541— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative v2/crates/wifi-densepose-privshield/ui/veil-console.html:435— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative v2/crates/wifi-densepose-privshield/ui/veil-console.html:442— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative v2/crates/wifi-densepose-privshield/ui/veil-console.html:449— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative wifi-veil/ui/veil-console.html:435— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative wifi-veil/ui/veil-console.html:442— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
<canvas> without a text alternative wifi-veil/ui/veil-console.html:449— A <canvas> with no aria-label/title and no inner fallback content can't be described by assistive tech. Add a name or fallback content.
Hotspot: v2/crates/wifi-densepose-sensing-server/src/main.rs v2/crates/wifi-densepose-sensing-server/src/main.rs:13795— v2/crates/wifi-densepose-sensing-server/src/main.rs changed 64 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 102 in wifi_densepose_sensing_server::main at line 13795. 48 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-sensing-server/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: firmware/esp32-csi-node/provision.py firmware/esp32-csi-node/provision.py:649— firmware/esp32-csi-node/provision.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 70 in provision.main at line 649. 7 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- firmware/esp32-csi-node/provision.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: harness/ruview/src/cli.js harness/ruview/src/cli.js:243— harness/ruview/src/cli.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 95 in cli.run at line 243. 1 of those changes was a fix/bug commit, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- harness/ruview/src/cli.js`: 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: harness/ruview/src/doctor.js harness/ruview/src/doctor.js:63— harness/ruview/src/doctor.js changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 99 in doctor.runDoctor at line 63. 1 of those changes was a fix/bug commit, and the other 2 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- harness/ruview/src/doctor.js`: 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: harness/ruview/mod/hooks/register.mjs harness/ruview/mod/hooks/register.mjs:49— harness/ruview/mod/hooks/register.mjs changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in register.register at line 49. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- harness/ruview/mod/hooks/register.mjs`: 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: harness/ruview/src/devices/esp32.js harness/ruview/src/devices/esp32.js:111— harness/ruview/src/devices/esp32.js changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 40 in esp32.parsePacket at line 111. 3 of those changes were fix/bug commits, and the other 3 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- harness/ruview/src/devices/esp32.js`: 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: v2/crates/homecore-api/src/ws.rs v2/crates/homecore-api/src/ws.rs:241— v2/crates/homecore-api/src/ws.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 43 in Connection::handle_cmd at line 241. 1 of those changes was a fix/bug commit, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/homecore-api/src/ws.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: v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1045— v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in FieldModel::finalize_calibration at line 1045. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: scripts/render-readme-visuals.py scripts/render-readme-visuals.py:19— scripts/render-readme-visuals.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in render-readme-visuals.icon at line 19. 2 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- scripts/render-readme-visuals.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: v2/crates/wifi-densepose-sensing-server/src/training_api.rs v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1108— v2/crates/wifi-densepose-sensing-server/src/training_api.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in wifi_densepose_sensing_server::training_api::run_training_job at line 1108. 3 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-sensing-server/src/training_api.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: harness/ruview/src/mcp-server.js harness/ruview/src/mcp-server.js:60— harness/ruview/src/mcp-server.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in mcp-server.handleRpc at line 60. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- harness/ruview/src/mcp-server.js`: 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: v2/crates/wifi-densepose-sensing-server/src/mqtt/publisher.rs v2/crates/wifi-densepose-sensing-server/src/mqtt/publisher.rs:209— v2/crates/wifi-densepose-sensing-server/src/mqtt/publisher.rs changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in wifi_densepose_sensing_server::mqtt::publisher::run at line 209. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-sensing-server/src/mqtt/publisher.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: ui/services/sensing.service.js ui/services/sensing.service.js:189— ui/services/sensing.service.js changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in SensingService._connect at line 189. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- ui/services/sensing.service.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:53— REDACTED changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in mcp-http.startMcpHttp at line 53. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: harness/ruview/src/devices/lidar.js harness/ruview/src/devices/lidar.js:104— harness/ruview/src/devices/lidar.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in lidar.readIphoneLidar at line 104. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- harness/ruview/src/devices/lidar.js`: 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: v2/crates/wifi-densepose-hardware/src/esp32_parser.rs v2/crates/wifi-densepose-hardware/src/esp32_parser.rs:101— v2/crates/wifi-densepose-hardware/src/esp32_parser.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in Esp32CsiParser::parse_frame at line 101. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-hardware/src/esp32_parser.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: REDACTED REDACTED:85— REDACTED changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in main.init at line 85. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: v2/crates/homecore-migrate/src/main.rs v2/crates/homecore-migrate/src/main.rs:21— v2/crates/homecore-migrate/src/main.rs changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 15 in homecore_migrate::main at line 21. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/homecore-migrate/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: harness/ruview/src/devices/mmwave.js harness/ruview/src/devices/mmwave.js:149— harness/ruview/src/devices/mmwave.js changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in mmwave.readMmwave at line 149. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- harness/ruview/src/devices/mmwave.js`: 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.
wifi_densepose_sensing_server::main (cyclomatic 102) v2/crates/wifi-densepose-sensing-server/src/main.rs:13795— wifi_densepose_sensing_server::main has cyclomatic complexity 102 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
wifi_densepose_sensing_server::udp_receiver_task (cyclomatic 84) v2/crates/wifi-densepose-sensing-server/src/main.rs:12218— wifi_densepose_sensing_server::udp_receiver_task has cyclomatic complexity 84 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
wifi_densepose_sensing_server::adaptive_classifier::train_from_recordings (cyclomatic 38) v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:468— wifi_densepose_sensing_server::adaptive_classifier::train_from_recordings has cyclomatic complexity 38 (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.
wifi_densepose_sensing_server::training_api::run_training_job (cyclomatic 36) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1108— wifi_densepose_sensing_server::training_api::run_training_job has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
wifi_densepose_sensing_server::calibration_promote_bootstrap (cyclomatic 31) v2/crates/wifi-densepose-sensing-server/src/main.rs:9897— wifi_densepose_sensing_server::calibration_promote_bootstrap has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
wifi_densepose_sensing_server::calibration_refine_bootstrap (cyclomatic 27) v2/crates/wifi-densepose-sensing-server/src/main.rs:10167— wifi_densepose_sensing_server::calibration_refine_bootstrap has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
wifi_densepose_sensing_server::bearer_auth::require_bearer (cyclomatic 22) v2/crates/wifi-densepose-sensing-server/src/bearer_auth.rs:519— wifi_densepose_sensing_server::bearer_auth::require_bearer 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.
wifi_densepose_sensing_server::csi::estimate_persons_from_correlation (cyclomatic 21) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1000— wifi_densepose_sensing_server::csi::estimate_persons_from_correlation 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.
wifi_densepose_sensing_server::estimate_persons_from_correlation (cyclomatic 21) v2/crates/wifi-densepose-sensing-server/src/main.rs:6524— wifi_densepose_sensing_server::estimate_persons_from_correlation 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.
wifi_densepose_sensing_server::training_api::compute_teacher_targets (cyclomatic 19) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:666— wifi_densepose_sensing_server::training_api::compute_teacher_targets 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.
wifi_densepose_sensing_server::wifi_task (cyclomatic 18) v2/crates/wifi-densepose-sensing-server/src/main.rs:4874— wifi_densepose_sensing_server::wifi_task 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.
wifi_densepose_sensing_server::mqtt::publisher::run (cyclomatic 18) v2/crates/wifi-densepose-sensing-server/src/mqtt/publisher.rs:209— wifi_densepose_sensing_server::mqtt::publisher::run 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.
wifi_densepose_sensing_server::training_api::extract_features_for_frame (cyclomatic 18) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:530— wifi_densepose_sensing_server::training_api::extract_features_for_frame 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.
wifi_densepose_sensing_server::csi::smooth_vitals (cyclomatic 17) v2/crates/wifi-densepose-sensing-server/src/csi.rs:811— wifi_densepose_sensing_server::csi::smooth_vitals 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. This shape REPEATS in the file: one other method here (wifi_densepose_sensing_server::csi::smooth_vitals_node) 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.
wifi_densepose_sensing_server::csi::smooth_vitals_node (cyclomatic 17) v2/crates/wifi-densepose-sensing-server/src/csi.rs:865— wifi_densepose_sensing_server::csi::smooth_vitals_node 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. This shape REPEATS in the file: one other method here (wifi_densepose_sensing_server::csi::smooth_vitals) 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.
wifi_densepose_sensing_server::smooth_vitals (cyclomatic 17) v2/crates/wifi-densepose-sensing-server/src/main.rs:4690— wifi_densepose_sensing_server::smooth_vitals 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. This shape REPEATS in the file: one other method here (wifi_densepose_sensing_server::smooth_vitals_node) 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.
wifi_densepose_sensing_server::smooth_vitals_node (cyclomatic 17) v2/crates/wifi-densepose-sensing-server/src/main.rs:4760— wifi_densepose_sensing_server::smooth_vitals_node 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. This shape REPEATS in the file: one other method here (wifi_densepose_sensing_server::smooth_vitals) 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.
wifi_densepose_sensing_server::handle_ws_pose_client (cyclomatic 16) v2/crates/wifi-densepose-sensing-server/src/main.rs:5924— wifi_densepose_sensing_server::handle_ws_pose_client 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.
D30 · Dependency Vulnerabilities· Medium CVE · ×18
Off the main sequence: nvsim — nvsim: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: ruview-cognitum-spaces — ruview-cognitum-spaces: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: ruview-evidence — ruview-evidence: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 5 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-aether — wifi-densepose-aether: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-rufield — wifi-densepose-rufield: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-ruvector — wifi-densepose-ruvector: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-vitals — wifi-densepose-vitals: abstractness 0.00, instability 0.00, distance 1.00 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-wifiscan — wifi-densepose-wifiscan: abstractness 0.03, instability 0.00, distance 0.97 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-nn — wifi-densepose-nn: abstractness 0.03, instability 0.00, distance 0.97 — zone of pain — concrete and depended on by 1 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-hardware — wifi-densepose-hardware: abstractness 0.04, instability 0.00, distance 0.96 — zone of pain — concrete and depended on by 4 project(s), so it's rigid to change.
Off the main sequence: ruview-ontology — ruview-ontology: abstractness 0.04, instability 0.00, distance 0.96 — zone of pain — concrete and depended on by 11 project(s), so it's rigid to change.
Off the main sequence: homecore (Cargo) — homecore (Cargo): abstractness 0.05, instability 0.00, distance 0.95 — zone of pain — concrete and depended on by 8 project(s), so it's rigid to change.
Off the main sequence: ruview-auth — ruview-auth: abstractness 0.06, instability 0.00, distance 0.94 — zone of pain — concrete and depended on by 2 project(s), so it's rigid to change.
Off the main sequence: ruview-attest — ruview-attest: abstractness 0.14, instability 0.00, distance 0.86 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-bfld — wifi-densepose-bfld: abstractness 0.17, instability 0.00, distance 0.83 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-core — wifi-densepose-core: abstractness 0.23, instability 0.00, distance 0.77 — zone of pain — concrete and depended on by 10 project(s), so it's rigid to change.
Off the main sequence: wifi-densepose-signal — wifi-densepose-signal: abstractness 0.02, instability 0.22, distance 0.76 — zone of pain — concrete and depended on by 7 project(s), so it's rigid to change.
Off the main sequence: ruview-twin — ruview-twin: abstractness 0.00, instability 0.25, distance 0.75 — zone of pain — concrete and depended on by 3 project(s), so it's rigid to change.
Duplicated block (11 lines × 2) v2/crates/homecore-api/src/rest.rs:154— v2/crates/homecore-api/src/rest.rs:154-164 | v2/crates/homecore-api/src/rest.rs:289-299 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-aether/src/embedding.rs:306— v2/crates/wifi-densepose-aether/src/embedding.rs:306-316 | v2/crates/wifi-densepose-aether/src/embedding.rs:318-328 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-privshield/src/attacker.rs:315— v2/crates/wifi-densepose-privshield/src/attacker.rs:315-325 | wifi-veil/src/attacker.rs:315-325 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/attacker.rs` and `wifi-veil/src/attacker.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-privshield/src/protector.rs:200— v2/crates/wifi-densepose-privshield/src/protector.rs:200-210 | wifi-veil/src/protector.rs:200-210 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/protector.rs` and `wifi-veil/src/protector.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:14101— v2/crates/wifi-densepose-sensing-server/src/main.rs:14101-14111 | v2/crates/wifi-densepose-sensing-server/src/main.rs:14153-14163 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-sensing-server/src/model_manager.rs:162— v2/crates/wifi-densepose-sensing-server/src/model_manager.rs:162-172 | v2/crates/wifi-densepose-sensing-server/src/model_manager.rs:226-236 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:547— v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:547-557 | v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1475-1485 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) v2/patches/ruvector-crv/src/stage_iii.rs:170— v2/patches/ruvector-crv/src/stage_iii.rs:170-180 | v2/patches/ruvector-crv/src/stage_vi.rs:68-78 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:514— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:514-524 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:504-514 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-physics/src/engine.rs:769— v2/crates/wifi-densepose-physics/src/engine.rs:769-779 | v2/crates/wifi-densepose-physics/src/projector/pbd.rs:203-213 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-privshield/src/identity.rs:80— v2/crates/wifi-densepose-privshield/src/identity.rs:80-90 | wifi-veil/src/identity.rs:80-90 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/identity.rs` and `wifi-veil/src/identity.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-privshield/src/optimize.rs:60— v2/crates/wifi-densepose-privshield/src/optimize.rs:60-70 | wifi-veil/src/optimize.rs:60-70 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/optimize.rs` and `wifi-veil/src/optimize.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:680— v2/crates/wifi-densepose-sensing-server/src/csi.rs:680-690 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4365-4375 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11 lines × 2) v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:162— v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:162-172 | v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:224-234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) scripts/rvagent-mcp-consumer.py:131— scripts/rvagent-mcp-consumer.py:131-141 | scripts/rvagent-mcp-consumer.py:150-160 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) scripts/validate_qemu_output.py:244— scripts/validate_qemu_output.py:244-254 | scripts/validate_qemu_output.py:257-267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/validate_qemu_output.py:244` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:140— examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:140-150 | examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py:129-139 — before extracting anything, compare `examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py` and `examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
ClassTooLong: LiveDemoTab ui/components/LiveDemoTab.js:13— ClassTooLong — 1323 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 923 over it, 3.31× 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: DemoDataGenerator ui/observatory/js/demo-data.js:121— ClassTooLong — 1166 significant lines (blank, comment-only and punctuation-only lines excluded), 26 methods. The bar is 400 significant lines; this is 766 over it, 2.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: PoseDetectionCanvas ui/components/PoseDetectionCanvas.js:7— ClassTooLong — 1003 significant lines (blank, comment-only and punctuation-only lines excluded), 51 methods. The bar is 400 significant lines; this is 603 over it, 2.51× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: NetworkDiscovery v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:1— ClassTooLong — 707 significant lines (blank, comment-only and punctuation-only lines excluded), 14 methods. The bar is 400 significant lines; this is 307 over it, 1.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.
ClassTooLong: SettingsPanel ui/components/SettingsPanel.js:6— ClassTooLong — 702 significant lines (blank, comment-only and punctuation-only lines excluded), 27 methods. The bar is 400 significant lines; this is 302 over it, 1.76× 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: HardwareAdapter v2/crates/wifi-densepose-mat/src/integration/hardware_adapter.rs:462— 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), 41 methods, 3 blocks, lines 462-1602. 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: FieldModel v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:455— ClassTooLong — 627 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 19 methods, 2 blocks, lines 455-1630. The bar is 400 significant lines; this is 227 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: MatDashboard v2/crates/wifi-densepose-wasm/src/mat.rs:479— 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), 31 methods, 3 blocks, lines 479-1506. The bar is 400 significant lines; this is 190 over it, 1.48× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: NvGhostMurmur dashboard/src/components/nv-ghost-murmur.ts:33— ClassTooLong — 561 significant lines (blank, comment-only and punctuation-only lines excluded), 6 methods. The bar is 400 significant lines; this is 161 over it, 1.40× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: Observatory REDACTED:39— ClassTooLong — 484 significant lines (blank, comment-only and punctuation-only lines excluded), 22 methods. The bar is 400 significant lines; this is 84 over it, 1.21× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: PhysicsEngine v2/crates/wifi-densepose-physics/src/engine.rs:113— ClassTooLong — 478 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 14 methods, 2 blocks, lines 113-739. The bar is 400 significant lines; this is 78 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: ScenarioProps ui/observatory/js/scenario-props.js:27— ClassTooLong — 458 significant lines (blank, comment-only and punctuation-only lines excluded), 15 methods. The bar is 400 significant lines; this is 58 over it, 1.15× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
ClassTooLong: PoseService ui/services/pose.service.js:7— ClassTooLong — 439 significant lines (blank, comment-only and punctuation-only lines excluded), 42 methods. The bar is 400 significant lines; this is 39 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.
ClassTooLong: Trainer v2/crates/wifi-densepose-sensing-server/src/trainer.rs:584— ClassTooLong — 415 significant lines (blank, comment-only and punctuation-only lines excluded, and inline test code — #[cfg(test)] modules and bare #[test] functions — not counted), 22 methods, 2 blocks, lines 584-1171. The bar is 400 significant lines; this is 15 over it, 1.04× 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: PoseRenderer ui/utils/pose-renderer.js:3— ClassTooLong — 411 significant lines (blank, comment-only and punctuation-only lines excluded), 31 methods. The bar is 400 significant lines; this is 11 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.
D30 · Dependency Vulnerabilities· Medium vulnerability · ×15
Duplicated block (12 lines × 2) v2/crates/homecore-server/src/gateway.rs:284— v2/crates/homecore-server/src/gateway.rs:284-295 | v2/crates/homecore-server/src/gateway.rs:309-320 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) v2/crates/ruview-unified/src/gaussian/map.rs:146— v2/crates/ruview-unified/src/gaussian/map.rs:146-157 | v2/crates/ruview-unified/src/gaussian/map.rs:280-291 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:280— v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:280-291 | v2/crates/wifi-densepose-mat/src/integration/hardware_adapter.rs:756-767 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs:36— v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs:36-47 | v2/crates/wifi-densepose-sensing-server/src/udp_bind.rs:111-122 — before extracting anything, compare `v2/crates/wifi-densepose-mtk-bridge/src/listen_allow.rs` and `v2/crates/wifi-densepose-sensing-server/src/udp_bind.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:220— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:220-231 | wifi-veil/src/bin/veil.rs:220-231 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-privshield/src/protector.rs:180— v2/crates/wifi-densepose-privshield/src/protector.rs:180-191 | wifi-veil/src/protector.rs:180-191 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/protector.rs` and `wifi-veil/src/protector.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:12673— v2/crates/wifi-densepose-sensing-server/src/main.rs:12673-12684 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13159-13170 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:13909— v2/crates/wifi-densepose-sensing-server/src/main.rs:13909-13920 | v2/crates/wifi-densepose-sensing-server/src/main.rs:14192-14203 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-signal/src/features.rs:42— v2/crates/wifi-densepose-signal/src/features.rs:42-53 | v2/crates/wifi-densepose-signal/src/features.rs:110-121 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-train/src/bin/train.rs:86— v2/crates/wifi-densepose-train/src/bin/train.rs:86-97 | v2/crates/wifi-densepose-train/src/bin/verify_training.rs:81-92 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:303— v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:303-314 | v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:342-353 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) v2/crates/wifi-densepose-train/src/model.rs:717— v2/crates/wifi-densepose-train/src/model.rs:717-728 | v2/crates/wifi-densepose-train/src/model.rs:796-807 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) REDACTED:120— REDACTED:120-131 | REDACTED:182-193 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:120` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) archive/v1/src/sensing/rssi_collector.py:231— archive/v1/src/sensing/rssi_collector.py:231-242 | archive/v1/src/sensing/rssi_collector.py:568-579 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) examples/sleep/apnea_screener.py:33— examples/sleep/apnea_screener.py:33-44 | examples/stress/hrv_stress_monitor.py:74-85 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `examples/stress/hrv_stress_monitor.py:73` calls `add_argument` and `examples/sleep/apnea_screener.py:32` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D30 · Dependency Vulnerabilities· Medium advisory (unmaintained) · ×14
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:250— v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:250-259 | v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:390-399 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:550— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:550-559 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:540-549 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:972— v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:972-981 | v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:1036-1045 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-mat/src/integration/neural_adapter.rs:100— v2/crates/wifi-densepose-mat/src/integration/neural_adapter.rs:100-109 | v2/crates/wifi-densepose-mat/src/integration/neural_adapter.rs:142-151 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-mat/src/tracking/kalman.rs:211— v2/crates/wifi-densepose-mat/src/tracking/kalman.rs:211-220 | v2/crates/wifi-densepose-mat/src/tracking/kalman.rs:363-372 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs:74— v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs:74-83 | v2/crates/wifi-densepose-sensing-server/src/qualcomm_csi.rs:64-73 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1092— v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1092-1101 | v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1197-1206 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/bld_elevator_count.rs:152— v2/crates/wifi-densepose-wasm-edge/src/bld_elevator_count.rs:152-161 | v2/crates/wifi-densepose-wasm-edge/src/intrusion.rs:143-152 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/bld_lighting_zones.rs:178— v2/crates/wifi-densepose-wasm-edge/src/bld_lighting_zones.rs:178-187 | v2/crates/wifi-densepose-wasm-edge/src/occupancy.rs:142-151 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-privshield/src/optimize.rs:104— v2/crates/wifi-densepose-privshield/src/optimize.rs:104-113 | wifi-veil/src/optimize.rs:104-113 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/optimize.rs` and `wifi-veil/src/optimize.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 2) v2/crates/ruview-evidence/src/lib.rs:139— v2/crates/ruview-evidence/src/lib.rs:139-148 | v2/crates/ruview-groundtruth/src/error.rs:146-155 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1128— v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1128-1142 | v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1201-1210 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) v2/crates/wifi-densepose-desktop/src/commands/wasm.rs:19— v2/crates/wifi-densepose-desktop/src/commands/wasm.rs:19-28 | v2/crates/wifi-densepose-desktop/src/commands/wasm.rs:225-234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) scripts/train-count.py:429— scripts/train-count.py:429-438 | scripts/train-count.py:640-651 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `scripts/train-count.py:638` calls `abs`, `mean`, `item` and `scripts/train-count.py:428` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:371— v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:371-384 | v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:394-407 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-mat/src/lib.rs:332— v2/crates/wifi-densepose-mat/src/lib.rs:332-345 | v2/crates/wifi-densepose-mat/src/lib.rs:356-369 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:333— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:333-346 | wifi-veil/src/bin/veil.rs:333-346 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-privshield/src/protector.rs:133— v2/crates/wifi-densepose-privshield/src/protector.rs:133-146 | wifi-veil/src/protector.rs:133-146 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/protector.rs` and `wifi-veil/src/protector.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-privshield/src/protector.rs:160— v2/crates/wifi-densepose-privshield/src/protector.rs:160-173 | wifi-veil/src/protector.rs:160-173 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/protector.rs` and `wifi-veil/src/protector.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-ruvector/src/viewpoint/geometry.rs:295— v2/crates/wifi-densepose-ruvector/src/viewpoint/geometry.rs:295-308 | v2/crates/wifi-densepose-ruvector/src/viewpoint/geometry.rs:385-398 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-sensing-server/src/trainer.rs:880— v2/crates/wifi-densepose-sensing-server/src/trainer.rs:880-893 | v2/crates/wifi-densepose-sensing-server/src/trainer.rs:896-909 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-train/src/proof.rs:218— v2/crates/wifi-densepose-train/src/proof.rs:218-231 | v2/crates/wifi-densepose-train/src/trainer.rs:227-240 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14 lines × 2) v2/crates/wifi-densepose-train/src/protocols/leakage.rs:219— v2/crates/wifi-densepose-train/src/protocols/leakage.rs:219-232 | v2/crates/wifi-densepose-train/src/protocols/leakage.rs:254-267 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) v2/crates/homecore-api/src/rest.rs:166— v2/crates/homecore-api/src/rest.rs:166-181 | v2/crates/homecore-api/src/rest.rs:301-314 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) scripts/occworld_retrain.py:85— scripts/occworld_retrain.py:85-98 | scripts/occworld_retrain.py:171-184 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) scripts/qemu_swarm.py:670— scripts/qemu_swarm.py:670-683 | scripts/qemu_swarm.py:694-707 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/qemu_swarm.py:670` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
X2 · Cancellation propagation· Async function without AbortSignal · ×11
Async function without AbortSignal: _get v2/crates/homecore-server/ui/js/api.js:39— `_get` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: _post v2/crates/homecore-server/ui/js/api.js:44— `_post` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: _delete v2/crates/homecore-server/ui/js/api.js:53— `_delete` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: refreshSignInPanel ui/utils/quick-settings.js:298— `refreshSignInPanel` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: request ui/services/api.service.js:68— `request` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: _detectServerSource ui/services/sensing.service.js:480— `_detectServerSource` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: mintTicket ui/services/ws-ticket.js:37— `mintTicket` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: probeWsAuthRequired ui/services/ws-ticket.js:100— `probeWsAuthRequired` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: __wbg_init ui/pose-fusion/pkg/ruvector_cnn_wasm/ruvector_cnn_wasm.js:776— `__wbg_init` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: initWasm ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_browser.js:599— `initWasm` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
Async function without AbortSignal: exportProofBundle dashboard/src/transport/WsClient.ts:193— `exportProofBundle` awaits `fetch(…)` but neither accepts an AbortSignal nor passes one on, so its caller cannot stop the request once it has started. Accept `{ signal }` and pass it through: `fetch(url, { signal })`.
D30 · Dependency Vulnerabilities· Medium advisory (unsound) · ×10
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
AC3 · Page structure· Page without a main landmark · ×9
Page without a main landmark references/index.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark ui/icons/generate.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark ui/index.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark ui/mobile/src/assets/webview/mat-dashboard.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark ui/observatory.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark ui/pose-fusion.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark ui/viz.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark v2/crates/homecore-server/ui/index.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark REDACTED:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×9
Members sharing a duplicated core (4 members, 50+ identical tokens) v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:82— v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:82-94 | v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs:94-106 | v2/crates/wifi-densepose-hardware/src/bin/realtek-csi-sim.rs:62-74 | v2/crates/wifi-densepose-hardware/src/bin/rtl8720f-sim.rs:58-71 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:95— v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:95-133 | v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs:107-147 | v2/crates/wifi-densepose-hardware/src/bin/realtek-csi-sim.rs:76-107 | v2/crates/wifi-densepose-hardware/src/bin/rtl8720f-sim.rs:73-118 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) v2/crates/wifi-densepose-privshield/src/protector.rs:158— v2/crates/wifi-densepose-privshield/src/protector.rs:158-173 | v2/crates/wifi-densepose-privshield/src/protector.rs:198-210 | wifi-veil/src/protector.rs:158-173 | wifi-veil/src/protector.rs:198-210 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:36— v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:36-42 | v2/crates/wifi-densepose-ruvector/src/coverage.rs:41-47 | v2/crates/wifi-densepose-ruvector/src/hnsw.rs:622-628 | v2/crates/wifi-densepose-ruvector/src/rotation.rs:206-212 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) v2/crates/wifi-densepose-sensing-server/src/csi.rs:696— v2/crates/wifi-densepose-sensing-server/src/csi.rs:696-725 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:727-756 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4418-4466 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4470-4513 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) v2/crates/wifi-densepose-sensing-server/src/csi.rs:811— v2/crates/wifi-densepose-sensing-server/src/csi.rs:811-863 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:865-917 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4690-4757 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4760-4818 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) v2/crates/wifi-densepose-sensing-server/src/main.rs:4874— v2/crates/wifi-densepose-sensing-server/src/main.rs:4874-5150 | v2/crates/wifi-densepose-sensing-server/src/main.rs:5156-5310 | v2/crates/wifi-densepose-sensing-server/src/main.rs:12224-13258 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13323-13481 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) examples/research-sota/02-placement/r6_2_2_multistatic_placement.py:70— examples/research-sota/02-placement/r6_2_2_multistatic_placement.py:70-78 | examples/research-sota/02-placement/r6_2_3_chest_centric.py:67-74 | examples/research-sota/02-placement/r6_2_5_multi_subject.py:60-67 | examples/research-sota/02-placement/r6_2_antenna_placement.py:90-125 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Members sharing a duplicated core (4 members, 50+ identical tokens) examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:53— examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:53-59 | examples/research-sota/05-cross-room-reid/r3_2_embedding_physics_env.py:48-54 | examples/research-sota/06-structure-detection/r12_1_pose_pabs_loop.py:49-55 | examples/research-sota/06-structure-detection/r12_pabs_implementation.py:56-62 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (17 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:562— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:562-578 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:552-568 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) v2/crates/wifi-densepose-mat/src/detection/pipeline.rs:327— v2/crates/wifi-densepose-mat/src/detection/pipeline.rs:327-343 | v2/crates/wifi-densepose-mat/src/detection/pipeline.rs:393-409 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:318— v2/crates/wifi-densepose-sensing-server/src/csi.rs:318-334 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3777-3793 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs:88— v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs:88-104 | v2/crates/wifi-densepose-sensing-server/src/qualcomm_csi.rs:78-94 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) v2/crates/wifi-densepose-signal/src/ruvsense/pose_tracker.rs:643— v2/crates/wifi-densepose-signal/src/ruvsense/pose_tracker.rs:643-659 | v2/crates/wifi-densepose-wifiscan/src/pipeline/fingerprint_matcher.rs:167-183 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs:210— v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs:210-226 | v2/crates/wifi-densepose-wasm-edge/src/exo_time_crystal.rs:134-150 — before extracting anything, compare `v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs` and `v2/crates/wifi-densepose-wasm-edge/src/exo_time_crystal.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) v2/crates/wifi-densepose-mat/src/detection/breathing.rs:312— v2/crates/wifi-densepose-mat/src/detection/breathing.rs:312-328 | v2/crates/wifi-densepose-mat/src/integration/signal_adapter.rs:235-251 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) v2/crates/wifi-densepose-privshield/src/protector.rs:91— v2/crates/wifi-densepose-privshield/src/protector.rs:91-107 | wifi-veil/src/protector.rs:91-107 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/protector.rs` and `wifi-veil/src/protector.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (17 lines × 2) archive/v1/src/tasks/backup.py:247— archive/v1/src/tasks/backup.py:247-263 | archive/v1/src/tasks/backup.py:399-415 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `archive/v1/src/tasks/backup.py:420` calls `list`, `glob` and `archive/v1/src/tasks/backup.py:268` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:526— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:526-541 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:516-531 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) v2/crates/wifi-densepose-nn/src/densepose.rs:220— v2/crates/wifi-densepose-nn/src/densepose.rs:220-235 | v2/crates/wifi-densepose-nn/src/translator.rs:274-289 — before extracting anything, compare `v2/crates/wifi-densepose-nn/src/densepose.rs` and `v2/crates/wifi-densepose-nn/src/translator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) v2/crates/wifi-densepose-privshield/src/identity.rs:155— v2/crates/wifi-densepose-privshield/src/identity.rs:155-170 | wifi-veil/src/identity.rs:155-170 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/identity.rs` and `wifi-veil/src/identity.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 40 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) v2/crates/wifi-densepose-ruvector/src/viewpoint/geometry.rs:264— v2/crates/wifi-densepose-ruvector/src/viewpoint/geometry.rs:264-279 | v2/crates/wifi-densepose-ruvector/src/viewpoint/geometry.rs:341-356 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:467— v2/crates/wifi-densepose-sensing-server/src/csi.rs:467-482 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4091-4106 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7544— v2/crates/wifi-densepose-sensing-server/src/main.rs:7544-7559 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:216-231 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) archive/v1/src/models/densepose_head.py:98— archive/v1/src/models/densepose_head.py:98-113 | archive/v1/src/models/densepose_head.py:120-135 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `archive/v1/src/models/densepose_head.py:98` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (16 lines × 2) references/script_4.py:105— references/script_4.py:105-120 | references/script_5.py:250-265 — before extracting anything, compare `references/script_4.py` and `references/script_5.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 2) examples/research-sota/02-placement/r6_2_1_3d_placement.py:190— examples/research-sota/02-placement/r6_2_1_3d_placement.py:190-210 | examples/research-sota/02-placement/r6_2_5_multi_subject.py:178-193 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 3) v2/crates/wifi-densepose-desktop/src/commands/provision.rs:48— v2/crates/wifi-densepose-desktop/src/commands/provision.rs:48-52 | v2/crates/wifi-densepose-desktop/src/commands/provision.rs:130-134 | v2/crates/wifi-densepose-desktop/src/commands/provision.rs:176-180 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) v2/crates/wifi-densepose-mat/src/integration/signal_adapter.rs:216— v2/crates/wifi-densepose-mat/src/integration/signal_adapter.rs:216-221 | v2/crates/wifi-densepose-mat/src/ml/mod.rs:332-338 | v2/crates/wifi-densepose-mat/src/ml/vital_signs_classifier.rs:638-642 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (5 lines × 3) v2/crates/wifi-densepose-physics/src/engine.rs:380— v2/crates/wifi-densepose-physics/src/engine.rs:380-384 | v2/crates/wifi-densepose-physics/src/engine.rs:489-493 | v2/crates/wifi-densepose-physics/src/engine.rs:629-633 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) REDACTED:203— REDACTED:203-207 | REDACTED:226-230 | REDACTED:282-286 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) v2/crates/wifi-densepose-signal/src/phase_sanitizer.rs:316— v2/crates/wifi-densepose-signal/src/phase_sanitizer.rs:316-320 | v2/crates/wifi-densepose-signal/src/phase_sanitizer.rs:352-356 | v2/crates/wifi-densepose-signal/src/phase_sanitizer.rs:387-391 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) v2/crates/wifi-densepose-aether/src/embedding.rs:496— v2/crates/wifi-densepose-aether/src/embedding.rs:496-506 | v2/crates/wifi-densepose-aether/src/embedding.rs:1035-1040 | v2/crates/wifi-densepose-sensing-server/src/trainer.rs:95-99 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (5 lines × 3) REDACTED:74— REDACTED:74-78 | REDACTED:112-116 | REDACTED:151-155 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) scripts/train-count.py:287— scripts/train-count.py:287-291 | scripts/train-count.py:495-499 | scripts/train-count.py:690-695 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (5 lines × 3) examples/research-sota/02-placement/r6_2_1_3d_placement.py:55— examples/research-sota/02-placement/r6_2_1_3d_placement.py:55-59 | examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:52-56 | examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py:49-53 — before extracting anything, compare `examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py` and `examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
AC4 · Keyboard semantics· Modal dialog does not manage focus · ×8
Modal dialog does not manage focus dashboard/src/components/nv-help.ts:422— This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus dashboard/src/components/nv-onboarding.ts:381— This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus dashboard/src/components/nv-settings-drawer.ts:135— This <div role="dialog"> is a modal dialog, but nothing moves focus into it when it opens and nothing keeps focus inside it while it is open, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus ui/utils/data-export.js:53— This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus v2/crates/wifi-densepose-privshield/ui/veil-console.html:536— This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus v2/crates/wifi-densepose-privshield/ui/veil-console.html:542— This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus wifi-veil/ui/veil-console.html:536— This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
Modal dialog does not manage focus wifi-veil/ui/veil-console.html:542— This <div role="dialog"> is a modal dialog, but focus is moved into it, but nothing keeps it there: Tab walks out to the page behind, so a keyboard or screen-reader user keeps acting on the content behind it (WCAG 2.4.3). Use a native <dialog> opened with showModal(), a dialog component that traps focus, or move focus to the dialog on open, trap Tab inside it (or make the page behind inert) and return focus to the control that opened it on close.
AC6 · Visual & motion safety· Focus outline removed in CSS without a · ×8
Focus outline removed in CSS without a :focus replacement ui/style.css:3005— `.cmd-palette-input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement ui/observatory/css/observatory.css:141— `#scenario-quick-select` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement ui/observatory/css/observatory.css:522— `.setting-row input[type="range"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement dashboard/src/components/nv-console.ts:92— `.css-in-js input[type="text"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement dashboard/src/components/nv-ghost-murmur.ts:194— `.css-in-js .control input[type="range"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement dashboard/src/components/nv-palette.ts:45— `.css-in-js input` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement dashboard/src/components/nv-settings-drawer.ts:111— `.css-in-js input[type="text"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Focus outline removed in CSS without a :focus replacement dashboard/src/components/nv-sidebar.ts:97— `.css-in-js input[type="range"]` sets the outline to none/0 and no visible :focus / :focus-visible style for that element replaces it in this stylesheet, so a keyboard user cannot see where focus is. Draw a focus ring (outline, box-shadow or border) under :focus-visible.
Repeated repair: v2/crates/wifi-densepose-sensing-server/src/field_bridge.rs v2/crates/wifi-densepose-sensing-server/src/field_bridge.rs:96— v2/crates/wifi-densepose-sensing-server/src/field_bridge.rs changed 10 times in last 90 days and 8 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is wifi_densepose_sensing_server::field_bridge::perturbation_occupancy_with_diagnostics at line 96), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(sensing-server): show which nodes use the default position (#1804)”; “fix(calibration): register calibrated-presence-evidence schema via field_bridge”; “fix(calibration): separate receipt schema from telemetry literals”; “fix(sensing-server): a silent node no longer moves its neighbours' coordinates”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-sensing-server/src/field_bridge.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: v2/crates/wifi-densepose-signal/src/ruvsense/multistatic.rs v2/crates/wifi-densepose-signal/src/ruvsense/multistatic.rs:147— v2/crates/wifi-densepose-signal/src/ruvsense/multistatic.rs changed 5 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is PhaseFusion::for_frames at line 147), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: review findings and cross-PR integration fixes for aepod release set”; “fix(multistatic): gate phase combining on a declared shared reference”; “fix(signal): the derived soft guard flagged the schedule it was derived from”; “fix(sensing-server): a silent node no longer moves its neighbours' coordinates”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-signal/src/ruvsense/multistatic.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: v2/crates/wifi-densepose-sensing-server/src/multistatic_bridge.rs v2/crates/wifi-densepose-sensing-server/src/multistatic_bridge.rs:126— v2/crates/wifi-densepose-sensing-server/src/multistatic_bridge.rs changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 8 (its worst body is wifi_densepose_sensing_server::multistatic_bridge::node_frames_from_states_with_guard at line 126), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(multistatic): gate phase combining on a declared shared reference”; “fix(sensing): exclude stale nodes from room occupancy (#2060)”; “fix(sensing): fuse only coherent frame cohorts (#1726)”; “fix: align multistatic CSI time and clear Rust advisories (#1669)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-sensing-server/src/multistatic_bridge.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: v2/crates/wifi-densepose-sensing-server/src/cli.rs v2/crates/wifi-densepose-sensing-server/src/cli.rs:14— v2/crates/wifi-densepose-sensing-server/src/cli.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is wifi_densepose_sensing_server::cli::parse_env_bool at line 14), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(sensing-server): apply --privacy-mode to REST, WebSocket and recordings”; “fix(sensing-server): accept 1/0/yes/no/on/off for boolean env flags”; “fix(sensing-server): key node positions by node id, not by list position”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-sensing-server/src/cli.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: v2/crates/homecore-recorder/src/db.rs v2/crates/homecore-recorder/src/db.rs:513— v2/crates/homecore-recorder/src/db.rs changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 11 (its worst body is Recorder::latest_states at line 513), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: align multistatic CSI time and clear Rust advisories (#1669)”; “fix(homecore-api): bound multi-entity history responses”; “fix(homecore): harden runtime and publish truthful capabilities (#1450)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/homecore-recorder/src/db.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: v2/crates/wifi-densepose-engine/src/lib.rs v2/crates/wifi-densepose-engine/src/lib.rs:505— v2/crates/wifi-densepose-engine/src/lib.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 6 (its worst body is StreamingEngine::process_cycle_calibrated at line 505), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(multistatic): gate phase combining on a declared shared reference”; “fix(sensing-server): give the governed fuser the configured node positions”; “fix(engine): wire node positions into StreamingEngine's governed fuser (#1880)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-engine/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.
Repeated repair: v2/crates/wifi-densepose-sensing-server/src/engine_bridge.rs v2/crates/wifi-densepose-sensing-server/src/engine_bridge.rs:189— v2/crates/wifi-densepose-sensing-server/src/engine_bridge.rs changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 3 (its worst body is EngineBridge::process_cycle_from_states at line 189), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(multistatic): gate phase combining on a declared shared reference”; “fix(sensing-server): give the governed fuser the configured node positions”; “fix(sensing): fuse only coherent frame cohorts (#1726)”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- v2/crates/wifi-densepose-sensing-server/src/engine_bridge.rs`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Repeated repair: ui/components/DashboardTab.js ui/components/DashboardTab.js:311— ui/components/DashboardTab.js changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is DashboardTab.updatePoseStats at line 311), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(sensing-server): report measured stream fps and real WebSocket client count”; “fix(ui): stop retrying and ask for the API token when the server requires one”; “fix(ui): never present invented data as measured”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-24..2026-10-22, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-24 11:08:33 -04:00' --until='2026-10-22 11:08:33 -04:00' --full-history --no-merges -- ui/components/DashboardTab.js`: 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.
wifi_densepose_train::subcarrier::interpolate_subcarriers_sparse (cognitive 63) v2/crates/wifi-densepose-train/src/subcarrier.rs:186— wifi_densepose_train::subcarrier::interpolate_subcarriers_sparse has cognitive complexity 63 (threshold 15). Drivers by points: loops 12 (34 pts), if/else 11 (25 pts), match/switch 1 (4 pts) (nesting depth added 39). 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.
wifi_densepose_train::metrics::hungarian_assignment (cognitive 48) v2/crates/wifi-densepose-train/src/metrics.rs:445— wifi_densepose_train::metrics::hungarian_assignment has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 8 (15 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_train::metrics::run_spfa_mcf (cognitive 33) v2/crates/wifi-densepose-train/src/metrics.rs:960— wifi_densepose_train::metrics::run_spfa_mcf has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (8 pts), boolean chains 3 (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.
wifi_densepose_train::ruview_metrics::evaluate_tracking (cognitive 33) v2/crates/wifi-densepose-train/src/ruview_metrics.rs:315— wifi_densepose_train::ruview_metrics::evaluate_tracking has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (22 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_train::ruview_metrics::evaluate_joint_error (cognitive 25) v2/crates/wifi-densepose-train/src/ruview_metrics.rs:149— wifi_densepose_train::ruview_metrics::evaluate_joint_error has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (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.
wifi_densepose_train::bin::verify_training::main (cognitive 19) v2/crates/wifi-densepose-train/src/bin/verify_training.rs:80— wifi_densepose_train::bin::verify_training::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), match/switch 3 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_train::occupancy_bench::evaluate (cognitive 18) v2/crates/wifi-densepose-train/src/occupancy_bench.rs:256— wifi_densepose_train::occupancy_bench::evaluate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (14 pts), match/switch 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
wifi_densepose_train::dataset::widar::parse_widar_path (cognitive 17) v2/crates/wifi-densepose-train/src/dataset/widar.rs:495— wifi_densepose_train::dataset::widar::parse_widar_path has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (13 lines × 2) v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:112— v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:112-124 | v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs:126-138 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs` and `v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) v2/crates/wifi-densepose-privshield/src/experiment.rs:53— v2/crates/wifi-densepose-privshield/src/experiment.rs:53-65 | wifi-veil/src/experiment.rs:53-65 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/experiment.rs` and `wifi-veil/src/experiment.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (13 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:8198— v2/crates/wifi-densepose-sensing-server/src/main.rs:8198-8210 | v2/crates/wifi-densepose-sensing-server/src/main.rs:8452-8464 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:12579— v2/crates/wifi-densepose-sensing-server/src/main.rs:12579-12592 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13124-13136 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) v2/crates/wifi-densepose-signal/src/spectrogram.rs:81— v2/crates/wifi-densepose-signal/src/spectrogram.rs:81-93 | v2/crates/wifi-densepose-signal/src/spectrogram.rs:176-188 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13 lines × 2) archive/v1/src/sensing/rssi_collector.py:139— archive/v1/src/sensing/rssi_collector.py:139-151 | archive/v1/src/sensing/rssi_collector.py:515-527 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) firmware/esp32-csi-node/provision.py:584— firmware/esp32-csi-node/provision.py:584-596 | scripts/generate_nvs_matrix.py:283-295 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) scripts/mmwave_fusion_bridge.py:154— scripts/mmwave_fusion_bridge.py:154-166 | scripts/mmwave_fusion_bridge.py:170-182 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
TooManyMethods: LiveDemoTab ui/components/LiveDemoTab.js:13— TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PoseDetectionCanvas ui/components/PoseDetectionCanvas.js:7— TooManyMethods — 51 methods. The bar is 30 methods; this is 21 over it, 1.70× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PoseService ui/services/pose.service.js:7— TooManyMethods — 42 methods. The bar is 30 methods; 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.
TooManyMethods: HardwareAdapter v2/crates/wifi-densepose-mat/src/integration/hardware_adapter.rs:462— TooManyMethods — 41 methods. The bar is 30 methods; this is 11 over it, 1.37× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PoseService archive/v1/src/services/pose_service.py:27— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: PoseRenderer ui/utils/pose-renderer.js:3— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: MatDashboard v2/crates/wifi-densepose-wasm/src/mat.rs:479— TooManyMethods — 31 methods. The bar is 30 methods; this is 1 over it, 1.03× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (15 lines × 2) REDACTED:352— REDACTED:352-366 | REDACTED:415-429 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) v2/crates/wifi-densepose-privshield/src/compliance.rs:39— v2/crates/wifi-densepose-privshield/src/compliance.rs:39-53 | wifi-veil/src/compliance.rs:39-53 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (15 lines × 2) v2/crates/wifi-densepose-privshield/src/experiment.rs:214— v2/crates/wifi-densepose-privshield/src/experiment.rs:214-228 | wifi-veil/src/experiment.rs:214-228 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/experiment.rs` and `wifi-veil/src/experiment.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:1541— v2/crates/wifi-densepose-sensing-server/src/main.rs:1541-1555 | v2/crates/wifi-densepose-sensing-server/src/types.rs:345-359 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/types.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:12617— v2/crates/wifi-densepose-sensing-server/src/main.rs:12617-12631 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13136-13151 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:564— v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:564-578 | v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1508-1522 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) scripts/qemu_swarm.py:685— scripts/qemu_swarm.py:685-699 | scripts/qemu_swarm.py:709-723 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 3) v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:112— v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:112-118 | v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs:126-132 | v2/crates/wifi-densepose-hardware/src/bin/rtl8720f-sim.rs:86-92 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs` and `v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:119— v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:119-125 | v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs:133-139 | v2/crates/wifi-densepose-hardware/src/bin/realtek-csi-sim.rs:96-102 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs` and `v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) v2/crates/wifi-densepose-ruvector/src/coverage.rs:275— v2/crates/wifi-densepose-ruvector/src/coverage.rs:275-281 | v2/crates/wifi-densepose-ruvector/src/coverage.rs:348-354 | v2/crates/wifi-densepose-ruvector/src/coverage.rs:404-410 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) v2/crates/wifi-densepose-sensing-server/src/rvf_container.rs:531— v2/crates/wifi-densepose-sensing-server/src/rvf_container.rs:531-537 | v2/crates/wifi-densepose-sensing-server/src/rvf_container.rs:577-583 | v2/crates/wifi-densepose-sensing-server/src/rvf_container.rs:601-607 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (7 lines × 3) v2/crates/cog-person-count/src/inference.rs:308— v2/crates/cog-person-count/src/inference.rs:308-314 | v2/crates/cog-pose-estimation/src/inference.rs:426-432 | v2/crates/wifi-densepose-occworld-candle/src/inference.rs:407-413 — before extracting anything, compare `v2/crates/cog-person-count/src/inference.rs` and `v2/crates/cog-pose-estimation/src/inference.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 3) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:144— v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:144-150 | v2/crates/wifi-densepose-vitals/src/anomaly.rs:49-55 | v2/crates/wifi-densepose-wifiscan/src/domain/registry.rs:45-51 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (7 lines × 3) examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:43— examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:43-49 | examples/research-sota/05-cross-room-reid/r3_2_embedding_physics_env.py:38-44 | examples/research-sota/06-structure-detection/r12_1_pose_pabs_loop.py:39-45 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
AC4 · Keyboard semantics· Link used as a button (placeholder href) · ×6
Link used as a button (placeholder href) v2/crates/wifi-densepose-privshield/ui/veil-console.html:527— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Link used as a button (placeholder href) v2/crates/wifi-densepose-privshield/ui/veil-console.html:528— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Link used as a button (placeholder href) v2/crates/wifi-densepose-privshield/ui/veil-console.html:529— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Link used as a button (placeholder href) wifi-veil/ui/veil-console.html:527— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Link used as a button (placeholder href) wifi-veil/ui/veil-console.html:528— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
Link used as a button (placeholder href) wifi-veil/ui/veil-console.html:529— An <a href="#"> (or javascript:) with a click handler is a button dressed as a link — it announces the wrong role and stops working without JS. Use a <button> for an action.
wifi_densepose_cli::calibrate_api::ingest_loop (cognitive 120) v2/crates/wifi-densepose-cli/src/calibrate_api.rs:388— wifi_densepose_cli::calibrate_api::ingest_loop has cognitive complexity 120 (threshold 15). Drivers by points: if/else 24 (96 pts), match/switch 5 (18 pts), loops 2 (5 pts), boolean chains 1 (nesting depth added 88). 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.
wifi_densepose_cli::room::room_watch_multi (cognitive 25) v2/crates/wifi-densepose-cli/src/room.rs:406— wifi_densepose_cli::room::room_watch_multi has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (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.
wifi_densepose_cli::calibrate::execute (cognitive 24) v2/crates/wifi-densepose-cli/src/calibrate.rs:108— wifi_densepose_cli::calibrate::execute has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), match/switch 2 (4 pts), boolean chains 2, 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.
wifi_densepose_cli::room::enroll (cognitive 18) v2/crates/wifi-densepose-cli/src/room.rs:141— wifi_densepose_cli::room::enroll has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_cli::room::room_watch (cognitive 17) v2/crates/wifi-densepose-cli/src/room.rs:349— wifi_densepose_cli::room::room_watch has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_cli::mat::execute_zones (cognitive 16) v2/crates/wifi-densepose-cli/src/mat.rs:695— wifi_densepose_cli::mat::execute_zones has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 2 (3 pts) (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.
Duplicated block (20 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:249— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:249-268 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:237-256 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:580— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:580-599 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:570-589 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20 lines × 2) v2/crates/wifi-densepose-mat/src/domain/scan_zone.rs:127— v2/crates/wifi-densepose-mat/src/domain/scan_zone.rs:127-146 | v2/crates/wifi-densepose-wasm/src/mat.rs:361-380 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (20 lines × 2) v2/crates/wifi-densepose-mat/src/ml/debris_model.rs:416— v2/crates/wifi-densepose-mat/src/ml/debris_model.rs:416-435 | v2/crates/wifi-densepose-mat/src/ml/vital_signs_classifier.rs:424-443 — before extracting anything, compare `v2/crates/wifi-densepose-mat/src/ml/debris_model.rs` and `v2/crates/wifi-densepose-mat/src/ml/vital_signs_classifier.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 38 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7586— v2/crates/wifi-densepose-sensing-server/src/main.rs:7586-7605 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:253-272 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/exo_dream_stage.rs:374— v2/crates/wifi-densepose-wasm-edge/src/exo_dream_stage.rs:374-393 | v2/crates/wifi-densepose-wasm-edge/src/exo_emotion_detect.rs:342-361 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (18 lines × 2) v2/crates/homecore-api/src/rest.rs:133— v2/crates/homecore-api/src/rest.rs:133-150 | v2/crates/homecore-api/src/rest.rs:269-286 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:366— v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:366-383 | v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:445-462 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:12552— v2/crates/wifi-densepose-sensing-server/src/main.rs:12552-12569 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13082-13099 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:15075— v2/crates/wifi-densepose-sensing-server/src/main.rs:15075-15092 | v2/crates/wifi-densepose-sensing-server/src/main.rs:15269-15293 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs:55— v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs:55-72 | v2/crates/wifi-densepose-sensing-server/src/qualcomm_csi.rs:45-62 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 45 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18 lines × 2) scripts/swarm_health.py:155— scripts/swarm_health.py:155-172 | scripts/swarm_health.py:405-422 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
homecore_hap::server::serve_connection (cognitive 39) v2/crates/homecore-hap/src/server.rs:259— homecore_hap::server::serve_connection has cognitive complexity 39 (threshold 15). Drivers by points: if/else 8 (28 pts), match/switch 3 (8 pts), boolean chains 2, 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.
homecore_hap::server::read_request (cognitive 31) v2/crates/homecore-hap/src/server.rs:370— homecore_hap::server::read_request has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 3, boolean chains 2, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
homecore_hap::server::pairings_response (cognitive 31) v2/crates/homecore-hap/src/server.rs:690— homecore_hap::server::pairings_response has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (24 pts), match/switch 3 (5 pts), loops 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
homecore_hap::server::dispatch_request (cognitive 29) v2/crates/homecore-hap/src/server.rs:589— homecore_hap::server::dispatch_request has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 3 (5 pts), boolean chains 2 (nesting depth added 16). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
homecore_hap::server::run_listener (cognitive 19) v2/crates/homecore-hap/src/server.rs:174— homecore_hap::server::run_listener has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (7 pts), match/switch 3 (6 pts), if/else 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.
wifi_densepose_signal::ruvsense::tomography::compute_link_weights (cognitive 35) v2/crates/wifi-densepose-signal/src/ruvsense/tomography.rs:356— wifi_densepose_signal::ruvsense::tomography::compute_link_weights has cognitive complexity 35 (threshold 15). Drivers by points: if/else 5 (22 pts), loops 4 (10 pts), boolean chains 3 (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.
wifi_densepose_signal::ruvsense::field_model::significant_eigenvalue_count (cognitive 28) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:538— wifi_densepose_signal::ruvsense::field_model::significant_eigenvalue_count has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 6 (13 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.
wifi_densepose_signal::bvp::extract_bvp (cognitive 18) v2/crates/wifi-densepose-signal/src/bvp.rs:70— wifi_densepose_signal::bvp::extract_bvp has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 6 (7 pts), boolean chains 1 (nesting depth added 6). 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.
wifi_densepose_signal::subcarrier_selection::mincut_subcarrier_partition (cognitive 18) v2/crates/wifi-densepose-signal/src/subcarrier_selection.rs:186— wifi_densepose_signal::subcarrier_selection::mincut_subcarrier_partition has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (15 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_signal::ruvsense::gesture::dtw_distance (cognitive 16) v2/crates/wifi-densepose-signal/src/ruvsense/gesture.rs:301— wifi_densepose_signal::ruvsense::gesture::dtw_distance has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TooManyFields: AppStateInner v2/crates/wifi-densepose-sensing-server/src/main.rs:1990— TooManyFields — 100 stored fields beside 21 methods. The bar is 30 stored fields; this is 70 over it, 3.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: Args v2/crates/wifi-densepose-sensing-server/src/cli.rs:108— TooManyFields — 53 stored fields. The bar is 30 stored fields; this is 23 over it, 1.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: AppStateInner v2/crates/wifi-densepose-sensing-server/src/types.rs:480— TooManyFields — 47 stored fields beside 2 methods. The bar is 30 stored fields; this is 17 over it, 1.57× the bar. This is width in DATA, not behaviour: every reader that takes the whole type couples to all of its fields, so a change to any one of them is a change every reader has to be checked against. To reduce it, group the fields that are read together by the same callers into a smaller type of their own, and have this one hold that type as a single member — each reader then names only the group it uses.
TooManyFields: Args v2/crates/wifi-densepose-sensing-server/src/main.rs:104— TooManyFields — 43 stored fields. The bar is 30 stored fields; this is 13 over it, 1.43× 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: NodeState v2/crates/wifi-densepose-sensing-server/src/main.rs:1131— TooManyFields — 40 stored fields beside 19 methods. The bar is 30 stored fields; this is 10 over it, 1.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.
Duplicated block (31 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:362— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:362-392 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:350-380 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (31 lines × 2) v2/crates/wifi-densepose-sensing-server/src/bearer_auth.rs:658— v2/crates/wifi-densepose-sensing-server/src/bearer_auth.rs:658-688 | v2/crates/wifi-densepose-sensing-server/src/bearer_auth.rs:716-746 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (31 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:239— v2/crates/wifi-densepose-sensing-server/src/csi.rs:239-269 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3492-3522 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (31 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:5034— v2/crates/wifi-densepose-sensing-server/src/main.rs:5034-5064 | v2/crates/wifi-densepose-sensing-server/src/main.rs:5204-5234 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (31 lines × 2) archive/v1/src/commands/start.py:329— archive/v1/src/commands/start.py:329-359 | archive/v1/src/commands/stop.py:133-163 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (13–14 lines × 2) v2/crates/homecore-hap/src/server.rs:617— v2/crates/homecore-hap/src/server.rs:617-630 | v2/crates/homecore-hap/src/server.rs:652-664 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13–14 lines × 2) v2/crates/wifi-densepose-nn/src/densepose.rs:388— v2/crates/wifi-densepose-nn/src/densepose.rs:388-400 | v2/crates/wifi-densepose-nn/src/translator.rs:529-542 — before extracting anything, compare `v2/crates/wifi-densepose-nn/src/densepose.rs` and `v2/crates/wifi-densepose-nn/src/translator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13–14 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:13951— v2/crates/wifi-densepose-sensing-server/src/main.rs:13951-13964 | v2/crates/wifi-densepose-sensing-server/src/main.rs:14270-14282 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (13–14 lines × 2) v2/crates/wifi-densepose-vitals/src/breathing.rs:201— v2/crates/wifi-densepose-vitals/src/breathing.rs:201-213 | v2/crates/wifi-densepose-vitals/src/heartrate.rs:211-224 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (13–14 lines × 2) scripts/train-count.py:499— scripts/train-count.py:499-511 | scripts/train-count.py:695-708 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `scripts/train-count.py:517` calls `Path`, `write_text` and `scripts/train-count.py:709` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Outbound HTTP without resilience v2/crates/cog-person-count/src/runtime.rs:61— `ureq::get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience v2/crates/cog-pose-estimation/src/runtime.rs:84— `ureq::get(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience v2/crates/ruview-auth/src/login/flow.rs:66— `reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience v2/crates/wifi-densepose-cli/src/auth.rs:124— `reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Outbound HTTP without resilience v2/crates/wifi-densepose-cli/src/spaces.rs:78— `reqwest::Client::new(` makes an outbound HTTP call, and nothing bounds it: no timeout, deadline, retry or circuit breaker is set for it here, and the client has no process-wide default. A slow or failing dependency will hold this service's request, thread or connection until the call gives up on its own — or never, for a client with no default timeout.
Blocking `thread::sleep` inside an `async` body REDACTED:141— This `async` body is polled on an executor's worker thread, and `std::thread::sleep` blocks that thread: for the whole delay no other task scheduled on it makes progress — the Rust form of blocking on a task. Use `tokio::time::sleep(…).await` (or the runtime's own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with `tokio::task::spawn_blocking(…).await`.
Blocking `thread::sleep` inside an `async` body REDACTED:225— This `async` body is polled on an executor's worker thread, and `std::thread::sleep` blocks that thread: for the whole delay no other task scheduled on it makes progress — the Rust form of blocking on a task. Use `tokio::time::sleep(…).await` (or the runtime's own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with `tokio::task::spawn_blocking(…).await`.
Blocking `thread::sleep` inside an `async` body v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:491— This `async` body is polled on an executor's worker thread, and `std::thread::sleep` blocks that thread: for the whole delay no other task scheduled on it makes progress — the Rust form of blocking on a task. Use `tokio::time::sleep(…).await` (or the runtime's own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with `tokio::task::spawn_blocking(…).await`.
Blocking `thread::sleep` inside an `async` body v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:516— This `async` body is polled on an executor's worker thread, and `std::thread::sleep` blocks that thread: for the whole delay no other task scheduled on it makes progress — the Rust form of blocking on a task. Use `tokio::time::sleep(…).await` (or the runtime's own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with `tokio::task::spawn_blocking(…).await`.
Blocking `thread::sleep` inside an `async` body v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:540— This `async` body is polled on an executor's worker thread, and `std::thread::sleep` blocks that thread: for the whole delay no other task scheduled on it makes progress — the Rust form of blocking on a task. Use `tokio::time::sleep(…).await` (or the runtime's own timer), which suspends only this task. Where the blocking work is not a sleep but a synchronous call that cannot be made async, move it off the executor with `tokio::task::spawn_blocking(…).await`.
FieldModel::finalize_calibration (cyclomatic 29) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1045— FieldModel::finalize_calibration 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.
FieldModel::estimate_occupancy (cyclomatic 19) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1463— FieldModel::estimate_occupancy 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.
FieldModel::from_snapshot (cyclomatic 17) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:819— FieldModel::from_snapshot has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
FieldModel::feed_calibration (cyclomatic 16) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:959— FieldModel::feed_calibration 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.
homecore_hap::server::pairings_response (cyclomatic 22) v2/crates/homecore-hap/src/server.rs:690— homecore_hap::server::pairings_response 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.
homecore_hap::server::read_request (cyclomatic 21) v2/crates/homecore-hap/src/server.rs:370— homecore_hap::server::read_request has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
homecore_hap::server::serve_connection (cyclomatic 20) v2/crates/homecore-hap/src/server.rs:259— homecore_hap::server::serve_connection 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.
homecore_hap::server::dispatch_request (cyclomatic 20) v2/crates/homecore-hap/src/server.rs:589— homecore_hap::server::dispatch_request 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.
FieldModel::finalize_calibration (cognitive 69) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1045— FieldModel::finalize_calibration has cognitive complexity 69 (threshold 15). Drivers by points: loops 12 (38 pts), if/else 18 (25 pts), boolean chains 3, match/switch 1 (3 pts) (nesting depth added 35). 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.
FieldModel::estimate_occupancy (cognitive 35) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:1463— FieldModel::estimate_occupancy has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 6 (13 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FieldModel::feed_calibration (cognitive 28) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:959— FieldModel::feed_calibration has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 7 (14 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.
FieldModel::from_snapshot (cognitive 17) v2/crates/wifi-densepose-signal/src/ruvsense/field_model.rs:819— FieldModel::from_snapshot has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
GaussianMap::insert (cognitive 58) v2/crates/ruview-unified/src/gaussian/map.rs:83— GaussianMap::insert has cognitive complexity 58 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 10 (23 pts), match/switch 1 (5 pts), boolean chains 1 (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.
GaussianMap::merge_overlapping (cognitive 50) v2/crates/ruview-unified/src/gaussian/map.rs:212— GaussianMap::merge_overlapping has cognitive complexity 50 (threshold 15). Drivers by points: if/else 11 (28 pts), loops 6 (15 pts), boolean chains 4, match/switch 1 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GaussianMap::query_near_segment (cognitive 23) v2/crates/ruview-unified/src/gaussian/map.rs:364— GaussianMap::query_near_segment has cognitive complexity 23 (threshold 15). Drivers by points: if/else 3 (13 pts), loops 4 (10 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GaussianMap::query_radius (cognitive 19) v2/crates/ruview-unified/src/gaussian/map.rs:307— GaussianMap::query_radius has cognitive complexity 19 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 2 (9 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
wifi_densepose_pointcloud::stream::serve (cognitive 29) v2/crates/wifi-densepose-pointcloud/src/stream.rs:33— wifi_densepose_pointcloud::stream::serve has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 4, loops 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_pointcloud::train (cognitive 23) REDACTED:192— wifi_densepose_pointcloud::train has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (4 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.
wifi_densepose_pointcloud::camera::list_cameras (cognitive 17) v2/crates/wifi-densepose-pointcloud/src/camera.rs:224— wifi_densepose_pointcloud::camera::list_cameras 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.
wifi_densepose_pointcloud::depth::backproject_depth (cognitive 16) v2/crates/wifi-densepose-pointcloud/src/depth.rs:34— wifi_densepose_pointcloud::depth::backproject_depth has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_wasm_edge::gesture::dtw_distance (cognitive 26) v2/crates/wifi-densepose-wasm-edge/src/gesture.rs:188— wifi_densepose_wasm_edge::gesture::dtw_distance has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 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.
wifi_densepose_wasm_edge::lrn_dtw_gesture_learn::dtw_distance (cognitive 26) v2/crates/wifi-densepose-wasm-edge/src/lrn_dtw_gesture_learn.rs:377— wifi_densepose_wasm_edge::lrn_dtw_gesture_learn::dtw_distance has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 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.
wifi_densepose_wasm_edge::vendor_common::dtw_distance_banded (cognitive 26) v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:341— wifi_densepose_wasm_edge::vendor_common::dtw_distance_banded has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 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.
wifi_densepose_wasm_edge::vendor_common::dtw_distance (cognitive 19) v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:302— wifi_densepose_wasm_edge::vendor_common::dtw_distance has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_desktop::commands::provision::serialize_nvs_config (cognitive 22) v2/crates/wifi-densepose-desktop/src/commands/provision.rs:260— wifi_densepose_desktop::commands::provision::serialize_nvs_config has cognitive complexity 22 (threshold 15). Drivers by points: if/else 21 (22 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
wifi_densepose_desktop::commands::ota::batch_ota_update (cognitive 21) v2/crates/wifi-densepose-desktop/src/commands/ota.rs:203— wifi_densepose_desktop::commands::ota::batch_ota_update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), match/switch 3 (7 pts), loops 2 (4 pts) (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
wifi_densepose_desktop::commands::server::find_server_binary (cognitive 20) v2/crates/wifi-densepose-desktop/src/commands/server.rs:50— wifi_densepose_desktop::commands::server::find_server_binary has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (20 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.
wifi_densepose_desktop::commands::discovery::discover_via_udp (cognitive 16) v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:178— wifi_densepose_desktop::commands::discovery::discover_via_udp has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), match/switch 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CsiPipelineState::heuristic_pose_from_amplitude (cognitive 22) REDACTED:274— CsiPipelineState::heuristic_pose_from_amplitude has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 3 (11 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CsiPipelineState::update_tomography (cognitive 22) REDACTED:449— CsiPipelineState::update_tomography has cognitive complexity 22 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 2 (3 pts), match/switch 1 (3 pts) (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CsiPipelineState::identify_location (cognitive 19) REDACTED:395— CsiPipelineState::identify_location has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 6 (8 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CsiPipelineState::record_fingerprint (cognitive 16) REDACTED:331— CsiPipelineState::record_fingerprint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5 (7 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.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×4
Members sharing a duplicated core (5 members, 50+ identical tokens) v2/crates/wifi-densepose-train/src/accuracy.rs:200— v2/crates/wifi-densepose-train/src/accuracy.rs:200-230 | v2/crates/wifi-densepose-train/src/metrics.rs:869-892 | v2/crates/wifi-densepose-train/src/metrics_core.rs:190-220 | v2/crates/wifi-densepose-train/src/metrics_core.rs:238-273 | v2/crates/wifi-densepose-train/src/ruview_metrics.rs:659-687 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) v2/crates/wifi-densepose-wasm-edge/src/exo_breathing_sync.rs:206— v2/crates/wifi-densepose-wasm-edge/src/exo_breathing_sync.rs:206-356 | v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:208-362 | v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs:179-338 | v2/crates/wifi-densepose-wasm-edge/src/exo_rain_detect.rs:164-283 | v2/crates/wifi-densepose-wasm-edge/src/sig_flash_attention.rs:52-126 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:314— v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:314-355 | v2/crates/wifi-densepose-wasm-edge/src/gesture.rs:188-235 | v2/crates/wifi-densepose-wasm-edge/src/lrn_dtw_gesture_learn.rs:377-419 | v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:302-335 | v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:341-378 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Members sharing a duplicated core (5 members, 50+ identical tokens) examples/research-sota/03-spatial-intelligence/r5_subcarrier_saliency.py:39— examples/research-sota/03-spatial-intelligence/r5_subcarrier_saliency.py:39-63 | examples/research-sota/04-rssi/r8_rssi_only_count.py:39-52 | examples/research-sota/04-rssi/r9_rssi_fingerprint_knn.py:42-56 | examples/research-sota/06-structure-detection/r12_rf_weather_eigenshift.py:50-63 | scripts/train-count.py:69-84 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
Duplicated block (12–13 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1159— v2/crates/wifi-densepose-sensing-server/src/csi.rs:1159-1170 | v2/crates/wifi-densepose-sensing-server/src/main.rs:5778-5790 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12–13 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs:307— v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs:307-318 | v2/crates/wifi-densepose-wasm-edge/src/exo_time_crystal.rs:242-254 — before extracting anything, compare `v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs` and `v2/crates/wifi-densepose-wasm-edge/src/exo_time_crystal.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12–13 lines × 2) scripts/validate_qemu_output.py:139— scripts/validate_qemu_output.py:139-151 | scripts/validate_qemu_output.py:189-200 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/validate_qemu_output.py:189` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12–13 lines × 2) examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:103— examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:103-115 | examples/research-sota/05-cross-room-reid/r3_2_embedding_physics_env.py:107-118 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 3) v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:166— v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:166-176 | v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:192-202 | v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:219-229 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1135— v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1135-1145 | v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1177-1187 | v2/crates/wifi-densepose-sensing-server/src/training_api.rs:1203-1213 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11 lines × 3) archive/v1/src/core/csi_processor.py:334— archive/v1/src/core/csi_processor.py:334-344 | archive/v1/src/core/csi_processor.py:352-362 | archive/v1/src/core/csi_processor.py:369-379 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: `CSIData` names `..hardware.csi_extractor` in one and `src.hardware.csi_extractor` in another — different types that share a simple name, which is why the text matched. A single extracted unit cannot be given a parameter type that fits both, so unifying those types (or introducing a shared abstraction over them) is the step that has to come BEFORE the extraction above; if they are deliberately separate, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (11 lines × 3) archive/v1/src/tasks/backup.py:161— archive/v1/src/tasks/backup.py:161-171 | archive/v1/src/tasks/backup.py:255-265 | archive/v1/src/tasks/backup.py:407-417 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `archive/v1/src/tasks/backup.py:161` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `archive/v1/src/tasks/backup.py:420` calls `list`, `glob` and `archive/v1/src/tasks/backup.py:174` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8–9 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:297— v2/crates/wifi-densepose-sensing-server/src/csi.rs:297-304 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3742-3750 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8–9 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:2767— v2/crates/wifi-densepose-sensing-server/src/main.rs:2767-2775 | v2/crates/wifi-densepose-sensing-server/src/types.rs:554-561 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/types.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8–9 lines × 2) examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:131— examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:131-139 | examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py:121-128 — before extracting anything, compare `examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py` and `examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8–9 lines × 2) examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py:77— examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py:77-85 | examples/research-sota/02-placement/r6_2_5_multi_subject.py:73-80 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 3) v2/crates/homecore-plugins/src/wasmtime_runtime.rs:431— v2/crates/homecore-plugins/src/wasmtime_runtime.rs:431-438 | v2/crates/homecore-plugins/src/wasmtime_runtime.rs:449-456 | v2/crates/homecore-plugins/src/wasmtime_runtime.rs:464-471 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (8 lines × 3) v2/crates/wifi-densepose-sensing-server/src/csi.rs:764— v2/crates/wifi-densepose-sensing-server/src/csi.rs:764-774 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4645-4655 | v2/crates/wifi-densepose-sensing-server/src/main.rs:12965-12972 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8 lines × 3) v2/crates/ruview-unified/src/math.rs:32— v2/crates/ruview-unified/src/math.rs:32-39 | v2/crates/wifi-densepose-aether/src/graph_transformer.rs:47-54 | v2/crates/wifi-densepose-train/src/model_gates.rs:304-311 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (8 lines × 3) v2/crates/wifi-densepose-mat/src/integration/feitcsi.rs:214— v2/crates/wifi-densepose-mat/src/integration/feitcsi.rs:214-221 | v2/crates/wifi-densepose-mtk-bridge/src/record.rs:44-51 | v2/crates/wifi-densepose-mtk-bridge/src/record.rs:53-60 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Dead file (~7 LoC) harness/wifi-densepose-sar/src/agents/architect.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~7 LoC) harness/wifi-densepose-sar/src/agents/implementer.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~7 LoC) harness/wifi-densepose-sar/src/agents/reviewer.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~7 LoC) harness/wifi-densepose-sar/src/agents/test-writer.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
AC3 · Page structure· Heading level jumps from h1 to h3 · ×3
Heading level jumps from h1 to h3 dashboard/src/components/nv-home.ts:229— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:604— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h1 to h3 v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:552— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
wifi_densepose_desktop::commands::provision::deserialize_nvs_config (cyclomatic 25) v2/crates/wifi-densepose-desktop/src/commands/provision.rs:357— wifi_densepose_desktop::commands::provision::deserialize_nvs_config 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.
wifi_densepose_desktop::commands::provision::serialize_nvs_config (cyclomatic 21) v2/crates/wifi-densepose-desktop/src/commands/provision.rs:260— wifi_densepose_desktop::commands::provision::serialize_nvs_config has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
wifi_densepose_desktop::commands::discovery::discover_via_mdns (cyclomatic 16) v2/crates/wifi-densepose-desktop/src/commands/discovery.rs:73— wifi_densepose_desktop::commands::discovery::discover_via_mdns 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.
wifi_densepose_train::subcarrier::interpolate_subcarriers_sparse (cyclomatic 22) v2/crates/wifi-densepose-train/src/subcarrier.rs:186— wifi_densepose_train::subcarrier::interpolate_subcarriers_sparse has cyclomatic complexity 22 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
wifi_densepose_train::metrics::hungarian_assignment (cyclomatic 20) v2/crates/wifi-densepose-train/src/metrics.rs:445— wifi_densepose_train::metrics::hungarian_assignment 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.
wifi_densepose_train::ruview_metrics::evaluate_tracking (cyclomatic 18) v2/crates/wifi-densepose-train/src/ruview_metrics.rs:315— wifi_densepose_train::ruview_metrics::evaluate_tracking 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.
D10 · Test Quality· Fixed-sleep synchronisation · ×3
Fixed-sleep synchronisation: ESP32 capture receives a live UDP stream on loopback and measures loss harness/ruview/test/devices.test.mjs:67— This test starts work it did not wait for (`pending`, still running when the sleep starts) and then orders itself against it with `new Promise((r) => setTimeout(r, 150))` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Fixed-sleep synchronisation: public SDK accepts spectrum options and returns real UDP amplitude rows harness/ruview/test/sdk-device-options.test.mjs:46— This test starts work it did not wait for (`pending`, still running when the sleep starts) and then orders itself against it with `pause(100)` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
Fixed-sleep synchronisation: ESP32 node UDP stream: per-node rate, zero loss, vitals decoded harness/ruview/test/e2e/devices.e2e.mjs:84— This test starts work it did not wait for (`pending`, still running when the sleep starts) and then orders itself against it with `new Promise((r) => setTimeout(r, 700))` — a fixed wait, not a signal that the work is done. Whether it passes depends on how loaded the machine is, which is why a test written this way is green on a developer's box and random in CI. Wait for the event itself instead: the process's own exit or output, a completion handle, or a condition polled to a timeout.
ruview_unified::synth::raytrace::enumerate_paths (cognitive 81) v2/crates/ruview-unified/src/synth/raytrace.rs:39— ruview_unified::synth::raytrace::enumerate_paths has cognitive complexity 81 (threshold 15). Drivers by points: if/else 14 (57 pts), loops 7 (22 pts), boolean chains 2 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ruview_unified::adapters::normalize_grid (cognitive 49) v2/crates/ruview-unified/src/adapters.rs:258— ruview_unified::adapters::normalize_grid has cognitive complexity 49 (threshold 15). Drivers by points: loops 13 (42 pts), if/else 5 (6 pts), boolean chains 1 (nesting depth added 30). 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.
ruview_unified::eval::expected_calibration_error (cognitive 19) v2/crates/ruview-unified/src/eval.rs:187— ruview_unified::eval::expected_calibration_error has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ModalityTranslator::apply_attention (cognitive 55) v2/crates/wifi-densepose-nn/src/translator.rs:572— ModalityTranslator::apply_attention has cognitive complexity 55 (threshold 15). Drivers by points: loops 16 (49 pts), if/else 3 (6 pts) (nesting depth added 36). 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.
ModalityTranslator::apply_conv_block (cognitive 42) v2/crates/wifi-densepose-nn/src/translator.rs:425— ModalityTranslator::apply_conv_block has cognitive complexity 42 (threshold 15). Drivers by points: loops 7 (28 pts), if/else 2 (13 pts), boolean chains 1 (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.
ModalityTranslator::apply_deconv_block (cognitive 20) v2/crates/wifi-densepose-nn/src/translator.rs:482— ModalityTranslator::apply_deconv_block has cognitive complexity 20 (threshold 15). Drivers by points: loops 5 (15 pts), if/else 1 (5 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.
MicroHnsw::search (cognitive 35) v2/crates/wifi-densepose-wasm-edge/src/spt_micro_hnsw.rs:153— MicroHnsw::search has cognitive complexity 35 (threshold 15). Drivers by points: loops 5 (18 pts), if/else 5 (16 pts), boolean chains 1 (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.
MicroHnsw::add_edge (cognitive 18) v2/crates/wifi-densepose-wasm-edge/src/spt_micro_hnsw.rs:125— MicroHnsw::add_edge 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.
MicroHnsw::insert (cognitive 16) v2/crates/wifi-densepose-wasm-edge/src/spt_micro_hnsw.rs:80— MicroHnsw::insert has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (7 pts) (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.
homecore_server::register_builtin_services (cognitive 28) v2/crates/homecore-server/src/main.rs:485— homecore_server::register_builtin_services has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (18 pts), loops 3 (6 pts), match/switch 1 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
homecore_server::main (cognitive 19) v2/crates/homecore-server/src/main.rs:183— homecore_server::main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13, loops 2 (3 pts), match/switch 1 (2 pts), boolean chains 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
homecore_server::hap::start (cognitive 16) v2/crates/homecore-server/src/hap.rs:45— homecore_server::hap::start has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 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.
GestureLanguageDetector::dtw_multivariate (cognitive 26) v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:314— GestureLanguageDetector::dtw_multivariate has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 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.
GestureLanguageDetector::process_frame (cognitive 19) v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:208— GestureLanguageDetector::process_frame has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 4 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GestureLanguageDetector::match_gesture (cognitive 18) v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:275— GestureLanguageDetector::match_gesture has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ruview_groundtruth::autolabel::auto_label (cognitive 17) v2/crates/ruview-groundtruth/src/autolabel.rs:240— ruview_groundtruth::autolabel::auto_label has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 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.
ruview_groundtruth::series::validate_samples (cognitive 17) v2/crates/ruview-groundtruth/src/series.rs:52— ruview_groundtruth::series::validate_samples has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ruview_groundtruth::align::resample (cognitive 16) v2/crates/ruview-groundtruth/src/align.rs:115— ruview_groundtruth::align::resample has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), match/switch 2 (6 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Duplicated block (20–21 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7265— v2/crates/wifi-densepose-sensing-server/src/main.rs:7265-7285 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:182-201 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (20–21 lines × 2) archive/v1/src/tasks/backup.py:162— archive/v1/src/tasks/backup.py:162-181 | archive/v1/src/tasks/backup.py:256-276 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `archive/v1/src/tasks/backup.py:162` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (20–21 lines × 2) examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:110— examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:110-129 | examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py:99-119 — before extracting anything, compare `examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py` and `examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) v2/crates/wifi-densepose-privshield/src/experiment.rs:180— v2/crates/wifi-densepose-privshield/src/experiment.rs:180-198 | wifi-veil/src/experiment.rs:180-198 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/experiment.rs` and `wifi-veil/src/experiment.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (19 lines × 2) archive/v1/src/core/csi_processor.py:96— archive/v1/src/core/csi_processor.py:96-114 | archive/v1/src/hardware/csi_extractor.py:461-479 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (19 lines × 2) references/script_4.py:79— references/script_4.py:79-97 | references/script_5.py:85-103 — before extracting anything, compare `references/script_4.py` and `references/script_5.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (12–14 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:10231— v2/crates/wifi-densepose-sensing-server/src/main.rs:10231-10244 | v2/crates/wifi-densepose-sensing-server/src/main.rs:10310-10321 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–14 lines × 2) scripts/check_health.py:231— scripts/check_health.py:231-244 | scripts/swarm_health.py:539-550 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12–14 lines × 2) scripts/generate_nvs_matrix.py:314— scripts/generate_nvs_matrix.py:314-327 | scripts/provision.py:102-113 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (13 lines × 3) v2/crates/wifi-densepose-sensing-server/src/main.rs:5042— v2/crates/wifi-densepose-sensing-server/src/main.rs:5042-5054 | v2/crates/wifi-densepose-sensing-server/src/main.rs:5212-5224 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13364-13376 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (13 lines × 3) v2/crates/wifi-densepose-signal/src/features.rs:175— v2/crates/wifi-densepose-signal/src/features.rs:175-187 | v2/crates/wifi-densepose-signal/src/ruvsense/multiband.rs:250-262 | v2/crates/wifi-densepose-wifiscan/src/pipeline/correlator.rs:189-201 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (13 lines × 3) archive/v1/src/tasks/backup.py:447— archive/v1/src/tasks/backup.py:447-459 | archive/v1/src/tasks/cleanup.py:449-463 | archive/v1/src/tasks/monitoring.py:639-651 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 4) v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:37— v2/crates/wifi-densepose-ruvector/src/ann_measure.rs:37-42 | v2/crates/wifi-densepose-ruvector/src/coverage.rs:42-47 | v2/crates/wifi-densepose-ruvector/src/hnsw.rs:623-628 | v2/crates/wifi-densepose-ruvector/src/rotation.rs:207-212 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once.
Duplicated block (6 lines × 4) v2/crates/wifi-densepose-wasm-edge/src/exo_breathing_sync.rs:246— v2/crates/wifi-densepose-wasm-edge/src/exo_breathing_sync.rs:246-251 | v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:238-244 | v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs:206-212 | v2/crates/wifi-densepose-wasm-edge/src/exo_rain_detect.rs:189-194 — before extracting anything, compare `v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs` and `v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 4) examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:54— examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:54-59 | examples/research-sota/05-cross-room-reid/r3_2_embedding_physics_env.py:49-54 | examples/research-sota/06-structure-detection/r12_1_pose_pabs_loop.py:50-55 | examples/research-sota/06-structure-detection/r12_pabs_implementation.py:57-62 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 3) v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:71— v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:71-76 | v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs:83-88 | v2/crates/wifi-densepose-hardware/src/bin/realtek-csi-sim.rs:50-55 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs` and `v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 3) v2/crates/wifi-densepose-train/src/metrics.rs:878— v2/crates/wifi-densepose-train/src/metrics.rs:878-883 | v2/crates/wifi-densepose-train/src/metrics_core.rs:255-260 | v2/crates/wifi-densepose-train/src/ruview_metrics.rs:673-678 — before extracting anything, compare `v2/crates/wifi-densepose-train/src/metrics_core.rs` and `v2/crates/wifi-densepose-train/src/ruview_metrics.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6 lines × 3) v2/crates/ruview-twin/src/twin.rs:58— v2/crates/ruview-twin/src/twin.rs:58-63 | v2/crates/wifi-densepose-mat/src/domain/coordinates.rs:39-44 | v2/crates/wifi-densepose-sar/src/geometry.rs:23-28 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Low cohesion: NodeState (LCOM4 6) v2/crates/wifi-densepose-sensing-server/src/main.rs:1131— NodeState's methods fall into 6 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 6 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: MockRadio (LCOM4 4) v2/crates/wifi-densepose-hardware/src/radio_ops.rs:97— MockRadio's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Low cohesion: StageVEngine (LCOM4 4) v2/patches/ruvector-crv/src/stage_v.rs:20— StageVEngine's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
Dead file (~25 LoC) harness/wifi-densepose-privshield/src/init.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~25 LoC) scripts/pose-physics/verify-feature-boundary.mjs— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~25 LoC) wifi-veil/harness/src/init.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
X15 · Unvalidated length from an untrusted reader· Length read from the parsed input is spent without ever being bounded · ×3
Length read from the parsed input is spent without ever being bounded v2/crates/wifi-densepose-signal/src/ruvsense/calibration.rs:428— `n` is read from the bytes being parsed at line 423 (`u32::from_le_bytes`), then used to size a `Vec::with_capacity` at line 428 — and nowhere in its scope is `n` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `n` against the bytes actually remaining and a maximum the format allows before allocating.
Length read from the parsed input is spent without ever being bounded v2/crates/wifi-densepose-aether/src/embedding.rs:873— `count` is read from the bytes being parsed at line 865 (`u32::from_le_bytes`), then used to size a `Vec::with_capacity` at line 873 — and nowhere in its scope is `count` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: it reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB, and an allocation the allocator refuses aborts the process with `memory allocation of … bytes failed` — an abort, not a panic, so no `catch_unwind` intercepts it and the whole process dies; a 64-bit length past `isize::MAX` panics with `capacity overflow` instead, out of a parser whose failure path was written for malformed input, not for hostile input. Bound `count` against the bytes actually remaining and a maximum the format allows before allocating.
Length read from the parsed input is spent without ever being bounded scripts/export-onnx.py:51— `header_len` is read from the bytes being parsed at line 50 (`struct.unpack("<Q")`), then passed as the size of `read` at line 51 — and nowhere in its function is `header_len` compared to anything, clamped, or bounded against the input that remains. Whoever wrote those bytes therefore chooses the allocation directly: the call reserves the whole length before a single byte of the payload is known to exist, so a 32-bit length asks for up to 4 GiB (a 64-bit one for more than any machine has), and the reservation either raises `MemoryError` out of a parser whose failure path was written for malformed input, not for hostile input, or succeeds and holds gigabytes for a few bytes on the wire. Bound `header_len` against the bytes actually remaining and a maximum the format allows before reading.
AC3 · Page structure· Heading level jumps from h2 to h4 · ×2
Heading level jumps from h2 to h4 ui/components/LiveDemoTab.js:182— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
Heading level jumps from h2 to h4 v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:1176— Skipping heading levels breaks the document outline assistive tech relies on. Don't jump levels — increase by at most one.
AC4 · Keyboard semantics· Anchor without href · ×2
Anchor without href dashboard/src/components/nv-home.ts:263— An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
Anchor without href dashboard/src/components/nv-settings-drawer.ts:261— An <a> with no href, role or tabindex isn't focusable or keyboard-activatable. Give it a real href, or use a <button> for an action.
PersonMatcher::process_frame (cyclomatic 27) v2/crates/wifi-densepose-wasm-edge/src/sig_mincut_person_match.rs:90— PersonMatcher::process_frame has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PersonMatcher::greedy_assign (cyclomatic 20) v2/crates/wifi-densepose-wasm-edge/src/sig_mincut_person_match.rs:261— PersonMatcher::greedy_assign 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.
GaussianMap::insert (cyclomatic 23) v2/crates/ruview-unified/src/gaussian/map.rs:83— GaussianMap::insert 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.
GaussianMap::merge_overlapping (cyclomatic 23) v2/crates/ruview-unified/src/gaussian/map.rs:212— GaussianMap::merge_overlapping 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.
CsiEncoder.encodeBatch (cyclomatic 23) REDACTED:463— CsiEncoder.encodeBatch has cyclomatic complexity 23 (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.
CsiEncoder.encodeBatch (cyclomatic 23) REDACTED:296— CsiEncoder.encodeBatch has cyclomatic complexity 23 (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.
ruview_unified::adapters::normalize_grid (cyclomatic 20) v2/crates/ruview-unified/src/adapters.rs:258— ruview_unified::adapters::normalize_grid has cyclomatic complexity 20 (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.
ruview_unified::synth::raytrace::enumerate_paths (cyclomatic 20) v2/crates/ruview-unified/src/synth/raytrace.rs:39— ruview_unified::synth::raytrace::enumerate_paths 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.
SensingSession::handle_active (cyclomatic 20) v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:338— SensingSession::handle_active has cyclomatic complexity 20 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
SensingSession::handle_negotiating (cyclomatic 16) v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:247— SensingSession::handle_negotiating 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.
CsiFrame::from_bytes (cyclomatic 19) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:270— CsiFrame::from_bytes 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.
CsiFrame::from_bytes (cyclomatic 19) v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:258— CsiFrame::from_bytes 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.
wifi_densepose_mat::api::websocket::handle_socket (cyclomatic 18) v2/crates/wifi-densepose-mat/src/api/websocket.rs:84— wifi_densepose_mat::api::websocket::handle_socket 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.
wifi_densepose_mat::integration::feitcsi::validate_header (cyclomatic 18) v2/crates/wifi-densepose-mat/src/integration/feitcsi.rs:362— wifi_densepose_mat::integration::feitcsi::validate_header has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
SubcarrierWindow.correlationMatrix (cyclomatic 16) scripts/csi-graph-visualizer.js:103— SubcarrierWindow.correlationMatrix has cyclomatic complexity 16 (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.
SubcarrierWindow.correlationMatrix (cyclomatic 16) scripts/mincut-person-counter.js:97— SubcarrierWindow.correlationMatrix has cyclomatic complexity 16 (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.
No assertions: renders without crashing for each status ui/mobile/src/__tests__/components/ConnectionBanner.test.tsx:25— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
No assertions: renders all statuses without error ui/mobile/src/__tests__/components/StatusDot.test.tsx:37— This method's body runs code, and no assertion call was recognised in it. Recognised by name: Assert*, *Should*/ShouldBe*, Verify, Expect, Throws, Record, Received/DidNotReceive, MustHaveHappened/MustNotHaveHappened, EnsureSuccessStatusCode and *AndEnsure* — so verification routed through a helper of your own naming, through a base-class or callback object whose members hold the assertions, or through a harness that fails by throwing under some other name, is not visible to this check and is not counted here. Read it as 'no assertion this check knows how to see', and if that is right, add one.
SelfHealingMesh::stoer_wagner (cognitive 56) v2/crates/wifi-densepose-wasm-edge/src/aut_self_healing_mesh.rs:139— SelfHealingMesh::stoer_wagner has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 10 (21 pts), boolean chains 4 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SelfHealingMesh::process_frame (cognitive 20) v2/crates/wifi-densepose-wasm-edge/src/aut_self_healing_mesh.rs:81— SelfHealingMesh::process_frame has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
StructuralVibrationMonitor::process_frame (cognitive 50) v2/crates/wifi-densepose-wasm-edge/src/ind_structural_vibration.rs:140— StructuralVibrationMonitor::process_frame has cognitive complexity 50 (threshold 15). Drivers by points: if/else 22 (35 pts), loops 4 (10 pts), boolean chains 5 (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.
StructuralVibrationMonitor::compute_autocorrelation_peak (cognitive 16) v2/crates/wifi-densepose-wasm-edge/src/ind_structural_vibration.rs:301— StructuralVibrationMonitor::compute_autocorrelation_peak has cognitive complexity 16 (threshold 15). Drivers by points: loops 7 (9 pts), if/else 6 (7 pts) (nesting depth added 3). 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.
PersonMatcher::process_frame (cognitive 50) v2/crates/wifi-densepose-wasm-edge/src/sig_mincut_person_match.rs:90— PersonMatcher::process_frame has cognitive complexity 50 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 7 (11 pts), boolean chains 3 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PersonMatcher::greedy_assign (cognitive 42) v2/crates/wifi-densepose-wasm-edge/src/sig_mincut_person_match.rs:261— PersonMatcher::greedy_assign has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 8 (15 pts), boolean chains 2 (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.
wifi_densepose_mat::api::websocket::handle_socket (cognitive 43) v2/crates/wifi-densepose-mat/src/api/websocket.rs:84— wifi_densepose_mat::api::websocket::handle_socket has cognitive complexity 43 (threshold 15). Drivers by points: if/else 8 (34 pts), match/switch 3 (7 pts), loops 2 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_mat::tracking::tracker::greedy_assign (cognitive 19) v2/crates/wifi-densepose-mat/src/tracking/tracker.rs:514— wifi_densepose_mat::tracking::tracker::greedy_assign has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_wifiscan::adapter::netsh_scanner::parse_netsh_output (cognitive 42) v2/crates/wifi-densepose-wifiscan/src/adapter/netsh_scanner.rs:142— wifi_densepose_wifiscan::adapter::netsh_scanner::parse_netsh_output has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (40 pts), boolean chains 1, loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_wifiscan::adapter::linux_scanner::parse_iw_scan_output (cognitive 25) v2/crates/wifi-densepose-wifiscan/src/adapter/linux_scanner.rs:160— wifi_densepose_wifiscan::adapter::linux_scanner::parse_iw_scan_output has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CsiEncoder.encodeBatch (cognitive 40) REDACTED:463— CsiEncoder.encodeBatch has cognitive complexity 40 (threshold 15). Drivers by points: loops 17 (31 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CsiEncoder.encodeBatch (cognitive 40) REDACTED:296— CsiEncoder.encodeBatch has cognitive complexity 40 (threshold 15). Drivers by points: loops 17 (31 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
Trainer::pretrain_epoch (cognitive 37) v2/crates/wifi-densepose-sensing-server/src/trainer.rs:811— Trainer::pretrain_epoch has cognitive complexity 37 (threshold 15). Drivers by points: loops 9 (27 pts), if/else 4 (9 pts), match/switch 1 (nesting depth added 23). 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.
Trainer::train (cognitive 31) v2/crates/wifi-densepose-train/src/trainer.rs:115— Trainer::train has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (21 pts), match/switch 2 (7 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
getGuidance (cognitive 35) harness/homecore/src/guidance.js:52— getGuidance has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 17, if/else 9, ternaries 9. Of this number, 33 points are the body's own statements and 2 belong to 8 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
getGuidance (cognitive 35) harness/ruview/src/guidance.js:442— getGuidance has cognitive complexity 35 (threshold 15). Drivers by points: boolean chains 17, if/else 9, ternaries 9. Of this number, 33 points are the body's own statements and 2 belong to 8 function literals inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
AutomationEngine::start_timer (cognitive 31) v2/crates/homecore-automation/src/engine.rs:168— AutomationEngine::start_timer has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (21 pts), match/switch 2 (6 pts), loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AutomationEngine::start_event_loop (cognitive 18) v2/crates/homecore-automation/src/engine.rs:112— AutomationEngine::start_event_loop has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (12 pts), loops 2 (4 pts), 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.
wifi_densepose_mtk_bridge::listen (cognitive 30) v2/crates/wifi-densepose-mtk-bridge/src/main.rs:291— wifi_densepose_mtk_bridge::listen has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (21 pts), match/switch 3 (7 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_mtk_bridge::replay (cognitive 19) v2/crates/wifi-densepose-mtk-bridge/src/main.rs:200— wifi_densepose_mtk_bridge::replay has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 1, loops 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.
homecore_plugins::discovery::discover_plugins (cognitive 28) v2/crates/homecore-plugins/src/discovery.rs:58— homecore_plugins::discovery::discover_plugins has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 5, 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.
homecore_plugins::verify::verify_module (cognitive 16) v2/crates/homecore-plugins/src/verify.rs:101— homecore_plugins::verify::verify_module has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (14 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.
SensingSession::handle_active (cognitive 28) v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:338— SensingSession::handle_active has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (13 pts), match/switch 6 (13 pts), boolean chains 2 (nesting depth added 12). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
SensingSession::handle_negotiating (cognitive 19) v2/crates/wifi-densepose-hardware/src/ieee80211bf/session.rs:247— SensingSession::handle_negotiating has cognitive complexity 19 (threshold 15). Drivers by points: match/switch 6 (11 pts), if/else 5 (8 pts) (nesting depth added 8). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Condition::evaluate (cognitive 28) v2/crates/wifi-densepose-wasm-edge/src/aut_psycho_symbolic.rs:143— Condition::evaluate has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (27 pts), match/switch 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Condition::evaluate (cognitive 22) v2/crates/homecore-automation/src/condition.rs:71— Condition::evaluate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (6 pts), match/switch 2 (3 pts), boolean chains 1 (nesting depth added 11). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
GoapPlanner::plan_for_goal (cognitive 27) v2/crates/wifi-densepose-wasm-edge/src/tmp_goap_autonomy.rs:167— GoapPlanner::plan_for_goal has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 4 (8 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.
GoapPlanner::on_timer (cognitive 26) v2/crates/wifi-densepose-wasm-edge/src/tmp_goap_autonomy.rs:116— GoapPlanner::on_timer has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 3 (nesting depth added 14). 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.
SubcarrierWindow.correlationMatrix (cognitive 23) scripts/csi-graph-visualizer.js:103— SubcarrierWindow.correlationMatrix has cognitive complexity 23 (threshold 15). Drivers by points: loops 10 (15 pts), if/else 3 (4 pts), ternaries 1 (3 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.
SubcarrierWindow.correlationMatrix (cognitive 23) scripts/mincut-person-counter.js:97— SubcarrierWindow.correlationMatrix has cognitive complexity 23 (threshold 15). Drivers by points: loops 10 (15 pts), if/else 3 (4 pts), ternaries 1 (3 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.
ProjectionHead::merge_lora (cognitive 22) v2/crates/wifi-densepose-aether/src/embedding.rs:191— ProjectionHead::merge_lora has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (10 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. This shape REPEATS in the file: one other method here (ProjectionHead::unmerge_lora) 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.
ProjectionHead::unmerge_lora (cognitive 22) v2/crates/wifi-densepose-aether/src/embedding.rs:220— ProjectionHead::unmerge_lora has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (10 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. This shape REPEATS in the file: one other method here (ProjectionHead::merge_lora) 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.
CsiFrame::from_bytes (cognitive 22) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:270— CsiFrame::from_bytes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, 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.
CsiFrame::from_bytes (cognitive 22) v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:258— CsiFrame::from_bytes has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, 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.
HnswIndex::search_layer (cognitive 21) v2/crates/wifi-densepose-ruvector/src/hnsw.rs:441— HnswIndex::search_layer has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 5 (9 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.
HnswIndex::select_neighbours (cognitive 16) v2/crates/wifi-densepose-ruvector/src/hnsw.rs:500— HnswIndex::select_neighbours has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 3 (5 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.
AdaptivePoolingAttacker::enroll (cognitive 17) v2/crates/wifi-densepose-privshield/src/attacker.rs:256— AdaptivePoolingAttacker::enroll has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (14 pts), if/else 2 (3 pts) (nesting depth added 6). 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.
AdaptivePoolingAttacker::enroll (cognitive 17) wifi-veil/src/attacker.rs:256— AdaptivePoolingAttacker::enroll has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (14 pts), if/else 2 (3 pts) (nesting depth added 6). 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.
MatDashboard::render_zones (cognitive 17) v2/crates/wifi-densepose-wasm/src/mat.rs:1170— MatDashboard::render_zones has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 2 (5 pts), match/switch 3 (5 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MatDashboard::push_csi_data (cognitive 16) v2/crates/wifi-densepose-wasm/src/mat.rs:1329— MatDashboard::push_csi_data has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D4 · Code Duplication· Edited copy of a member (11 corresponding lines) · ×2
Edited copy of a member (11 corresponding lines) python/src/bindings/aether.rs:298— python/src/bindings/aether.rs:298-308 | v2/crates/wifi-densepose-aether/src/embedding.rs:458-468 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Edited copy of a member (11 corresponding lines) v2/crates/wifi-densepose-signal/src/ruvsense/cross_room.rs:369— v2/crates/wifi-densepose-signal/src/ruvsense/cross_room.rs:369-379 | v2/crates/wifi-densepose-signal/src/ruvsense/longitudinal.rs:583-593 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (6 members, 50+ identical tokens) · ×2
Members sharing a duplicated core (6 members, 50+ identical tokens) v2/crates/wifi-densepose-privshield/src/attacker.rs:123— v2/crates/wifi-densepose-privshield/src/attacker.rs:123-132 | v2/crates/wifi-densepose-privshield/src/attacker.rs:223-232 | v2/crates/wifi-densepose-privshield/src/attacker.rs:329-338 | wifi-veil/src/attacker.rs:123-132 | wifi-veil/src/attacker.rs:223-232 | wifi-veil/src/attacker.rs:329-338 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Members sharing a duplicated core (6 members, 50+ identical tokens) archive/v1/src/services/health_check.py:133— archive/v1/src/services/health_check.py:133-160 | archive/v1/src/services/health_check.py:163-201 | archive/v1/src/services/health_check.py:204-239 | archive/v1/src/services/health_check.py:242-280 | archive/v1/src/services/health_check.py:283-321 | archive/v1/src/services/health_check.py:324-362 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Duplicated block (43 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:240— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:240-282 | wifi-veil/src/bin/veil.rs:240-282 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (43 lines × 2) v2/crates/wifi-densepose-privshield/src/experiment.rs:127— v2/crates/wifi-densepose-privshield/src/experiment.rs:127-169 | wifi-veil/src/experiment.rs:127-169 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/experiment.rs` and `wifi-veil/src/experiment.rs` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 97 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (40 lines × 2) v2/crates/cog-person-count/src/inference.rs:136— v2/crates/cog-person-count/src/inference.rs:136-175 | v2/crates/cog-pose-estimation/src/inference.rs:191-230 — before extracting anything, compare `v2/crates/cog-person-count/src/inference.rs` and `v2/crates/cog-pose-estimation/src/inference.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 54 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (40 lines × 2) v2/crates/wifi-densepose-privshield/src/optimize.rs:145— v2/crates/wifi-densepose-privshield/src/optimize.rs:145-184 | wifi-veil/src/optimize.rs:145-184 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/optimize.rs` and `wifi-veil/src/optimize.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (37 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:349— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:349-385 | wifi-veil/src/bin/veil.rs:349-385 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (37 lines × 2) v2/crates/wifi-densepose-signal/src/ruvsense/gesture.rs:237— v2/crates/wifi-densepose-signal/src/ruvsense/gesture.rs:237-273 | v2/crates/wifi-densepose-signal/src/ruvsense/temporal_gesture.rs:193-229 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (25–29 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs:322— v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs:322-346 | v2/crates/wifi-densepose-wasm-edge/src/exo_time_crystal.rs:264-292 — before extracting anything, compare `v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs` and `v2/crates/wifi-densepose-wasm-edge/src/exo_time_crystal.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (25–29 lines × 2) archive/v1/src/api/routers/stream.py:135— archive/v1/src/api/routers/stream.py:135-163 | archive/v1/src/api/routers/stream.py:251-275 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `archive/v1/src/api/routers/stream.py:135` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (25 lines × 2) v2/crates/wifi-densepose-privshield/src/optimize.rs:219— v2/crates/wifi-densepose-privshield/src/optimize.rs:219-243 | wifi-veil/src/optimize.rs:219-243 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/optimize.rs` and `wifi-veil/src/optimize.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 125 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (25 lines × 2) v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:104— v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:104-128 | v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:155-179 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (21–22 lines × 2) v2/crates/cog-person-count/src/runtime.rs:59— v2/crates/cog-person-count/src/runtime.rs:59-79 | v2/crates/cog-pose-estimation/src/runtime.rs:82-103 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (21–22 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:1790— v2/crates/wifi-densepose-sensing-server/src/main.rs:1790-1811 | v2/crates/wifi-densepose-sensing-server/src/types.rs:445-465 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/types.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (22 lines × 2) v2/crates/wifi-densepose-privshield/src/attacker.rs:98— v2/crates/wifi-densepose-privshield/src/attacker.rs:98-119 | wifi-veil/src/attacker.rs:98-119 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/attacker.rs` and `wifi-veil/src/attacker.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (22 lines × 2) references/script_2.py:168— references/script_2.py:168-189 | references/wifi_densepose_pytorch.py:183-204 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (21 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:396— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:396-416 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:386-406 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (21 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:5111— v2/crates/wifi-densepose-sensing-server/src/main.rs:5111-5131 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13444-13464 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (19 lines × 3) v2/crates/wifi-densepose-sensing-server/src/main.rs:5059— v2/crates/wifi-densepose-sensing-server/src/main.rs:5059-5077 | v2/crates/wifi-densepose-sensing-server/src/main.rs:5229-5247 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13382-13400 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (19 lines × 3) v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:218— v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:218-236 | v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs:186-204 | v2/crates/wifi-densepose-wasm-edge/src/exo_rain_detect.rs:171-189 — before extracting anything, compare `v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs` and `v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18–19 lines × 2) v2/crates/wifi-densepose-ruvector/src/viewpoint/attention.rs:407— v2/crates/wifi-densepose-ruvector/src/viewpoint/attention.rs:407-425 | v2/crates/wifi-densepose-ruvector/src/viewpoint/attention.rs:504-521 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–19 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/gesture.rs:202— v2/crates/wifi-densepose-wasm-edge/src/gesture.rs:202-220 | v2/crates/wifi-densepose-wasm-edge/src/lrn_dtw_gesture_learn.rs:388-405 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (16–19 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:448— v2/crates/wifi-densepose-sensing-server/src/csi.rs:448-463 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4068-4086 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16–19 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1101— v2/crates/wifi-densepose-sensing-server/src/csi.rs:1101-1116 | v2/crates/wifi-densepose-sensing-server/src/main.rs:6638-6656 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16–17 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:496— v2/crates/wifi-densepose-sensing-server/src/csi.rs:496-511 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4133-4149 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16–17 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/exo_breathing_sync.rs:240— v2/crates/wifi-densepose-wasm-edge/src/exo_breathing_sync.rs:240-256 | v2/crates/wifi-densepose-wasm-edge/src/exo_rain_detect.rs:184-199 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12–16 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:4451— v2/crates/wifi-densepose-sensing-server/src/main.rs:4451-4466 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4502-4513 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–16 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/coherence.rs:84— v2/crates/wifi-densepose-wasm-edge/src/coherence.rs:84-99 | v2/crates/wifi-densepose-wasm-edge/src/sig_coherence_gate.rs:119-130 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (14–15 lines × 2) v2/crates/wifi-densepose-nn/src/onnx.rs:72— v2/crates/wifi-densepose-nn/src/onnx.rs:72-86 | v2/crates/wifi-densepose-nn/src/onnx.rs:112-125 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–15 lines × 2) scripts/train-count.py:275— scripts/train-count.py:275-288 | scripts/train-count.py:678-692 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–13 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:307— v2/crates/wifi-densepose-sensing-server/src/csi.rs:307-317 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3764-3776 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11–13 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:485— v2/crates/wifi-densepose-sensing-server/src/csi.rs:485-495 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4120-4132 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 3) v2/crates/wifi-densepose-aether/src/embedding.rs:753— v2/crates/wifi-densepose-aether/src/embedding.rs:753-764 | v2/crates/wifi-densepose-sensing-server/src/trainer.rs:881-892 | v2/crates/wifi-densepose-sensing-server/src/trainer.rs:897-908 — there are 3 copies across 2 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (12 lines × 3) v2/crates/wifi-densepose-signal/src/csi_processor.rs:415— v2/crates/wifi-densepose-signal/src/csi_processor.rs:415-426 | v2/crates/wifi-densepose-signal/src/csi_processor.rs:444-455 | v2/crates/wifi-densepose-signal/src/csi_processor.rs:465-476 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (9–12 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7507— v2/crates/wifi-densepose-sensing-server/src/main.rs:7507-7518 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:204-212 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9–12 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/sig_sparse_recovery.rs:226— v2/crates/wifi-densepose-wasm-edge/src/sig_sparse_recovery.rs:226-237 | v2/crates/wifi-densepose-wasm-edge/src/sig_sparse_recovery.rs:279-287 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–12 lines × 2) v2/crates/wifi-densepose-train/src/dataset.rs:826— v2/crates/wifi-densepose-train/src/dataset.rs:826-837 | v2/crates/wifi-densepose-train/src/dataset.rs:842-851 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–12 lines × 2) references/script_4.py:181— references/script_4.py:181-190 | references/script_6.py:56-67 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (9–10 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:4999— v2/crates/wifi-densepose-sensing-server/src/main.rs:4999-5008 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13348-13356 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–10 lines × 2) v2/crates/wifi-densepose-train/src/dataset.rs:255— v2/crates/wifi-densepose-train/src/dataset.rs:255-264 | v2/crates/wifi-densepose-train/src/dataset.rs:739-747 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 4) v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:86— v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs:86-94 | v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs:98-106 | v2/crates/wifi-densepose-hardware/src/bin/realtek-csi-sim.rs:66-74 | v2/crates/wifi-densepose-hardware/src/bin/rtl8720f-sim.rs:63-71 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/bin/mediatek-csi-sim.rs` and `v2/crates/wifi-densepose-hardware/src/bin/qualcomm-csi-sim.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 49 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 4) v2/crates/wifi-densepose-train/src/accuracy.rs:209— v2/crates/wifi-densepose-train/src/accuracy.rs:209-217 | v2/crates/wifi-densepose-train/src/metrics_core.rs:201-209 | v2/crates/wifi-densepose-train/src/metrics_core.rs:251-259 | v2/crates/wifi-densepose-train/src/ruview_metrics.rs:669-677 — before extracting anything, compare `v2/crates/wifi-densepose-train/src/metrics_core.rs` and `v2/crates/wifi-densepose-train/src/ruview_metrics.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7–8 lines × 2) v2/crates/wifi-densepose-cli/src/room.rs:367— v2/crates/wifi-densepose-cli/src/room.rs:367-373 | v2/crates/wifi-densepose-cli/src/room.rs:435-442 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7–8 lines × 2) v2/crates/wifi-densepose-mat/src/integration/neural_adapter.rs:91— v2/crates/wifi-densepose-mat/src/integration/neural_adapter.rs:91-97 | v2/crates/wifi-densepose-mat/src/integration/signal_adapter.rs:80-87 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 4) v2/crates/wifi-densepose-privshield/src/protector.rs:159— v2/crates/wifi-densepose-privshield/src/protector.rs:159-165 | v2/crates/wifi-densepose-privshield/src/protector.rs:199-205 | wifi-veil/src/protector.rs:159-165 | wifi-veil/src/protector.rs:199-205 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/protector.rs` and `wifi-veil/src/protector.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 75 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7 lines × 4) examples/research-sota/02-placement/r6_2_2_multistatic_placement.py:71— examples/research-sota/02-placement/r6_2_2_multistatic_placement.py:71-77 | examples/research-sota/02-placement/r6_2_3_chest_centric.py:67-73 | examples/research-sota/02-placement/r6_2_5_multi_subject.py:60-66 | examples/research-sota/02-placement/r6_2_antenna_placement.py:94-100 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 4 call sites, so a change lands once.
Duplicated block (6–7 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1152— v2/crates/wifi-densepose-sensing-server/src/csi.rs:1152-1157 | v2/crates/wifi-densepose-sensing-server/src/main.rs:5770-5776 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6–7 lines × 2) v2/crates/wifi-densepose-wifiscan/src/adapter/macos_scanner.rs:261— v2/crates/wifi-densepose-wifiscan/src/adapter/macos_scanner.rs:261-267 | v2/crates/wifi-densepose-wifiscan/src/adapter/macos_scanner.rs:303-308 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (3–5 lines × 3) v2/crates/wifi-densepose-mat/src/detection/movement.rs:76— v2/crates/wifi-densepose-mat/src/detection/movement.rs:76-80 | v2/crates/wifi-densepose-mat/src/ml/mod.rs:311-316 | v2/crates/wifi-densepose-vitals/src/heartrate.rs:273-275 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (3–5 lines × 3) scripts/train-count.py:211— scripts/train-count.py:211-215 | scripts/train-count.py:386-388 | scripts/train-count.py:579-583 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `scripts/train-count.py:215` calls `CountNet`, `to`, `AdamW` and `scripts/train-count.py:388` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (10 lines × 3) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:615— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:615-624 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:605-614 | v2/crates/wifi-densepose-hardware/src/realtek_csi.rs:455-464 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (10 lines × 3) v2/crates/wifi-densepose-train/src/model.rs:448— v2/crates/wifi-densepose-train/src/model.rs:448-458 | v2/crates/wifi-densepose-train/src/model.rs:730-739 | v2/crates/wifi-densepose-train/src/model.rs:809-818 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (18 lines × 3) archive/v1/src/api/routers/health.py:88— archive/v1/src/api/routers/health.py:88-105 | archive/v1/src/api/routers/health.py:122-139 | archive/v1/src/api/routers/health.py:140-169 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `archive/v1/src/api/routers/health.py:88` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (18 lines × 3) archive/v1/src/tasks/backup.py:517— archive/v1/src/tasks/backup.py:517-534 | archive/v1/src/tasks/cleanup.py:521-538 | archive/v1/src/tasks/monitoring.py:708-725 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
R10 · Code Duplication· Duplicated block with local edits (93 matched lines × 2 locations) · ×2
Duplicated block with local edits (93 matched lines × 2 locations) scripts/room-fingerprint.js:321— scripts/room-fingerprint.js:321 · scripts/stress-monitor.js:264 — the two spans are one implementation copied and then locally edited — 608 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block with local edits (93 matched lines × 2 locations) ui/services/model.service.js:6— ui/services/model.service.js:6 · ui/services/training.service.js:7 — the two spans are one implementation copied and then locally edited — 659 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (30 lines × 2 locations) scripts/csi-graph-visualizer.js:185— scripts/csi-graph-visualizer.js:185 · scripts/mincut-person-counter.js:193 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (30 lines × 2 locations) REDACTED:712— REDACTED:712 · REDACTED:408 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Swallowed exception (caught, then discarded) wifi_densepose/__init__.py:94— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) v2/crates/homecore-server/ui/js/ws.js:28— `catch` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
AC2 · Forms & labels· <TextInput> field component without a label · ×1
<TextInput> field component without a label ui/mobile/src/screens/SettingsScreen/ServerUrlInput.tsx:40— This UI-library field component is named only by a placeholder — a placeholder is not a label (it vanishes as soon as the user types, and many assistive technologies ignore it). Give it a real name whichever way this library supports: a label prop, an aria-label, or an id on the rendered control with a <label htmlFor> pointing at it. For a group of controls, name the group itself (aria-label, or a fieldset with a legend) — labelling each item leaves the set unnamed.
AC3 · Page structure· Data table has no header cells · ×1
Data table has no header cells dashboard/src/components/nv-inspector.ts:311— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
runDoctor (cyclomatic 100) harness/ruview/src/doctor.js:63— runDoctor has cyclomatic complexity 100 (threshold 15). Of this number, 98 points are the body's own statements and 2 belong to 11 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity· run (cyclomatic 96) · ×1
run (cyclomatic 96) harness/ruview/src/cli.js:243— run has cyclomatic complexity 96 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
train-camera-free.main (cyclomatic 93) REDACTED:1703— train-camera-free.main has cyclomatic complexity 93 (threshold 15). Of this number, 90 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
parseSpacesOutput (cyclomatic 82) harness/ruview/src/spaces.js:80— parseSpacesOutput has cyclomatic complexity 82 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
NetworkDiscovery.NetworkDiscovery (cyclomatic 81) v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:43— NetworkDiscovery.NetworkDiscovery has cyclomatic complexity 81 (threshold 15). Of this number, 57 points are the body's own statements and 24 belong to 9 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
train-camera-free.generateWeakLabels (cyclomatic 78) REDACTED:915— train-camera-free.generateWeakLabels has cyclomatic complexity 78 (threshold 15). Of this number, 69 points are the body's own statements and 9 belong to 5 function literals inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
benchmark-ruvllm.main (cyclomatic 77) REDACTED:277— benchmark-ruvllm.main has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
GaussianSplatWebView.web.GaussianSplatWebViewWeb (cyclomatic 73) ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx:277— GaussianSplatWebView.web.GaussianSplatWebViewWeb has cyclomatic complexity 73 (threshold 15). Most of this is not in the body itself: 1 of the 73 points is its own statement and the rest belongs to 11 function literals inside it that branch (lines 447, 298, 288, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
provision.main (cyclomatic 70) firmware/esp32-csi-node/provision.py:649— provision.main has cyclomatic complexity 70 (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.
OtaUpdate.OtaUpdate (cyclomatic 68) v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:38— OtaUpdate.OtaUpdate has cyclomatic complexity 68 (threshold 15). Of this number, 41 points are the body's own statements and 27 belong to 10 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DemoDataGenerator._intrusionDetect (cyclomatic 64) ui/observatory/js/demo-data.js:715— DemoDataGenerator._intrusionDetect has cyclomatic complexity 64 (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.
render (cyclomatic 63) v2/crates/homecore-server/ui/js/panels/calibration.js:8— render has cyclomatic complexity 63 (threshold 15). Most of this is not in the body itself: 2 of the 63 points are its own statements and the rest belongs to 34 function items inside it that branch (step2::startCapture::(anonymous)::loop, a function literal at line 180, a function literal at line 207, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
DemoDataGenerator._searchRescue (cyclomatic 61) ui/observatory/js/demo-data.js:1121— DemoDataGenerator._searchRescue has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli.run (cyclomatic 60) harness/homecore/bin/cli.js:103— cli.run has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
train-ruvllm.main (cyclomatic 55) REDACTED:1025— train-ruvllm.main 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.
train-wiflow.main (cyclomatic 55) REDACTED:483— train-wiflow.main has cyclomatic complexity 55 (threshold 15). Of this number, 51 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
DemoDataGenerator._fallEvent (cyclomatic 53) ui/observatory/js/demo-data.js:444— DemoDataGenerator._fallEvent 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.
EdgeModules.EdgeModules (cyclomatic 51) v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:602— EdgeModules.EdgeModules has cyclomatic complexity 51 (threshold 15). Of this number, 24 points are the body's own statements and 27 belong to 10 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
readEsphome (cyclomatic 51) harness/ruview/src/devices/esphome.js:182— readEsphome has cyclomatic complexity 51 (threshold 15). Most of this is not in the body itself: 7 of the 51 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 225, a function literal at line 224, (anonymous)::finish, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
register (cyclomatic 50) harness/ruview/mod/hooks/register.mjs:49— register has cyclomatic complexity 50 (threshold 15). Most of this is not in the body itself: 1 of the 50 points is its own statement and the rest belongs to 41 function items inside it that branch (a function literal at line 192, animate, a function literal at line 209, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
MeshView.MeshView (cyclomatic 49) v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:143— MeshView.MeshView has cyclomatic complexity 49 (threshold 15). Most of this is not in the body itself: 10 of the 49 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 222, 369, 283, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
model.validate (cyclomatic 48) docs/rf-diagnostics/model.js:6— model.validate has cyclomatic complexity 48 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
benchmark-rf-scan.computeMetrics (cyclomatic 47) scripts/benchmark-rf-scan.js:163— benchmark-rf-scan.computeMetrics 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.
DemoDataGenerator._securityPatrol (cyclomatic 45) ui/observatory/js/demo-data.js:1521— DemoDataGenerator._securityPatrol has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
validate_qemu_output.validate_log (cyclomatic 44) scripts/validate_qemu_output.py:123— validate_qemu_output.validate_log has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Connection::handle_cmd (cyclomatic 43) v2/crates/homecore-api/src/ws.rs:241— Connection::handle_cmd has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SurvivorTracker::update (cyclomatic 43) v2/crates/wifi-densepose-mat/src/tracking/tracker.rs:173— SurvivorTracker::update has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
deep-scan.report (cyclomatic 43) scripts/deep-scan.js:76— deep-scan.report has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
train-wiflow-supervised.main (cyclomatic 43) scripts/train-wiflow-supervised.js:1203— train-wiflow-supervised.main has cyclomatic complexity 43 (threshold 15). Of this number, 40 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CanvasRenderer.drawSkeleton (cyclomatic 43) ui/pose-fusion/js/canvas-renderer.js:33— CanvasRenderer.drawSkeleton has cyclomatic complexity 43 (threshold 15). Of this number, 42 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
DemoDataGenerator._elderlyCare (cyclomatic 42) ui/observatory/js/demo-data.js:1247— DemoDataGenerator._elderlyCare has cyclomatic complexity 42 (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.
train.run (cyclomatic 41) tools/bfi_learning/train.py:515— train.run has cyclomatic complexity 41 (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.
train-ruvllm.generateTriplets (cyclomatic 41) REDACTED:467— train-ruvllm.generateTriplets has cyclomatic complexity 41 (threshold 15). Of this number, 38 points are the body's own statements and 3 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.
qemu_swarm.run_assertions (cyclomatic 40) scripts/qemu_swarm.py:544— qemu_swarm.run_assertions 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.
train-count.main (cyclomatic 40) scripts/train-count.py:170— train-count.main has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
esp32.parsePacket (cyclomatic 40) harness/ruview/src/devices/esp32.js:111— esp32.parsePacket 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.
esp32.captureEsp32 (cyclomatic 40) harness/ruview/src/devices/esp32.js:406— esp32.captureEsp32 has cyclomatic complexity 40 (threshold 15). Most of this is not in the body itself: 15 of the 40 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 431, 467, 459, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
SeizureDetector::process_frame (cyclomatic 39) v2/crates/wifi-densepose-wasm-edge/src/med_seizure_detect.rs:171— SeizureDetector::process_frame has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
Sensing.Sensing (cyclomatic 39) v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx:300— Sensing.Sensing has cyclomatic complexity 39 (threshold 15). Of this number, 26 points are the body's own statements and 13 belong to 6 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
renderCapture (cyclomatic 39) harness/ruview/src/cli-ui.js:66— renderCapture has cyclomatic complexity 39 (threshold 15). Of this number, 38 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
EdgeModules.ModuleLibraryTab (cyclomatic 38) v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:983— EdgeModules.ModuleLibraryTab has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 15 of the 38 points are its own statements and the rest belongs to 6 function items inside it that branch (a function literal at line 1081, a function literal at line 1001, handleInstall, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
TrainingConfig::validate (cyclomatic 37) v2/crates/wifi-densepose-train/src/config.rs:364— TrainingConfig::validate has cyclomatic complexity 37 (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.
brain.validateBrainRecord (cyclomatic 37) harness/homecore/src/brain.js:19— brain.validateBrainRecord has cyclomatic complexity 37 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
guidance.getGuidance (cyclomatic 37) harness/ruview/src/guidance.js:442— guidance.getGuidance has cyclomatic complexity 37 (threshold 15). Of this number, 35 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
train-camera-free.generateTriplets (cyclomatic 37) REDACTED:1153— train-camera-free.generateTriplets 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.
config_push.main (cyclomatic 36) REDACTED:92— config_push.main has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
guidance.getGuidance (cyclomatic 36) harness/homecore/src/guidance.js:52— guidance.getGuidance has cyclomatic complexity 36 (threshold 15). Of this number, 34 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
bfi_decode.analyze (cyclomatic 35) tools/bfi/bfi_decode.py:229— bfi_decode.analyze 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.
capture_linux.main (cyclomatic 35) tools/bfi/capture_linux.py:129— capture_linux.main has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
run_trial_linux.main (cyclomatic 35) tools/bfi/run_trial_linux.py:212— run_trial_linux.main has cyclomatic complexity 35 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PhysicsEngine::process_with_context (cyclomatic 34) v2/crates/wifi-densepose-physics/src/engine.rs:206— PhysicsEngine::process_with_context has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DemoDataGenerator._fitnessTracking (cyclomatic 34) ui/observatory/js/demo-data.js:1387— DemoDataGenerator._fitnessTracking 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.
ScenarioProps.update (cyclomatic 34) ui/observatory/js/scenario-props.js:649— ScenarioProps.update has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CnnEmbedder._extractWithAttention (cyclomatic 34) ui/pose-fusion/js/cnn-embedder.js:220— CnnEmbedder._extractWithAttention 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.
REDACTED.handleData (cyclomatic 34) REDACTED:553— REDACTED.handleData 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.
ruview_cognitum_spaces::decode_spatial (cyclomatic 33) v2/crates/ruview-cognitum-spaces/src/lib.rs:467— ruview_cognitum_spaces::decode_spatial 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.
wifi_densepose_cli::calibrate_api::ingest_loop (cyclomatic 33) v2/crates/wifi-densepose-cli/src/calibrate_api.rs:388— wifi_densepose_cli::calibrate_api::ingest_loop 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.
BreathingSyncDetector::process_frame (cyclomatic 33) v2/crates/wifi-densepose-wasm-edge/src/exo_breathing_sync.rs:200— BreathingSyncDetector::process_frame 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.
HudController.updateHUD (cyclomatic 33) ui/observatory/js/hud-controller.js:376— HudController.updateHUD has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
LightingZoneController::process_frame (cyclomatic 32) v2/crates/wifi-densepose-wasm-edge/src/bld_lighting_zones.rs:121— LightingZoneController::process_frame has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
benchmark-wiflow.main (cyclomatic 32) scripts/benchmark-wiflow.js:73— benchmark-wiflow.main has cyclomatic complexity 32 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
FlashFirmware.FlashFirmware (cyclomatic 32) v2/crates/wifi-densepose-desktop/ui/src/pages/FlashFirmware.tsx:8— FlashFirmware.FlashFirmware has cyclomatic complexity 32 (threshold 15). Of this number, 17 points are the body's own statements and 15 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PromptShield::process_frame (cyclomatic 31) v2/crates/wifi-densepose-wasm-edge/src/ais_prompt_shield.rs:68— PromptShield::process_frame 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.
PlantGrowthDetector::process_frame (cyclomatic 31) v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs:173— PlantGrowthDetector::process_frame 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.
DwellHeatmapTracker::process_frame (cyclomatic 31) v2/crates/wifi-densepose-wasm-edge/src/ret_dwell_heatmap.rs:119— DwellHeatmapTracker::process_frame 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.
TableTurnoverTracker::process_frame (cyclomatic 31) v2/crates/wifi-densepose-wasm-edge/src/ret_table_turnover.rs:137— TableTurnoverTracker::process_frame 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.
PerimeterBreachDetector::process_frame (cyclomatic 31) v2/crates/wifi-densepose-wasm-edge/src/sec_perimeter_breach.rs:143— PerimeterBreachDetector::process_frame 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.
training.trainingGate (cyclomatic 31) harness/ruview/src/training.js:29— training.trainingGate 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.
csi-graph-visualizer.stoerWagner (cyclomatic 31) scripts/csi-graph-visualizer.js:221— csi-graph-visualizer.stoerWagner 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.
GaitAnalyzer.analyze (cyclomatic 31) scripts/gait-analyzer.js:125— GaitAnalyzer.analyze 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.
startMcpHttp (cyclomatic 31) REDACTED:53— startMcpHttp has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 10 of the 31 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 66, a function literal at line 93, a function literal at line 88, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
GestureLearner::process_frame (cyclomatic 30) v2/crates/wifi-densepose-wasm-edge/src/lrn_dtw_gesture_learn.rs:148— GestureLearner::process_frame 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.
c6-presence-watcher.main (cyclomatic 30) scripts/c6-presence-watcher.py:192— c6-presence-watcher.main 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.
policy.validateArguments (cyclomatic 30) REDACTED:36— policy.validateArguments 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.
NullPatternTracker.detectChanges (cyclomatic 30) scripts/material-detector.js:110— NullPatternTracker.detectChanges 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.
train-camera-free.collectMultiModalData (cyclomatic 30) REDACTED:779— train-camera-free.collectMultiModalData 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.
gaussian-splats.html.routeMessage (cyclomatic 30) ui/mobile/src/assets/webview/gaussian-splats.html:461— gaussian-splats.html.routeMessage has cyclomatic complexity 30 (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.
DemoDataGenerator._sleepMonitoring (cyclomatic 30) ui/observatory/js/demo-data.js:571— DemoDataGenerator._sleepMonitoring has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
App.App (cyclomatic 30) v2/crates/wifi-densepose-desktop/ui/src/App.tsx:49— App.App has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 8 of the 30 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 179, renderPage, a function literal at line 67). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
startMcpServer (cyclomatic 30) harness/homecore/src/mcp-server.js:143— startMcpServer has cyclomatic complexity 30 (threshold 15). Most of this is not in the body itself: 4 of the 30 points are its own statements and the rest belongs to 9 function items inside it that branch ((anonymous)::acceptLine, a function literal at line 251, a function literal at line 169, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
mainLoop (cyclomatic 30) REDACTED:240— mainLoop 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.
StructuralVibrationMonitor::process_frame (cyclomatic 29) v2/crates/wifi-densepose-wasm-edge/src/ind_structural_vibration.rs:140— StructuralVibrationMonitor::process_frame 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.
NvConsole.exec (cyclomatic 29) dashboard/src/components/nv-console.ts:119— NvConsole.exec 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.
brain.validateBrainRecord (cyclomatic 29) harness/ruview/src/brain.js:20— brain.validateBrainRecord has cyclomatic complexity 29 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
GaussianSplatRenderer.update (cyclomatic 29) ui/components/gaussian-splats.js:305— GaussianSplatRenderer.update 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.
BodyModel.updateFromKeypoints (cyclomatic 29) ui/components/body-model.js:291— BodyModel.updateFromKeypoints has cyclomatic complexity 29 (threshold 15). Of this number, 20 points are the body's own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DemoDataGenerator._gestureControl (cyclomatic 29) ui/observatory/js/demo-data.js:852— DemoDataGenerator._gestureControl 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.
readIphoneLidar (cyclomatic 29) harness/ruview/src/devices/lidar.js:104— readIphoneLidar has cyclomatic complexity 29 (threshold 15). Most of this is not in the body itself: 10 of the 29 points are its own statements and the rest belongs to 8 function items inside it that branch ((anonymous)::finish, (anonymous)::onclose, (anonymous)::onmessage, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
modelOf (cyclomatic 29) harness/ruview/mod/hooks/model.mjs:90— modelOf has cyclomatic complexity 29 (threshold 15). Of this number, 23 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
wifi_densepose_privshield::bin::veil::tui (cyclomatic 28) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:409— wifi_densepose_privshield::bin::veil::tui 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.
GhostHunterDetector::process_frame (cyclomatic 28) v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:201— GhostHunterDetector::process_frame has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
wifi_veil::bin::veil::tui (cyclomatic 28) wifi-veil/src/bin/veil.rs:409— wifi_veil::bin::veil::tui 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.
policy.validateArguments (cyclomatic 28) harness/homecore/src/policy.js:25— policy.validateArguments 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.
DemoDataGenerator._crowdOccupancy (cyclomatic 28) ui/observatory/js/demo-data.js:969— DemoDataGenerator._crowdOccupancy has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
render (cyclomatic 28) v2/crates/homecore-server/ui/js/panels/entities.js:20— render has cyclomatic complexity 28 (threshold 15). Most of this is not in the body itself: 6 of the 28 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 124, render, patchRow, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
viewOf (cyclomatic 28) harness/ruview/mod/hooks/views.mjs:63— viewOf has cyclomatic complexity 28 (threshold 15). Of this number, 26 points are the body's own statements and 2 belong to 5 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ElevatorCounter::process_frame (cyclomatic 27) v2/crates/wifi-densepose-wasm-edge/src/bld_elevator_count.rs:126— ElevatorCounter::process_frame has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ShelfEngagementDetector::process_frame (cyclomatic 27) v2/crates/wifi-densepose-wasm-edge/src/ret_shelf_engagement.rs:166— ShelfEngagementDetector::process_frame has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli.run (cyclomatic 27) harness/ruview-kernel/bin/cli.js:81— cli.run has cyclomatic complexity 27 (threshold 15). Of this number, 26 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
material-detector.startReplay (cyclomatic 27) scripts/material-detector.js:317— material-detector.startReplay has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
resolveBundle (cyclomatic 27) harness/ruview/src/firmware.js:78— resolveBundle has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SelfHealingMesh::stoer_wagner (cyclomatic 26) v2/crates/wifi-densepose-wasm-edge/src/aut_self_healing_mesh.rs:139— SelfHealingMesh::stoer_wagner 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.
MeetingRoomTracker::process_frame (cyclomatic 26) v2/crates/wifi-densepose-wasm-edge/src/bld_meeting_room.rs:101— MeetingRoomTracker::process_frame 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.
esp32_jsonl_to_rvcsi.main (cyclomatic 26) scripts/esp32_jsonl_to_rvcsi.py:59— esp32_jsonl_to_rvcsi.main 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.
quality_report.analyze (cyclomatic 26) tools/bfi/quality_report.py:131— quality_report.analyze 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.
process-runner.runProcess (cyclomatic 26) harness/homecore/src/process-runner.js:89— process-runner.runProcess has cyclomatic complexity 26 (threshold 15). Most of this is not in the body itself: 10 of the 26 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 165, 134, 156, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
mcp-server.handleRpc (cyclomatic 26) harness/ruview/src/mcp-server.js:60— mcp-server.handleRpc 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.
MusicConductorDetector::process_frame (cyclomatic 25) v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs:164— MusicConductorDetector::process_frame has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
IntrusionDetector::process_frame (cyclomatic 25) v2/crates/wifi-densepose-wasm-edge/src/intrusion.rs:109— IntrusionDetector::process_frame 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.
WeaponDetector::process_frame (cyclomatic 25) v2/crates/wifi-densepose-wasm-edge/src/sec_weapon_detect.rs:126— WeaponDetector::process_frame has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
seed_csi_bridge.run_bridge (cyclomatic 25) scripts/seed_csi_bridge.py:367— seed_csi_bridge.run_bridge 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.
train.build_splits (cyclomatic 25) tools/bfi_learning/train.py:220— train.build_splits has cyclomatic complexity 25 (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.
adapter.validateSnapshotData (cyclomatic 25) integrations/virtual-view/adapter.mjs:10— adapter.validateSnapshotData 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.
snn-csi-processor.main (cyclomatic 25) scripts/snn-csi-processor.js:302— snn-csi-processor.main has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 5 of the 25 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 332, 460, 448). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
CsiSimulator._handleJsonFrame (cyclomatic 25) ui/pose-fusion/js/csi-simulator.js:313— CsiSimulator._handleJsonFrame 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.
AnomalyDetector::process_frame (cyclomatic 24) v2/crates/wifi-densepose-wasm-edge/src/adversarial.rs:75— AnomalyDetector::process_frame has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ForkliftProximityDetector::process_frame (cyclomatic 24) v2/crates/wifi-densepose-wasm-edge/src/ind_forklift_proximity.rs:116— ForkliftProximityDetector::process_frame has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
OccupancyDetector::process_frame (cyclomatic 24) v2/crates/wifi-densepose-wasm-edge/src/occupancy.rs:80— OccupancyDetector::process_frame has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SpikingTracker::process_frame (cyclomatic 24) v2/crates/wifi-densepose-wasm-edge/src/spt_spiking_tracker.rs:135— SpikingTracker::process_frame has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
verify.main (cyclomatic 24) archive/v1/data/proof/verify.py:476— verify.main 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.
collect-ground-truth.main (cyclomatic 24) scripts/collect-ground-truth.py:191— collect-ground-truth.main 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.
provision.main (cyclomatic 24) scripts/provision.py:151— provision.main 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.
apnea-detector.startReplay (cyclomatic 24) scripts/apnea-detector.js:210— apnea-detector.startReplay 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.
train-wiflow-supervised.loadPairedData (cyclomatic 24) scripts/train-wiflow-supervised.js:544— train-wiflow-supervised.loadPairedData has cyclomatic complexity 24 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
listCognitumSpaces (cyclomatic 24) harness/ruview/src/spaces.js:181— listCognitumSpaces has cyclomatic complexity 24 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
add (cyclomatic 24) harness/ruview/src/devices/esp32.js:238— add 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.
overview (cyclomatic 24) harness/ruview/mod/hooks/views.mjs:122— overview has cyclomatic complexity 24 (threshold 15). Of this number, 18 points are the body's own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
TrackManager::ingest_frame (cyclomatic 23) v2/crates/ruview-track/src/manager.rs:283— TrackManager::ingest_frame 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.
wifi_densepose_ruvector::signal::subcarrier::mincut_subcarrier_partition (cyclomatic 23) v2/crates/wifi-densepose-ruvector/src/signal/subcarrier.rs:36— wifi_densepose_ruvector::signal::subcarrier::mincut_subcarrier_partition 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.
WiFlowStdConfig::validate (cyclomatic 23) v2/crates/wifi-densepose-train/src/wiflow_std/config.rs:233— WiFlowStdConfig::validate has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
status._print_text_status (cyclomatic 23) archive/v1/src/commands/status.py:350— status._print_text_status 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.
provision.build_nvs_csv (cyclomatic 23) firmware/esp32-csi-node/provision.py:509— provision.build_nvs_csv has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
process-runner.runProcess (cyclomatic 23) harness/ruview/src/process-runner.js:13— process-runner.runProcess has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 42, 25, 21, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
serial-pump.readSerial (cyclomatic 23) harness/ruview/src/devices/serial-pump.js:47— serial-pump.readSerial has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
train-wiflow-supervised.stoerWagnerMinCut (cyclomatic 23) scripts/train-wiflow-supervised.js:289— train-wiflow-supervised.stoerWagnerMinCut 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.
renderMmwave (cyclomatic 23) harness/ruview/src/cli-ui.js:134— renderMmwave has cyclomatic complexity 23 (threshold 15). Of this number, 20 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ruview_survey::check::check (cyclomatic 22) v2/crates/ruview-survey/src/check.rs:30— ruview_survey::check::check 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.
PhysicsConfig::validate (cyclomatic 22) v2/crates/wifi-densepose-physics/src/config.rs:63— PhysicsConfig::validate has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
RainDetector::process_frame (cyclomatic 22) v2/crates/wifi-densepose-wasm-edge/src/exo_rain_detect.rs:158— RainDetector::process_frame has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ConfinedSpaceMonitor::process_frame (cyclomatic 22) v2/crates/wifi-densepose-wasm-edge/src/ind_confined_space.rs:107— ConfinedSpaceMonitor::process_frame 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.
CustomerFlowTracker::process_frame (cyclomatic 22) v2/crates/wifi-densepose-wasm-edge/src/ret_customer_flow.rs:130— CustomerFlowTracker::process_frame 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.
TemporalLogicGuard::on_frame (cyclomatic 22) v2/crates/wifi-densepose-wasm-edge/src/tmp_temporal_logic_guard.rs:59— TemporalLogicGuard::on_frame 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.
NvGhostMurmur.renderDemo (cyclomatic 22) dashboard/src/components/nv-ghost-murmur.ts:336— NvGhostMurmur.renderDemo has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 9 of the 22 points are its own statements and the rest belongs to one function literal inside it that branches (line 342). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
csi-spectrogram.processFile (cyclomatic 22) scripts/csi-spectrogram.js:427— csi-spectrogram.processFile 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.
device-fingerprint.startReplay (cyclomatic 22) scripts/device-fingerprint.js:609— device-fingerprint.startReplay 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.
MaterialClassifier.classify (cyclomatic 22) scripts/material-classifier.js:180— MaterialClassifier.classify has cyclomatic complexity 22 (threshold 15). Of this number, 21 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
VideoCapture.detectMotionRegion (cyclomatic 22) ui/pose-fusion/js/video-capture.js:133— VideoCapture.detectMotionRegion 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.
Dashboard.Dashboard (cyclomatic 22) v2/crates/wifi-densepose-desktop/ui/src/pages/Dashboard.tsx:28— Dashboard.Dashboard has cyclomatic complexity 22 (threshold 15). Of this number, 17 points are the body's own statements and 5 belong to 3 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
flattenFrames (cyclomatic 22) harness/ruview-kernel/src/abi.js:54— flattenFrames 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.
createLiDARRelay (cyclomatic 22) integrations/iphone-lidar/web/relay.mjs:25— createLiDARRelay has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 2 of the 22 points are its own statements and the rest belongs to 7 function literals inside it that branch (lines 29, 101, 72, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
NpyReader::parse (cyclomatic 21) v2/crates/wifi-densepose-sensing-server/src/dataset.rs:83— NpyReader::parse has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
MatReader::parse_matrix (cyclomatic 21) v2/crates/wifi-densepose-sensing-server/src/dataset.rs:280— MatReader::parse_matrix 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.
LivestockMonitor::process_frame (cyclomatic 21) v2/crates/wifi-densepose-wasm-edge/src/ind_livestock_monitor.rs:142— LivestockMonitor::process_frame 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.
QueueLengthEstimator::process_frame (cyclomatic 21) v2/crates/wifi-densepose-wasm-edge/src/ret_queue_length.rs:120— QueueLengthEstimator::process_frame 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.
VitalTrendAnalyzer::on_timer (cyclomatic 21) v2/crates/wifi-densepose-wasm-edge/src/vital_trend.rs:173— VitalTrendAnalyzer::on_timer 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.
CrvSessionManager::find_convergence (cyclomatic 21) v2/patches/ruvector-crv/src/session.rs:273— CrvSessionManager::find_convergence 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.
prepare_bfi.extract (cyclomatic 21) tools/bfi_learning/prepare_bfi.py:31— prepare_bfi.extract 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.
esphome.isPrivateAddress (cyclomatic 21) harness/ruview/src/devices/esphome.js:107— esphome.isPrivateAddress has cyclomatic complexity 21 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
align-ground-truth.align (cyclomatic 21) scripts/align-ground-truth.js:429— align-ground-truth.align has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
rf-scan-multifreq.computeNullDiversity (cyclomatic 21) scripts/rf-scan-multifreq.js:364— rf-scan-multifreq.computeNullDiversity 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.
rf-scan-multifreq.renderASCII (cyclomatic 21) scripts/rf-scan-multifreq.js:602— rf-scan-multifreq.renderASCII 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.
ThroughWallDetector.ingestFrame (cyclomatic 21) scripts/through-wall-detector.js:192— ThroughWallDetector.ingestFrame has cyclomatic complexity 21 (threshold 15). Of this number, 20 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
http-transport.buildHttpApp.httpServer (cyclomatic 21) REDACTED:220— http-transport.buildHttpApp.httpServer 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 3 function literals inside it that branch (lines 221, 293, 318). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
summarizeEsphome (cyclomatic 21) harness/ruview/src/devices/esphome.js:148— summarizeEsphome has cyclomatic complexity 21 (threshold 15). Most of this is not in the body itself: 9 of the 21 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 171, toCm, values, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
RfTokenizer::tokenize (cyclomatic 20) v2/crates/ruview-unified/src/tokenizer.rs:109— RfTokenizer::tokenize has cyclomatic complexity 20 (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.
GeometryEmbedding::from_nodes (cyclomatic 20) v2/crates/wifi-densepose-calibration/src/geometry_embedding.rs:107— GeometryEmbedding::from_nodes has cyclomatic complexity 20 (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.
ModalityTranslator::apply_attention (cyclomatic 20) v2/crates/wifi-densepose-nn/src/translator.rs:572— ModalityTranslator::apply_attention has cyclomatic complexity 20 (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.
TimeCrystalDetector::process_frame (cyclomatic 20) v2/crates/wifi-densepose-wasm-edge/src/exo_time_crystal.rs:124— TimeCrystalDetector::process_frame 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.
AttractorDetector::process_frame (cyclomatic 20) v2/crates/wifi-densepose-wasm-edge/src/lrn_anomaly_attractor.rs:137— AttractorDetector::process_frame 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.
CardiacArrhythmiaDetector::process_frame (cyclomatic 20) v2/crates/wifi-densepose-wasm-edge/src/med_cardiac_arrhythmia.rs:129— CardiacArrhythmiaDetector::process_frame 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.
TailgateDetector::process_frame (cyclomatic 20) v2/crates/wifi-densepose-wasm-edge/src/sec_tailgating.rs:105— TailgateDetector::process_frame 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.
NvScene.onKey (cyclomatic 20) dashboard/src/components/nv-scene.ts:173— NvScene.onKey has cyclomatic complexity 20 (threshold 15). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
worker.ws.addEventListener("message") (cyclomatic 20) dashboard/src/transport/worker.ts:132— worker.ws.addEventListener("message") has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
benchmark-rf-scan.printReport (cyclomatic 20) scripts/benchmark-rf-scan.js:377— benchmark-rf-scan.printReport has cyclomatic complexity 20 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
gait-analyzer.startReplay (cyclomatic 20) scripts/gait-analyzer.js:404— gait-analyzer.startReplay 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.
GraphAttentionLayer.forward (cyclomatic 20) scripts/mesh-graph-transformer.js:198— GraphAttentionLayer.forward has cyclomatic complexity 20 (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.
mesh-graph-transformer.processFile (cyclomatic 20) scripts/mesh-graph-transformer.js:465— mesh-graph-transformer.processFile 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.
IlluminatorTracker.computeRangeDoppler (cyclomatic 20) scripts/passive-radar.js:133— IlluminatorTracker.computeRangeDoppler has cyclomatic complexity 20 (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.
LiveDemoTab.updateModelUI (cyclomatic 20) ui/components/LiveDemoTab.js:1620— LiveDemoTab.updateModelUI has cyclomatic complexity 20 (threshold 15). Of this number, 18 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
TrainingPanel._renderConfig (cyclomatic 20) ui/components/TrainingPanel.js:238— TrainingPanel._renderConfig has cyclomatic complexity 20 (threshold 15). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 256, 298, 300, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
GaussianSplatRenderer.update (cyclomatic 20) ui/mobile/src/assets/webview/gaussian-splats.html:314— GaussianSplatRenderer.update 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.
Observatory._updateDotMatrixMist (cyclomatic 20) REDACTED:558— Observatory._updateDotMatrixMist has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
api.entityProvenance (cyclomatic 20) v2/crates/homecore-server/ui/js/api.js:129— api.entityProvenance has cyclomatic complexity 20 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
radarView (cyclomatic 20) harness/ruview/mod/hooks/views.mjs:195— radarView has cyclomatic complexity 20 (threshold 15). Of this number, 14 points are the body's own statements and 6 belong to 2 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
homecore_plugins::discovery::discover_plugins (cyclomatic 19) v2/crates/homecore-plugins/src/discovery.rs:58— homecore_plugins::discovery::discover_plugins 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.
DeviceHistory::verdict_at (cyclomatic 19) v2/crates/wifi-densepose-sensing-server/src/mediatek_heuristic.rs:245— DeviceHistory::verdict_at 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.
CleanRoomMonitor::process_frame (cyclomatic 19) v2/crates/wifi-densepose-wasm-edge/src/ind_clean_room.rs:118— CleanRoomMonitor::process_frame 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.
GaitAnalyzer::process_frame (cyclomatic 19) v2/crates/wifi-densepose-wasm-edge/src/med_gait_analysis.rs:158— GaitAnalyzer::process_frame 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.
RespiratoryDistressDetector::process_frame (cyclomatic 19) v2/crates/wifi-densepose-wasm-edge/src/med_respiratory_distress.rs:142— RespiratoryDistressDetector::process_frame 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.
CoherenceGate::process_frame (cyclomatic 19) v2/crates/wifi-densepose-wasm-edge/src/sig_coherence_gate.rs:107— CoherenceGate::process_frame 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.
FlashAttention::process_frame (cyclomatic 19) v2/crates/wifi-densepose-wasm-edge/src/sig_flash_attention.rs:52— FlashAttention::process_frame 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.
SparseRecovery::ista_recover (cyclomatic 19) v2/crates/wifi-densepose-wasm-edge/src/sig_sparse_recovery.rs:206— SparseRecovery::ista_recover 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.
TemporalCompressor::push_frame (cyclomatic 19) v2/crates/wifi-densepose-wasm-edge/src/sig_temporal_compress.rs:72— TemporalCompressor::push_frame 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.
wifi_densepose_wifiscan::adapter::netsh_scanner::parse_netsh_output (cyclomatic 19) v2/crates/wifi-densepose-wifiscan/src/adapter/netsh_scanner.rs:142— wifi_densepose_wifiscan::adapter::netsh_scanner::parse_netsh_output 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.
PoseService.estimate_poses (cyclomatic 19) archive/v1/src/services/pose_service.py:504— PoseService.estimate_poses 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.
rvagent-mcp-consumer.main (cyclomatic 19) scripts/rvagent-mcp-consumer.py:79— rvagent-mcp-consumer.main 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.
training.runTraining (cyclomatic 19) harness/ruview/src/training.js:134— training.runTraining 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.
csi-spectrogram.processLive (cyclomatic 19) scripts/csi-spectrogram.js:543— csi-spectrogram.processLive has cyclomatic complexity 19 (threshold 15). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 552, 635). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
material-classifier.renderFrequencyProfile (cyclomatic 19) scripts/material-classifier.js:374— material-classifier.renderFrequencyProfile has cyclomatic complexity 19 (threshold 15). Of this number, 18 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
through-wall-detector.startReplay (cyclomatic 19) scripts/through-wall-detector.js:503— through-wall-detector.startReplay 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.
WiFiDensePoseApp.cleanup (cyclomatic 19) ui/app.js:443— WiFiDensePoseApp.cleanup has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ConvergenceEngine.update (cyclomatic 19) ui/observatory/js/convergence-engine.js:122— ConvergenceEngine.update 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.
CanvasRenderer.drawEmbeddingSpace::drawPoints (cyclomatic 19) ui/pose-fusion/js/canvas-renderer.js:218— CanvasRenderer.drawEmbeddingSpace::drawPoints 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.
ui.h (cyclomatic 19) v2/crates/homecore-server/ui/js/ui.js:8— ui.h has cyclomatic complexity 19 (threshold 15). Of this number, 17 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
flashFirmware (cyclomatic 19) harness/ruview/src/firmware.js:178— flashFirmware 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.
readMmwave (cyclomatic 19) harness/ruview/src/devices/mmwave.js:149— readMmwave has cyclomatic complexity 19 (threshold 15). Of this number, 17 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.
PlacementParams::validate (cyclomatic 18) v2/crates/ruview-placement/src/coverage.rs:165— PlacementParams::validate has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
BehavioralProfiler::process_frame (cyclomatic 18) v2/crates/wifi-densepose-wasm-edge/src/ais_behavioral_profiler.rs:128— BehavioralProfiler::process_frame 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.
LoiteringDetector::process_frame (cyclomatic 18) v2/crates/wifi-densepose-wasm-edge/src/sec_loitering.rs:86— LoiteringDetector::process_frame 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.
render-readme-visuals.icon (cyclomatic 18) scripts/render-readme-visuals.py:19— render-readme-visuals.icon has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
NvInspector.renderWitnessTab (cyclomatic 18) dashboard/src/components/nv-inspector.ts:339— NvInspector.renderWitnessTab 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.
lidar.depthStats (cyclomatic 18) harness/ruview/src/devices/lidar.js:80— lidar.depthStats has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
eval-wiflow.loadModel (cyclomatic 18) scripts/eval-wiflow.js:123— eval-wiflow.loadModel 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.
RoomFingerprinter.analyze (cyclomatic 18) scripts/room-fingerprint.js:164— RoomFingerprinter.analyze has cyclomatic complexity 18 (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.
room-fingerprint.startReplay (cyclomatic 18) scripts/room-fingerprint.js:321— room-fingerprint.startReplay 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.
HRVAnalyzer.analyze (cyclomatic 18) scripts/stress-monitor.js:123— HRVAnalyzer.analyze has cyclomatic complexity 18 (threshold 15). Of this number, 17 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
PoseDecoder5.trainStep (cyclomatic 18) REDACTED:662— PoseDecoder5.trainStep has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
PoseSystem.generateKeypoints (cyclomatic 18) ui/observatory/js/pose-system.js:17— PoseSystem.generateKeypoints has cyclomatic complexity 18 (threshold 15). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Where every arm is uniform — the same kind of value, with no behaviour of its own — a table keyed by the case is the shorter form; wherever the arms carry different data or different behaviour, keep them as cases, because collapsing those trades an explicit, reviewable set of cases for nothing.
CnnEmbedder._extractJS (cyclomatic 18) ui/pose-fusion/js/cnn-embedder.js:137— CnnEmbedder._extractJS has cyclomatic complexity 18 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
ruvector_attention_wasm.debugString (cyclomatic 18) ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js:1213— ruvector_attention_wasm.debugString 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.
handler (cyclomatic 18) harness/ruview/src/tools.js:258— handler 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.
RfTensor::new (cyclomatic 17) v2/crates/ruview-unified/src/tensor.rs:127— RfTensor::new 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.
wifi_densepose_pointcloud::stream::serve (cyclomatic 17) v2/crates/wifi-densepose-pointcloud/src/stream.rs:33— wifi_densepose_pointcloud::stream::serve 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.
PublishPlanner::on_snapshot (cyclomatic 17) v2/crates/wifi-densepose-sensing-server/src/mqtt/planner/mod.rs:122— PublishPlanner::on_snapshot 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.
PsychoSymbolicEngine::process_frame (cyclomatic 17) v2/crates/wifi-densepose-wasm-edge/src/aut_psycho_symbolic.rs:337— PsychoSymbolicEngine::process_frame 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.
HvacPresenceDetector::process_frame (cyclomatic 17) v2/crates/wifi-densepose-wasm-edge/src/bld_hvac_presence.rs:94— HvacPresenceDetector::process_frame 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.
PatternSequenceAnalyzer::on_timer (cyclomatic 17) v2/crates/wifi-densepose-wasm-edge/src/tmp_pattern_sequence.rs:76— PatternSequenceAnalyzer::on_timer 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.
StageIIIEncoder::encode_element (cyclomatic 17) v2/patches/ruvector-crv/src/stage_iii.rs:41— StageIIIEncoder::encode_element 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.
stream.websocket_events_stream (cyclomatic 17) archive/v1/src/api/routers/stream.py:186— stream.websocket_events_stream has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
run_arms.main (cyclomatic 17) REDACTED:109— run_arms.main 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.
benchmark-model.benchmark_model (cyclomatic 17) scripts/benchmark-model.py:305— benchmark-model.benchmark_model 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.
download_public_bfi.download_file (cyclomatic 17) tools/bfi_learning/download_public_bfi.py:224— download_public_bfi.download_file has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
prepare.public_inventory (cyclomatic 17) tools/bfi_learning/prepare.py:259— prepare.public_inventory has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
train.load_dataset (cyclomatic 17) tools/bfi_learning/train.py:149— train.load_dataset has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
LiDARCaptureManager.makeFrame (cyclomatic 17) integrations/iphone-lidar/native/RuViewLiDAR/LiDARCaptureManager.swift:51— LiDARCaptureManager.makeFrame has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
app.render (cyclomatic 17) docs/rf-diagnostics/app.js:4— app.render has cyclomatic complexity 17 (threshold 15). Of this number, 13 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ApneaDetector.ingest (cyclomatic 17) scripts/apnea-detector.js:82— ApneaDetector.ingest 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.
csi-graph-visualizer.startReplay (cyclomatic 17) scripts/csi-graph-visualizer.js:609— csi-graph-visualizer.startReplay 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.
eval-wiflow.computeMetrics (cyclomatic 17) scripts/eval-wiflow.js:346— eval-wiflow.computeMetrics 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.
eval-wiflow.main (cyclomatic 17) scripts/eval-wiflow.js:534— eval-wiflow.main has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mincut-person-counter.minimumCutPhase (cyclomatic 17) scripts/mincut-person-counter.js:268— mincut-person-counter.minimumCutPhase 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.
rf-scan.renderASCII (cyclomatic 17) scripts/rf-scan.js:412— rf-scan.renderASCII 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.
train-camera-free.augmentData (cyclomatic 17) REDACTED:1447— train-camera-free.augmentData has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
train-ruvllm.augmentData (cyclomatic 17) REDACTED:853— train-ruvllm.augmentData has cyclomatic complexity 17 (threshold 15). Of this number, 14 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
AsymmetricConvBlock.forward (cyclomatic 17) scripts/wiflow-model.js:427— AsymmetricConvBlock.forward has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
PoseService.handlePoseMessage (cyclomatic 17) ui/services/pose.service.js:268— PoseService.handlePoseMessage has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
SensingService._connect (cyclomatic 17) ui/services/sensing.service.js:189— SensingService._connect has cyclomatic complexity 17 (threshold 15). Of this number, 9 points are the body's own statements and 8 belong to 4 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mat-dashboard.html.window.addEventListener("message") (cyclomatic 17) ui/mobile/src/assets/webview/mat-dashboard.html:464— mat-dashboard.html.window.addEventListener("message") has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
DemoDataGenerator._blend (cyclomatic 17) ui/observatory/js/demo-data.js:1765— DemoDataGenerator._blend has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
PoseDecoder.decode (cyclomatic 17) ui/pose-fusion/js/pose-decoder.js:133— PoseDecoder.decode 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.
setupEventHandlers (cyclomatic 17) ui/services/websocket.service.js:150— setupEventHandlers 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 5 function items inside it that branch (onclose, onmessage, onopen, …). 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.
trainingCommand (cyclomatic 17) harness/ruview/src/training.js:96— trainingCommand 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.
connect.open (cyclomatic 17) v2/crates/homecore-server/ui/js/ws.js:24— connect.open has cyclomatic complexity 17 (threshold 15). Most of this is not in the body itself: 2 of the 17 points are its own statements and the rest belongs to 3 function items inside it that branch (onmessage, onclose, onerror). 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.
RfFrameV2::new (cyclomatic 16) v2/crates/ruview-unified/src/frame.rs:212— RfFrameV2::new 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.
SceneGraph::activate (cyclomatic 16) v2/crates/ruview-unified/src/gaussian/graph.rs:116— SceneGraph::activate 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.
MeshGuard::update (cyclomatic 16) v2/crates/wifi-densepose-engine/src/mesh_guard.rs:105— MeshGuard::update 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.
Esp32CsiParser::parse_frame (cyclomatic 16) v2/crates/wifi-densepose-hardware/src/esp32_parser.rs:101— Esp32CsiParser::parse_frame 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.
DensePoseHead::apply_conv_layer (cyclomatic 16) v2/crates/wifi-densepose-nn/src/densepose.rs:326— DensePoseHead::apply_conv_layer has cyclomatic complexity 16 (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.
AppStateInner::effective_source (cyclomatic 16) v2/crates/wifi-densepose-sensing-server/src/main.rs:2901— AppStateInner::effective_source 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.
PossibleDistress::tick (cyclomatic 16) v2/crates/wifi-densepose-sensing-server/src/semantic/distress.rs:61— PossibleDistress::tick 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.
VitalAnomalyDetector::check (cyclomatic 16) v2/crates/wifi-densepose-vitals/src/anomaly.rs:121— VitalAnomalyDetector::check 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.
OptimalTransportDetector::process_frame (cyclomatic 16) v2/crates/wifi-densepose-wasm-edge/src/sig_optimal_transport.rs:131— OptimalTransportDetector::process_frame 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.
GoapPlanner::plan_for_goal (cyclomatic 16) v2/crates/wifi-densepose-wasm-edge/src/tmp_goap_autonomy.rs:167— GoapPlanner::plan_for_goal 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.
stream.websocket_pose_stream (cyclomatic 16) archive/v1/src/api/routers/stream.py:70— stream.websocket_pose_stream has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
run_trial_linux.verify_link (cyclomatic 16) tools/bfi/run_trial_linux.py:58— run_trial_linux.verify_link 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.
codex_iteration.audit_events (cyclomatic 16) tools/bfi_learning/codex_iteration.py:163— codex_iteration.audit_events 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.
remote.validateHost (cyclomatic 16) harness/ruview/src/remote.js:24— remote.validateHost 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.
remote.runRemote (cyclomatic 16) harness/ruview/src/remote.js:110— remote.runRemote 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.
NodeStats.summary (cyclomatic 16) harness/ruview/src/devices/esp32.js:275— NodeStats.summary has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 278, 277, 282, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
mmwave.decodeMr60 (cyclomatic 16) harness/ruview/src/devices/mmwave.js:54— mmwave.decodeMr60 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.
cli.mcp (cyclomatic 16) harness/ruview/src/cli.js:135— cli.mcp 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.
raster.lineChart (cyclomatic 16) harness/ruview/mod/hooks/raster.mjs:232— raster.lineChart has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
benchmark-ruvllm.quantizeWeights (cyclomatic 16) REDACTED:186— benchmark-ruvllm.quantizeWeights 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.
csi-graph-visualizer.renderSpectrum (cyclomatic 16) scripts/csi-graph-visualizer.js:366— csi-graph-visualizer.renderSpectrum 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.
mincut-person-counter.stoerWagner (cyclomatic 16) scripts/mincut-person-counter.js:328— mincut-person-counter.stoerWagner 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.
passive-radar.startReplay (cyclomatic 16) scripts/passive-radar.js:588— passive-radar.startReplay 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.
train-camera-free.quantizeWeights (cyclomatic 16) REDACTED:1364— train-camera-free.quantizeWeights 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.
train-ruvllm.quantizeWeights (cyclomatic 16) REDACTED:678— train-ruvllm.quantizeWeights 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.
train-wiflow.quantizeWeights (cyclomatic 16) REDACTED:384— train-wiflow.quantizeWeights 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.
AxialAttention.forward (cyclomatic 16) scripts/wiflow-model.js:614— AxialAttention.forward has cyclomatic complexity 16 (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.
SensingTab._updateHUD (cyclomatic 16) ui/components/SensingTab.js:244— SensingTab._updateHUD has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
DemoDataGenerator._twoWalking (cyclomatic 16) ui/observatory/js/demo-data.js:362— DemoDataGenerator._twoWalking 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.
DataProcessor._extractPersons (cyclomatic 16) ui/services/data-processor.js:68— DataProcessor._extractPersons has cyclomatic complexity 16 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
NetworkDiscovery.NodeDetailModal (cyclomatic 16) v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:1062— NetworkDiscovery.NodeDetailModal has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
captureEsp32::(anonymous)::finish (cyclomatic 16) harness/ruview/src/devices/esp32.js:431— captureEsp32::(anonymous)::finish 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.
automationBuilder (cyclomatic 16) v2/crates/homecore-server/ui/js/panels/events.js:176— automationBuilder has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 188, paintTriggerExtra, buildTrigger, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
TodoComment archive/v1/src/api/middleware/auth.py:227— # TODO: Wire up authentication event logging in dispatch() for — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
runDoctor (cognitive 224) harness/ruview/src/doctor.js:63— runDoctor has cognitive complexity 224 (threshold 15). Drivers by points: ternaries 52 (139 pts), if/else 31 (47 pts), error handling 6 (16 pts), boolean chains 13, loops 4 (9 pts) (nesting depth added 118). Of this number, 222 points are the body's own statements and 2 belong to 11 function items inside it that branch. 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.
train-camera-free.main (cognitive 173) REDACTED:1703— train-camera-free.main has cognitive complexity 173 (threshold 15). Drivers by points: loops 38 (77 pts), if/else 38 (76 pts), boolean chains 9, ternaries 7, error handling 2 (4 pts) (nesting depth added 79). Of this number, 171 points are the body's own statements and 2 belong to 2 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli.run (cognitive 154) harness/ruview/src/cli.js:243— cli.run has cognitive complexity 154 (threshold 15). Drivers by points: if/else 35 (77 pts), ternaries 13 (34 pts), boolean chains 26, error handling 5 (14 pts), loops 1 (2 pts), match/switch 1 (nesting depth added 73). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GaussianSplatWebView.web.GaussianSplatWebViewWeb (cognitive 144) ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx:277— GaussianSplatWebView.web.GaussianSplatWebViewWeb has cognitive complexity 144 (threshold 15). Drivers by points: if/else 42 (108 pts), loops 11 (17 pts), boolean chains 13, ternaries 3 (5 pts), error handling 1 (nesting depth added 74). None of this is in the body itself: all 144 points belong to 11 function literals inside it that branch (lines 447, 298, 288, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
benchmark-ruvllm.main (cognitive 124) REDACTED:277— benchmark-ruvllm.main has cognitive complexity 124 (threshold 15). Drivers by points: if/else 36 (62 pts), loops 14 (21 pts), boolean chains 17, ternaries 8 (17 pts), error handling 3 (7 pts) (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-wiflow.main (cognitive 119) REDACTED:483— train-wiflow.main has cognitive complexity 119 (threshold 15). Drivers by points: loops 23 (58 pts), if/else 23 (51 pts), boolean chains 9, ternaries 1 (nesting depth added 63). Of this number, 115 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
benchmark-rf-scan.computeMetrics (cognitive 113) scripts/benchmark-rf-scan.js:163— benchmark-rf-scan.computeMetrics has cognitive complexity 113 (threshold 15). Drivers by points: loops 21 (58 pts), if/else 10 (34 pts), ternaries 7 (19 pts), boolean chains 2 (nesting depth added 73). 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.
train-ruvllm.main (cognitive 101) REDACTED:1025— train-ruvllm.main has cognitive complexity 101 (threshold 15). Drivers by points: if/else 25 (49 pts), loops 23 (39 pts), boolean chains 6, ternaries 3 (5 pts), error handling 1 (2 pts) (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-camera-free.generateWeakLabels (cognitive 100) REDACTED:915— train-camera-free.generateWeakLabels has cognitive complexity 100 (threshold 15). Drivers by points: if/else 39 (53 pts), boolean chains 25, loops 8 (17 pts), ternaries 2 (5 pts) (nesting depth added 26). Of this number, 95 points are the body's own statements and 5 belong to 5 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
validate_qemu_output.validate_log (cognitive 98) scripts/validate_qemu_output.py:123— validate_qemu_output.validate_log has cognitive complexity 98 (threshold 15). Drivers by points: if/else 57 (77 pts), error handling 2 (10 pts), loops 6 (9 pts), boolean chains 2 (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.
qemu_swarm.run_assertions (cognitive 97) scripts/qemu_swarm.py:544— qemu_swarm.run_assertions has cognitive complexity 97 (threshold 15). Drivers by points: if/else 23 (68 pts), loops 7 (17 pts), ternaries 5 (11 pts), boolean chains 1 (nesting depth added 61). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-ruvllm.generateTriplets (cognitive 91) REDACTED:467— train-ruvllm.generateTriplets has cognitive complexity 91 (threshold 15). Drivers by points: if/else 16 (50 pts), loops 17 (34 pts), boolean chains 7 (nesting depth added 51). Of this number, 86 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
provision.main (cognitive 86) firmware/esp32-csi-node/provision.py:649— provision.main has cognitive complexity 86 (threshold 15). Drivers by points: if/else 48 (59 pts), ternaries 5 (10 pts), boolean chains 9, error handling 4 (6 pts), loops 1 (2 pts) (nesting depth added 19). 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.
cli.run (cognitive 85) harness/homecore/bin/cli.js:103— cli.run has cognitive complexity 85 (threshold 15). Drivers by points: ternaries 17 (38 pts), if/else 17 (35 pts), boolean chains 9, error handling 1 (2 pts), match/switch 1 (nesting depth added 40). 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.
train-camera-free.generateTriplets (cognitive 85) REDACTED:1153— train-camera-free.generateTriplets has cognitive complexity 85 (threshold 15). Drivers by points: if/else 14 (46 pts), loops 15 (32 pts), boolean chains 7 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-count.main (cognitive 83) scripts/train-count.py:170— train-count.main has cognitive complexity 83 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 13 (28 pts), ternaries 7 (12 pts), error handling 2 (3 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SurvivorTracker::update (cognitive 82) v2/crates/wifi-densepose-mat/src/tracking/tracker.rs:173— SurvivorTracker::update has cognitive complexity 82 (threshold 15). Drivers by points: if/else 26 (62 pts), loops 12 (14 pts), boolean chains 5, match/switch 1 (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.
deep-scan.report (cognitive 82) scripts/deep-scan.js:76— deep-scan.report has cognitive complexity 82 (threshold 15). Drivers by points: ternaries 14 (35 pts), loops 16 (27 pts), if/else 12 (18 pts), boolean chains 2 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-wiflow-supervised.main (cognitive 80) scripts/train-wiflow-supervised.js:1203— train-wiflow-supervised.main has cognitive complexity 80 (threshold 15). Drivers by points: loops 18 (45 pts), if/else 13 (23 pts), ternaries 3 (8 pts), boolean chains 4 (nesting depth added 42). Of this number, 72 points are the body's own statements and 8 belong to 3 function items inside it that branch. To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SeizureDetector::process_frame (cognitive 78) v2/crates/wifi-densepose-wasm-edge/src/med_seizure_detect.rs:171— SeizureDetector::process_frame has cognitive complexity 78 (threshold 15). Drivers by points: if/else 30 (71 pts), boolean chains 6, match/switch 1 (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
c6-presence-watcher.main (cognitive 76) scripts/c6-presence-watcher.py:192— c6-presence-watcher.main has cognitive complexity 76 (threshold 15). Drivers by points: if/else 14 (52 pts), boolean chains 9, loops 2 (7 pts), ternaries 2 (6 pts), error handling 1 (2 pts) (nesting depth added 48). 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.
Connection::handle_cmd (cognitive 75) v2/crates/homecore-api/src/ws.rs:241— Connection::handle_cmd has cognitive complexity 75 (threshold 15). Drivers by points: if/else 16 (52 pts), match/switch 6 (16 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 48). 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.
_intrusionDetect (cognitive 75) ui/observatory/js/demo-data.js:715— _intrusionDetect has cognitive complexity 75 (threshold 15). Drivers by points: ternaries 44 (53 pts), boolean chains 12, if/else 8 (9 pts), loops 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
DemoDataGenerator._searchRescue (cognitive 74) ui/observatory/js/demo-data.js:1121— DemoDataGenerator._searchRescue has cognitive complexity 74 (threshold 15). Drivers by points: ternaries 30 (46 pts), boolean chains 15, if/else 10, loops 2 (3 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.
TableTurnoverTracker::process_frame (cognitive 71) v2/crates/wifi-densepose-wasm-edge/src/ret_table_turnover.rs:137— TableTurnoverTracker::process_frame has cognitive complexity 71 (threshold 15). Drivers by points: if/else 28 (67 pts), boolean chains 3, match/switch 1 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CrvSessionManager::find_convergence (cognitive 71) v2/patches/ruvector-crv/src/session.rs:273— CrvSessionManager::find_convergence has cognitive complexity 71 (threshold 15). Drivers by points: if/else 11 (41 pts), loops 9 (28 pts), boolean chains 2 (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
parseSpacesOutput (cognitive 71) harness/ruview/src/spaces.js:80— parseSpacesOutput has cognitive complexity 71 (threshold 15). Drivers by points: if/else 19 (34 pts), boolean chains 30, loops 2, other 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DemoDataGenerator._fallEvent (cognitive 70) ui/observatory/js/demo-data.js:444— DemoDataGenerator._fallEvent has cognitive complexity 70 (threshold 15). Drivers by points: ternaries 32 (50 pts), boolean chains 10, if/else 9, 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.
csi-graph-visualizer.stoerWagner (cognitive 69) scripts/csi-graph-visualizer.js:221— csi-graph-visualizer.stoerWagner has cognitive complexity 69 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 10 (23 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
material-detector.startReplay (cognitive 67) scripts/material-detector.js:317— material-detector.startReplay has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (40 pts), loops 7 (17 pts), ternaries 1 (5 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
render (cognitive 67) v2/crates/homecore-server/ui/js/panels/calibration.js:8— render has cognitive complexity 67 (threshold 15). Drivers by points: if/else 22 (25 pts), boolean chains 21, ternaries 14, error handling 7 (nesting depth added 3). Most of this is not in the body itself: 1 of the 67 points is its own statement and the rest belongs to 34 function items inside it that branch (step2::startCapture::(anonymous)::loop, a function literal at line 180, a function literal at line 207, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
LightingZoneController::process_frame (cognitive 65) v2/crates/wifi-densepose-wasm-edge/src/bld_lighting_zones.rs:121— LightingZoneController::process_frame has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (44 pts), loops 8 (14 pts), match/switch 2 (4 pts), boolean chains 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OtaUpdate.OtaUpdate (cognitive 63) v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:38— OtaUpdate.OtaUpdate has cognitive complexity 63 (threshold 15). Drivers by points: ternaries 14 (25 pts), boolean chains 24, if/else 10, error handling 4 (nesting depth added 11). Of this number, 35 points are the body's own statements and 28 belong to 10 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.
readEsphome (cognitive 63) harness/ruview/src/devices/esphome.js:182— readEsphome has cognitive complexity 63 (threshold 15). Drivers by points: if/else 12 (21 pts), ternaries 6 (19 pts), boolean chains 14, error handling 3 (4 pts), match/switch 1 (2 pts), other 2, loops 1 (nesting depth added 24). Most of this is not in the body itself: 5 of the 63 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 225, a function literal at line 224, (anonymous)::finish, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
MeshView.MeshView (cognitive 60) v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:143— MeshView.MeshView has cognitive complexity 60 (threshold 15). Drivers by points: if/else 23 (36 pts), loops 8 (9 pts), boolean chains 7, ternaries 6 (7 pts), error handling 1 (nesting depth added 15). Most of this is not in the body itself: 9 of the 60 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 222, 369, 283, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
register (cognitive 59) harness/ruview/mod/hooks/register.mjs:49— register has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (28 pts), error handling 6 (11 pts), boolean chains 7, ternaries 6, other 4, loops 3 (nesting depth added 9). None of this is in the body itself: all 59 points belong to 41 function items inside it that branch (a function literal at line 192, animate, setMode, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
GestureLearner::process_frame (cognitive 58) v2/crates/wifi-densepose-wasm-edge/src/lrn_dtw_gesture_learn.rs:148— GestureLearner::process_frame has cognitive complexity 58 (threshold 15). Drivers by points: if/else 22 (44 pts), loops 4 (10 pts), boolean chains 3, match/switch 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
status._print_text_status (cognitive 58) archive/v1/src/commands/status.py:350— status._print_text_status has cognitive complexity 58 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 4 (15 pts), ternaries 5 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DensePoseHead::apply_conv_layer (cognitive 57) v2/crates/wifi-densepose-nn/src/densepose.rs:326— DensePoseHead::apply_conv_layer has cognitive complexity 57 (threshold 15). Drivers by points: loops 11 (42 pts), if/else 3 (14 pts), boolean chains 1 (nesting depth added 42). 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.
drawSkeleton (cognitive 57) ui/pose-fusion/js/canvas-renderer.js:33— drawSkeleton has cognitive complexity 57 (threshold 15). Drivers by points: ternaries 17 (31 pts), boolean chains 16, if/else 5 (8 pts), loops 2 (nesting depth added 17). Of this number, 56 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
config_push.main (cognitive 55) REDACTED:92— config_push.main has cognitive complexity 55 (threshold 15). Drivers by points: if/else 19 (31 pts), ternaries 4 (9 pts), loops 5 (8 pts), boolean chains 6, error handling 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.
DemoDataGenerator._securityPatrol (cognitive 55) ui/observatory/js/demo-data.js:1521— DemoDataGenerator._securityPatrol has cognitive complexity 55 (threshold 15). Drivers by points: ternaries 24 (36 pts), if/else 11 (12 pts), boolean chains 5, loops 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.
IntrusionDetector::process_frame (cognitive 54) v2/crates/wifi-densepose-wasm-edge/src/intrusion.rs:109— IntrusionDetector::process_frame has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (38 pts), loops 6 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli-ui.renderCapture (cognitive 54) harness/ruview/src/cli-ui.js:66— cli-ui.renderCapture has cognitive complexity 54 (threshold 15). Drivers by points: ternaries 9 (27 pts), boolean chains 18, if/else 5 (6 pts), loops 2 (3 pts) (nesting depth added 20). Of this number, 53 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BreathingSyncDetector::process_frame (cognitive 53) v2/crates/wifi-densepose-wasm-edge/src/exo_breathing_sync.rs:200— BreathingSyncDetector::process_frame has cognitive complexity 53 (threshold 15). Drivers by points: if/else 28 (39 pts), loops 6 (9 pts), boolean chains 5 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
benchmark-wiflow.main (cognitive 53) scripts/benchmark-wiflow.js:73— benchmark-wiflow.main has cognitive complexity 53 (threshold 15). Drivers by points: loops 22 (35 pts), if/else 6 (11 pts), ternaries 3 (6 pts), boolean chains 1 (nesting depth added 21). 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.
parsePacket (cognitive 53) harness/ruview/src/devices/esp32.js:111— parsePacket has cognitive complexity 53 (threshold 15). Drivers by points: if/else 23 (34 pts), ternaries 5 (10 pts), boolean chains 9 (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.
PlantGrowthDetector::process_frame (cognitive 52) v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs:173— PlantGrowthDetector::process_frame has cognitive complexity 52 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 9 (15 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.
DwellHeatmapTracker::process_frame (cognitive 52) v2/crates/wifi-densepose-wasm-edge/src/ret_dwell_heatmap.rs:119— DwellHeatmapTracker::process_frame has cognitive complexity 52 (threshold 15). Drivers by points: if/else 19 (32 pts), boolean chains 10, loops 5 (10 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.
AxialAttention.forward (cognitive 52) scripts/wiflow-model.js:614— AxialAttention.forward has cognitive complexity 52 (threshold 15). Drivers by points: loops 12 (42 pts), if/else 4 (10 pts) (nesting depth added 36). 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.
REDACTED.handleData (cognitive 52) REDACTED:553— REDACTED.handleData has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (40 pts), boolean chains 9, ternaries 1 (2 pts), error handling 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.
_extractWithAttention (cognitive 52) ui/pose-fusion/js/cnn-embedder.js:220— _extractWithAttention has cognitive complexity 52 (threshold 15). Drivers by points: loops 20 (34 pts), error handling 8 (10 pts), if/else 2 (4 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 19). 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.
PerimeterBreachDetector::process_frame (cognitive 51) v2/crates/wifi-densepose-wasm-edge/src/sec_perimeter_breach.rs:143— PerimeterBreachDetector::process_frame has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (33 pts), loops 7 (13 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
apnea-detector.startReplay (cognitive 51) scripts/apnea-detector.js:210— apnea-detector.startReplay has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 5 (13 pts), ternaries 3 (10 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AsymmetricConvBlock.forward (cognitive 51) scripts/wiflow-model.js:427— AsymmetricConvBlock.forward has cognitive complexity 51 (threshold 15). Drivers by points: loops 12 (38 pts), if/else 4 (12 pts), boolean chains 1 (nesting depth added 34). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
RfTokenizer::tokenize (cognitive 50) v2/crates/ruview-unified/src/tokenizer.rs:109— RfTokenizer::tokenize has cognitive complexity 50 (threshold 15). Drivers by points: loops 17 (43 pts), if/else 3 (7 pts) (nesting depth added 30). 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.
SpikingTracker::process_frame (cognitive 50) v2/crates/wifi-densepose-wasm-edge/src/spt_spiking_tracker.rs:135— SpikingTracker::process_frame has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (37 pts), loops 9 (12 pts), boolean chains 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train.run (cognitive 50) tools/bfi_learning/train.py:515— train.run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (19 pts), ternaries 15 (18 pts), boolean chains 8, loops 3 (4 pts), error handling 1 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
DemoDataGenerator._elderlyCare (cognitive 50) ui/observatory/js/demo-data.js:1247— DemoDataGenerator._elderlyCare has cognitive complexity 50 (threshold 15). Drivers by points: ternaries 23 (31 pts), if/else 12, boolean chains 6, loops 1 (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.
BehavioralProfiler::process_frame (cognitive 49) v2/crates/wifi-densepose-wasm-edge/src/ais_behavioral_profiler.rs:128— BehavioralProfiler::process_frame has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 3 (9 pts), boolean chains 3 (nesting depth added 31). 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.
PromptShield::process_frame (cognitive 49) v2/crates/wifi-densepose-wasm-edge/src/ais_prompt_shield.rs:68— PromptShield::process_frame has cognitive complexity 49 (threshold 15). Drivers by points: if/else 23 (34 pts), loops 5 (8 pts), boolean chains 7 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-wiflow-supervised.stoerWagnerMinCut (cognitive 49) scripts/train-wiflow-supervised.js:289— train-wiflow-supervised.stoerWagnerMinCut has cognitive complexity 49 (threshold 15). Drivers by points: if/else 7 (23 pts), loops 9 (21 pts), boolean chains 5 (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.
EdgeModules.EdgeModules (cognitive 49) v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:602— EdgeModules.EdgeModules has cognitive complexity 49 (threshold 15). Drivers by points: ternaries 13 (18 pts), boolean chains 15, if/else 9, error handling 7 (nesting depth added 5). Of this number, 16 points are the body's own statements and 33 belong to 10 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
bfi_decode.analyze (cognitive 48) tools/bfi/bfi_decode.py:229— bfi_decode.analyze has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 12 (15 pts), boolean chains 6, error handling 1 (2 pts), loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ElevatorCounter::process_frame (cognitive 47) v2/crates/wifi-densepose-wasm-edge/src/bld_elevator_count.rs:126— ElevatorCounter::process_frame has cognitive complexity 47 (threshold 15). Drivers by points: if/else 27 (37 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GaussianSplatRenderer.update (cognitive 47) ui/components/gaussian-splats.js:305— GaussianSplatRenderer.update has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (24 pts), boolean chains 13, loops 4 (10 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.
captureEsp32 (cognitive 47) harness/ruview/src/devices/esp32.js:406— captureEsp32 has cognitive complexity 47 (threshold 15). Drivers by points: if/else 17 (19 pts), boolean chains 13, other 7, ternaries 5, error handling 2 (3 pts) (nesting depth added 3). Of this number, 19 points are the body's own statements and 28 belong to 8 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
GaitAnalyzer.analyze (cognitive 46) scripts/gait-analyzer.js:125— GaitAnalyzer.analyze has cognitive complexity 46 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 6 (10 pts), ternaries 4 (8 pts), boolean chains 4 (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.
GraphAttentionLayer.forward (cognitive 46) scripts/mesh-graph-transformer.js:198— GraphAttentionLayer.forward has cognitive complexity 46 (threshold 15). Drivers by points: loops 12 (31 pts), if/else 4 (9 pts), ternaries 1 (4 pts), boolean chains 2 (nesting depth added 27). 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.
NetworkDiscovery.NetworkDiscovery (cognitive 46) v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:43— NetworkDiscovery.NetworkDiscovery has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 28, ternaries 5 (9 pts), if/else 5, error handling 4 (nesting depth added 4). Of this number, 25 points are the body's own statements and 21 belong to 9 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
OccupancyDetector::process_frame (cognitive 45) v2/crates/wifi-densepose-wasm-edge/src/occupancy.rs:80— OccupancyDetector::process_frame has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (29 pts), loops 8 (14 pts), boolean chains 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
verify.main (cognitive 45) archive/v1/data/proof/verify.py:476— verify.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (27 pts), loops 3 (9 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
policy.validateArguments (cognitive 45) REDACTED:36— policy.validateArguments has cognitive complexity 45 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 11, loops 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
csi-spectrogram.processFile (cognitive 45) scripts/csi-spectrogram.js:427— csi-spectrogram.processFile has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (31 pts), boolean chains 7, error handling 2 (6 pts), loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DemoDataGenerator._fitnessTracking (cognitive 45) ui/observatory/js/demo-data.js:1387— DemoDataGenerator._fitnessTracking has cognitive complexity 45 (threshold 15). Drivers by points: ternaries 21 (35 pts), if/else 7, boolean chains 2, 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.
model.validate (cognitive 44) docs/rf-diagnostics/model.js:6— model.validate has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 18, loops 4 (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.
update (cognitive 44) ui/observatory/js/scenario-props.js:649— update has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (19 pts), boolean chains 12, ternaries 4 (7 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PhysicsEngine::process_with_context (cognitive 43) v2/crates/wifi-densepose-physics/src/engine.rs:206— PhysicsEngine::process_with_context has cognitive complexity 43 (threshold 15). Drivers by points: if/else 26 (33 pts), boolean chains 6, match/switch 2 (4 pts) (nesting depth added 9). 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.
LoiteringDetector::process_frame (cognitive 43) v2/crates/wifi-densepose-wasm-edge/src/sec_loitering.rs:86— LoiteringDetector::process_frame has cognitive complexity 43 (threshold 15). Drivers by points: if/else 16 (41 pts), boolean chains 1, match/switch 1 (nesting depth added 25). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
collect-ground-truth.main (cognitive 42) scripts/collect-ground-truth.py:191— collect-ground-truth.main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 18 (29 pts), ternaries 3 (6 pts), loops 2 (4 pts), error handling 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.
train.build_splits (cognitive 42) tools/bfi_learning/train.py:220— train.build_splits has cognitive complexity 42 (threshold 15). Drivers by points: loops 9 (20 pts), boolean chains 10, if/else 6 (10 pts), ternaries 1 (2 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
policy.validateArguments (cognitive 42) harness/homecore/src/policy.js:25— policy.validateArguments has cognitive complexity 42 (threshold 15). Drivers by points: if/else 15 (28 pts), boolean chains 10, loops 2 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TrackManager::ingest_frame (cognitive 41) v2/crates/ruview-track/src/manager.rs:283— TrackManager::ingest_frame has cognitive complexity 41 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 6 (9 pts), boolean chains 4 (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.
quality_report.analyze (cognitive 41) tools/bfi/quality_report.py:131— quality_report.analyze has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (27 pts), boolean chains 6, ternaries 4, error handling 1 (2 pts), loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TailgateDetector::process_frame (cognitive 40) v2/crates/wifi-densepose-wasm-edge/src/sec_tailgating.rs:105— TailgateDetector::process_frame has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 4, match/switch 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
esp32_jsonl_to_rvcsi.main (cognitive 40) scripts/esp32_jsonl_to_rvcsi.py:59— esp32_jsonl_to_rvcsi.main has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 8, loops 2 (3 pts), error handling 1 (2 pts), ternaries 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.
seed_csi_bridge.run_bridge (cognitive 40) scripts/seed_csi_bridge.py:367— seed_csi_bridge.run_bridge has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (27 pts), error handling 5 (7 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NullPatternTracker.detectChanges (cognitive 40) scripts/material-detector.js:110— NullPatternTracker.detectChanges has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (27 pts), loops 6 (7 pts), boolean chains 4, ternaries 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.
room-fingerprint.startReplay (cognitive 40) scripts/room-fingerprint.js:321— room-fingerprint.startReplay has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (23 pts), ternaries 3 (11 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (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.
through-wall-detector.startReplay (cognitive 40) scripts/through-wall-detector.js:503— through-wall-detector.startReplay has cognitive complexity 40 (threshold 15). Drivers by points: if/else 11 (23 pts), ternaries 3 (11 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (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.
startMcpServer (cognitive 40) harness/homecore/src/mcp-server.js:143— startMcpServer has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (22 pts), ternaries 6 (11 pts), boolean chains 3, error handling 2, loops 1, other 1 (nesting depth added 11). Most of this is not in the body itself: 3 of the 40 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 251, (anonymous)::acceptLine, a function literal at line 169, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
AnomalyDetector::process_frame (cognitive 39) v2/crates/wifi-densepose-wasm-edge/src/adversarial.rs:75— AnomalyDetector::process_frame has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (20 pts), loops 8 (16 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MeetingRoomTracker::process_frame (cognitive 39) v2/crates/wifi-densepose-wasm-edge/src/bld_meeting_room.rs:101— MeetingRoomTracker::process_frame has cognitive complexity 39 (threshold 15). Drivers by points: if/else 18 (33 pts), boolean chains 5, match/switch 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SparseRecovery::ista_recover (cognitive 39) v2/crates/wifi-densepose-wasm-edge/src/sig_sparse_recovery.rs:206— SparseRecovery::ista_recover has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (27 pts), loops 8 (12 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.
benchmark_bfi.synthetic_bodies (cognitive 39) tools/bfi/benchmark_bfi.py:51— benchmark_bfi.synthetic_bodies has cognitive complexity 39 (threshold 15). Drivers by points: ternaries 6 (29 pts), loops 4 (10 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.
training.trainingGate (cognitive 39) harness/ruview/src/training.js:29— training.trainingGate has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (19 pts), ternaries 8 (12 pts), boolean chains 8 (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.
resolveBundle (cognitive 39) harness/ruview/src/firmware.js:78— resolveBundle has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (25 pts), boolean chains 6, ternaries 2 (4 pts), other 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TrainingConfig::validate (cognitive 38) v2/crates/wifi-densepose-train/src/config.rs:364— TrainingConfig::validate has cognitive complexity 38 (threshold 15). Drivers by points: if/else 33 (35 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
GhostHunterDetector::process_frame (cognitive 38) v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:201— GhostHunterDetector::process_frame has cognitive complexity 38 (threshold 15). Drivers by points: if/else 25 (29 pts), loops 5 (6 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
ShelfEngagementDetector::process_frame (cognitive 38) v2/crates/wifi-densepose-wasm-edge/src/ret_shelf_engagement.rs:166— ShelfEngagementDetector::process_frame has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (21 pts), loops 4 (8 pts), boolean chains 6, match/switch 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
run_trial_linux.main (cognitive 38) tools/bfi/run_trial_linux.py:212— run_trial_linux.main has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 8, error handling 5 (6 pts), loops 5, ternaries 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
rf-scan-multifreq.computeNullDiversity (cognitive 38) scripts/rf-scan-multifreq.js:364— rf-scan-multifreq.computeNullDiversity has cognitive complexity 38 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 10 (17 pts), ternaries 3 (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.
rf-scan-multifreq.renderASCII (cognitive 38) scripts/rf-scan-multifreq.js:602— rf-scan-multifreq.renderASCII has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (12 pts), loops 5 (10 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-camera-free.collectMultiModalData (cognitive 38) REDACTED:779— train-camera-free.collectMultiModalData has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (22 pts), boolean chains 8, loops 5 (8 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.
VideoCapture.detectMotionRegion (cognitive 38) ui/pose-fusion/js/video-capture.js:133— VideoCapture.detectMotionRegion has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 5, loops 2 (3 pts), ternaries 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.
ruview_cognitum_spaces::decode_spatial (cognitive 37) v2/crates/ruview-cognitum-spaces/src/lib.rs:467— ruview_cognitum_spaces::decode_spatial has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 16, 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.
wifi_densepose_ruvector::signal::subcarrier::mincut_subcarrier_partition (cognitive 37) v2/crates/wifi-densepose-ruvector/src/signal/subcarrier.rs:36— wifi_densepose_ruvector::signal::subcarrier::mincut_subcarrier_partition has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (26 pts), loops 5 (6 pts), boolean chains 4, match/switch 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ForkliftProximityDetector::process_frame (cognitive 37) v2/crates/wifi-densepose-wasm-edge/src/ind_forklift_proximity.rs:116— ForkliftProximityDetector::process_frame has cognitive complexity 37 (threshold 15). Drivers by points: if/else 16 (24 pts), boolean chains 7, loops 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WeaponDetector::process_frame (cognitive 37) v2/crates/wifi-densepose-wasm-edge/src/sec_weapon_detect.rs:126— WeaponDetector::process_frame has cognitive complexity 37 (threshold 15). Drivers by points: if/else 18 (23 pts), loops 5 (10 pts), boolean chains 4 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
capture_linux.main (cognitive 37) tools/bfi/capture_linux.py:129— capture_linux.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 7, ternaries 6, error handling 3 (4 pts), loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
mesh-graph-transformer.processFile (cognitive 37) scripts/mesh-graph-transformer.js:465— mesh-graph-transformer.processFile has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 7, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
_gestureControl (cognitive 37) ui/observatory/js/demo-data.js:852— _gestureControl has cognitive complexity 37 (threshold 15). Drivers by points: ternaries 13 (22 pts), if/else 6 (9 pts), boolean chains 3, match/switch 1 (2 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mainLoop (cognitive 37) REDACTED:240— mainLoop has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 4 (10 pts), boolean chains 8, error handling 1, other 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.
SynthGenerator::generate (cognitive 36) v2/crates/ruview-unified/src/synth/generator.rs:96— SynthGenerator::generate has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 5 (15 pts), boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PsychoSymbolicEngine::process_frame (cognitive 36) v2/crates/wifi-densepose-wasm-edge/src/aut_psycho_symbolic.rs:337— PsychoSymbolicEngine::process_frame has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (31 pts), boolean chains 3, loops 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.
ConfinedSpaceMonitor::process_frame (cognitive 36) v2/crates/wifi-densepose-wasm-edge/src/ind_confined_space.rs:107— ConfinedSpaceMonitor::process_frame has cognitive complexity 36 (threshold 15). Drivers by points: if/else 18 (30 pts), boolean chains 6 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PatternSequenceAnalyzer::on_timer (cognitive 36) v2/crates/wifi-densepose-wasm-edge/src/tmp_pattern_sequence.rs:76— PatternSequenceAnalyzer::on_timer has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 3 (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
run_arms.main (cognitive 36) REDACTED:109— run_arms.main has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 4 (14 pts), if/else 4 (11 pts), loops 3 (6 pts), boolean chains 5 (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.
gait-analyzer.startReplay (cognitive 36) scripts/gait-analyzer.js:404— gait-analyzer.startReplay has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 3 (5 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-wiflow-supervised.loadPairedData (cognitive 36) scripts/train-wiflow-supervised.js:544— train-wiflow-supervised.loadPairedData has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 4 (11 pts), boolean chains 9, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DemoDataGenerator._crowdOccupancy (cognitive 36) ui/observatory/js/demo-data.js:969— DemoDataGenerator._crowdOccupancy has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 11 (15 pts), loops 5 (10 pts), if/else 5 (6 pts), boolean chains 5 (nesting depth added 10). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Sensing.Sensing (cognitive 36) v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx:300— Sensing.Sensing has cognitive complexity 36 (threshold 15). Drivers by points: ternaries 16 (22 pts), boolean chains 9, if/else 4 (5 pts) (nesting depth added 7). Of this number, 25 points are the body's own statements and 11 belong to 6 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
updateHUD (cognitive 36) ui/observatory/js/hud-controller.js:376— updateHUD has cognitive complexity 36 (threshold 15). Drivers by points: boolean chains 14, ternaries 10 (12 pts), if/else 9 (10 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.
MatReader::parse_matrix (cognitive 35) v2/crates/wifi-densepose-sensing-server/src/dataset.rs:280— MatReader::parse_matrix has cognitive complexity 35 (threshold 15). Drivers by points: loops 6 (17 pts), if/else 6 (13 pts), boolean chains 3, match/switch 1 (2 pts) (nesting depth added 19). 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.
MusicConductorDetector::process_frame (cognitive 35) v2/crates/wifi-densepose-wasm-edge/src/exo_music_conductor.rs:164— MusicConductorDetector::process_frame has cognitive complexity 35 (threshold 15). Drivers by points: if/else 25 (30 pts), boolean chains 4, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
IlluminatorTracker.computeRangeDoppler (cognitive 35) scripts/passive-radar.js:133— IlluminatorTracker.computeRangeDoppler has cognitive complexity 35 (threshold 15). Drivers by points: loops 11 (23 pts), if/else 6 (10 pts), boolean chains 2 (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
gaussian-splats.html.routeMessage (cognitive 35) ui/mobile/src/assets/webview/gaussian-splats.html:461— gaussian-splats.html.routeMessage has cognitive complexity 35 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 11, error handling 4 (8 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.
render (cognitive 35) v2/crates/homecore-server/ui/js/panels/entities.js:20— render has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 10, ternaries 4 (8 pts), error handling 1 (nesting depth added 8). Most of this is not in the body itself: 6 of the 35 points are its own statements and the rest belongs to 16 function items inside it that branch (a function literal at line 124, render, patchRow, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
ruview_survey::check::check (cognitive 34) v2/crates/ruview-survey/src/check.rs:30— ruview_survey::check::check has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 6 (10 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.
ActivityHead::train (cognitive 34) v2/crates/ruview-unified/src/heads.rs:136— ActivityHead::train has cognitive complexity 34 (threshold 15). Drivers by points: loops 11 (29 pts), if/else 2 (5 pts) (nesting depth added 21). 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.
PublishPlanner::on_snapshot (cognitive 34) v2/crates/wifi-densepose-sensing-server/src/mqtt/planner/mod.rs:122— PublishPlanner::on_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (22 pts), match/switch 3 (8 pts), boolean chains 2, loops 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.
TemporalLogicGuard::on_frame (cognitive 34) v2/crates/wifi-densepose-wasm-edge/src/tmp_temporal_logic_guard.rs:59— TemporalLogicGuard::on_frame has cognitive complexity 34 (threshold 15). Drivers by points: if/else 14 (27 pts), boolean chains 5, loops 1, match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mincut-person-counter.minimumCutPhase (cognitive 34) scripts/mincut-person-counter.js:268— mincut-person-counter.minimumCutPhase has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 6 (12 pts), boolean chains 3 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EdgeModules.ModuleLibraryTab (cognitive 34) v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:983— EdgeModules.ModuleLibraryTab has cognitive complexity 34 (threshold 15). Drivers by points: boolean chains 16, ternaries 8 (11 pts), if/else 5 (6 pts), error handling 1 (nesting depth added 4). Most of this is not in the body itself: 9 of the 34 points are its own statements and the rest belongs to 6 function items inside it that branch (handleInstall, a function literal at line 1081, a function literal at line 1001, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
validateBrainRecord (cognitive 34) harness/homecore/src/brain.js:19— validateBrainRecord has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 15, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
_sleepMonitoring (cognitive 34) ui/observatory/js/demo-data.js:571— _sleepMonitoring has cognitive complexity 34 (threshold 15). Drivers by points: ternaries 18 (22 pts), if/else 8, boolean chains 3, 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.
feed (cognitive 34) harness/ruview/src/devices/mmwave.js:27— feed has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (27 pts), ternaries 1 (5 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
GeometryEmbedding::from_nodes (cognitive 33) v2/crates/wifi-densepose-calibration/src/geometry_embedding.rs:107— GeometryEmbedding::from_nodes has cognitive complexity 33 (threshold 15). Drivers by points: loops 10 (20 pts), if/else 8 (12 pts), boolean chains 1 (nesting depth added 14). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
RainDetector::process_frame (cognitive 33) v2/crates/wifi-densepose-wasm-edge/src/exo_rain_detect.rs:158— RainDetector::process_frame has cognitive complexity 33 (threshold 15). Drivers by points: if/else 20 (26 pts), loops 3 (4 pts), boolean chains 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.
CustomerFlowTracker::process_frame (cognitive 33) v2/crates/wifi-densepose-wasm-edge/src/ret_customer_flow.rs:130— CustomerFlowTracker::process_frame has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (21 pts), loops 6 (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.
CoherenceGate::process_frame (cognitive 33) v2/crates/wifi-densepose-wasm-edge/src/sig_coherence_gate.rs:107— CoherenceGate::process_frame has cognitive complexity 33 (threshold 15). Drivers by points: if/else 19 (26 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
device-fingerprint.startReplay (cognitive 33) scripts/device-fingerprint.js:609— device-fingerprint.startReplay has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 4, error handling 1 (2 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.
flattenFrames (cognitive 33) harness/ruview-kernel/src/abi.js:54— flattenFrames has cognitive complexity 33 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 5, loops 3 (5 pts), ternaries 2 (4 pts), other 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_handleJsonFrame (cognitive 33) ui/pose-fusion/js/csi-simulator.js:313— _handleJsonFrame has cognitive complexity 33 (threshold 15). Drivers by points: loops 5 (10 pts), boolean chains 9, if/else 8 (9 pts), ternaries 2 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HvacPresenceDetector::process_frame (cognitive 32) v2/crates/wifi-densepose-wasm-edge/src/bld_hvac_presence.rs:94— HvacPresenceDetector::process_frame has cognitive complexity 32 (threshold 15). Drivers by points: if/else 16 (26 pts), match/switch 3 (5 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LivestockMonitor::process_frame (cognitive 32) v2/crates/wifi-densepose-wasm-edge/src/ind_livestock_monitor.rs:142— LivestockMonitor::process_frame has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 8 (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.
QueueLengthEstimator::process_frame (cognitive 32) v2/crates/wifi-densepose-wasm-edge/src/ret_queue_length.rs:120— QueueLengthEstimator::process_frame has cognitive complexity 32 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VitalTrendAnalyzer::on_timer (cognitive 32) v2/crates/wifi-densepose-wasm-edge/src/vital_trend.rs:173— VitalTrendAnalyzer::on_timer has cognitive complexity 32 (threshold 15). Drivers by points: if/else 18 (25 pts), boolean chains 7 (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.
swarm_health.assert_frame_rate_above (cognitive 32) scripts/swarm_health.py:321— swarm_health.assert_frame_rate_above has cognitive complexity 32 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 2 (9 pts), loops 3 (6 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.
NvConsole.exec (cognitive 32) dashboard/src/components/nv-console.ts:119— NvConsole.exec has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (2 pts), ternaries 1 (2 pts), match/switch 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
views.overview (cognitive 32) harness/ruview/mod/hooks/views.mjs:122— views.overview has cognitive complexity 32 (threshold 15). Drivers by points: ternaries 14 (27 pts), if/else 3, boolean chains 2 (nesting depth added 13). Of this number, 24 points are the body's own statements and 8 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.
http-transport.buildHttpApp.httpServer (cognitive 32) REDACTED:220— http-transport.buildHttpApp.httpServer has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (24 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 12). None of this is in the body itself: all 32 points belong to 3 function literals inside it that branch (lines 221, 318, 293). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
validateSnapshotData (cognitive 32) integrations/virtual-view/adapter.mjs:10— validateSnapshotData has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 8, loops 2 (3 pts), ternaries 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.
prepare_bfi.extract (cognitive 31) tools/bfi_learning/prepare_bfi.py:31— prepare_bfi.extract has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 8, error handling 1 (2 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.
process-runner.runProcess (cognitive 31) harness/homecore/src/process-runner.js:89— process-runner.runProcess has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15, ternaries 4 (11 pts), boolean chains 5 (nesting depth added 7). Most of this is not in the body itself: 8 of the 31 points are its own statements and the rest belongs to 5 function literals inside it that branch (lines 165, 134, 110, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
rf-scan.renderASCII (cognitive 31) scripts/rf-scan.js:412— rf-scan.renderASCII has cognitive complexity 31 (threshold 15). Drivers by points: ternaries 5 (15 pts), if/else 8 (12 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.
feed (cognitive 31) harness/ruview/src/devices/mmwave.js:80— feed has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 3 (9 pts), boolean chains 1, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NpyReader::parse (cognitive 30) v2/crates/wifi-densepose-sensing-server/src/dataset.rs:83— NpyReader::parse has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (20 pts), loops 2 (5 pts), boolean chains 4, match/switch 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
AppStateInner::effective_source (cognitive 30) v2/crates/wifi-densepose-sensing-server/src/main.rs:2901— AppStateInner::effective_source has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (30 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.
TimeCrystalDetector::process_frame (cognitive 30) v2/crates/wifi-densepose-wasm-edge/src/exo_time_crystal.rs:124— TimeCrystalDetector::process_frame has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (23 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TemporalCompressor::push_frame (cognitive 30) v2/crates/wifi-densepose-wasm-edge/src/sig_temporal_compress.rs:72— TemporalCompressor::push_frame has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 6 (9 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
collect-training-data.main (cognitive 30) scripts/collect-training-data.py:393— collect-training-data.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (20 pts), loops 3 (7 pts), error handling 1 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NvInspector.renderWitnessTab (cognitive 30) dashboard/src/components/nv-inspector.ts:339— NvInspector.renderWitnessTab has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 13 (27 pts), boolean chains 3 (nesting depth added 14). 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.
NvGhostMurmur.renderDemo (cognitive 30) dashboard/src/components/nv-ghost-murmur.ts:336— NvGhostMurmur.renderDemo has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 12 (16 pts), if/else 11 (14 pts) (nesting depth added 7). Most of this is not in the body itself: 10 of the 30 points are its own statements and the rest belongs to one function literal inside it that branches (line 342). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
stress-monitor.startReplay (cognitive 30) scripts/stress-monitor.js:264— stress-monitor.startReplay has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (26 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-camera-free.augmentData (cognitive 30) REDACTED:1447— train-camera-free.augmentData has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 13). Of this number, 27 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-ruvllm.augmentData (cognitive 30) REDACTED:853— train-ruvllm.augmentData has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 13). Of this number, 27 points are the body's own statements and 3 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PresenceCartography.update (cognitive 30) ui/observatory/js/presence-cartography.js:92— PresenceCartography.update has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 4 (10 pts), ternaries 1 (5 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
startMcpHttp (cognitive 30) REDACTED:53— startMcpHttp has cognitive complexity 30 (threshold 15). Drivers by points: boolean chains 14, if/else 12, error handling 2, other 1, ternaries 1. Most of this is not in the body itself: 9 of the 30 points are its own statements and the rest belongs to 10 function items inside it that branch (a function literal at line 66, a function literal at line 93, a function literal at line 88, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
decode (cognitive 30) ui/pose-fusion/js/pose-decoder.js:133— decode has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 7 (10 pts), boolean chains 5, loops 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SceneGraph::activate (cognitive 29) v2/crates/ruview-unified/src/gaussian/graph.rs:116— SceneGraph::activate has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GaitAnalyzer::process_frame (cognitive 29) v2/crates/wifi-densepose-wasm-edge/src/med_gait_analysis.rs:158— GaitAnalyzer::process_frame has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 6 (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.
process-runner.runProcess (cognitive 29) harness/ruview/src/process-runner.js:13— process-runner.runProcess has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13, ternaries 5 (12 pts), boolean chains 4 (nesting depth added 7). Most of this is not in the body itself: 6 of the 29 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 42, 21, 25, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
training.runTraining (cognitive 29) harness/ruview/src/training.js:134— training.runTraining has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (18 pts), if/else 4 (5 pts), boolean chains 4, error handling 1, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
views.viewOf (cognitive 29) harness/ruview/mod/hooks/views.mjs:63— views.viewOf has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 16 (20 pts), boolean chains 6, if/else 3 (nesting depth added 4). Of this number, 26 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
benchmark-ruvllm.quantizeWeights (cognitive 29) REDACTED:186— benchmark-ruvllm.quantizeWeights has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 6 (8 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
csi-spectrogram.processLive (cognitive 29) scripts/csi-spectrogram.js:543— csi-spectrogram.processLive has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 6, error handling 2 (5 pts) (nesting depth added 9). None of this is in the body itself: all 29 points belong to 2 function literals inside it that branch (lines 552, 635). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
passive-radar.startReplay (cognitive 29) scripts/passive-radar.js:588— passive-radar.startReplay has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (7 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sleep-monitor.startReplay (cognitive 29) scripts/sleep-monitor.js:299— sleep-monitor.startReplay has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-camera-free.quantizeWeights (cognitive 29) REDACTED:1364— train-camera-free.quantizeWeights has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 6 (8 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-ruvllm.quantizeWeights (cognitive 29) REDACTED:678— train-ruvllm.quantizeWeights has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 6 (8 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-wiflow.quantizeWeights (cognitive 29) REDACTED:384— train-wiflow.quantizeWeights has cognitive complexity 29 (threshold 15). Drivers by points: loops 7 (13 pts), if/else 6 (8 pts), ternaries 2 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
readIphoneLidar (cognitive 29) harness/ruview/src/devices/lidar.js:104— readIphoneLidar has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11, ternaries 6 (7 pts), boolean chains 5, error handling 4, other 2 (nesting depth added 1). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to 8 function items inside it that branch ((anonymous)::finish, (anonymous)::onclose, (anonymous)::onmessage, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
readMmwave (cognitive 29) harness/ruview/src/devices/mmwave.js:149— readMmwave has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 5 (10 pts), boolean chains 5, error handling 1, loops 1, other 1 (nesting depth added 10). Of this number, 27 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
modelOf (cognitive 29) harness/ruview/mod/hooks/model.mjs:90— modelOf has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 10 (12 pts), boolean chains 10, other 4, if/else 2, loops 1 (nesting depth added 2). Of this number, 23 points are the body's own statements and 6 belong to 2 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
DeviceHistory::verdict_at (cognitive 28) v2/crates/wifi-densepose-sensing-server/src/mediatek_heuristic.rs:245— DeviceHistory::verdict_at has cognitive complexity 28 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 2, 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.
health.health_check (cognitive 28) archive/v1/src/api/routers/health.py:57— health.health_check has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (9 pts), error handling 4 (7 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.
ws_server.generate_signal_field (cognitive 28) REDACTED:236— ws_server.generate_signal_field has cognitive complexity 28 (threshold 15). Drivers by points: loops 7 (18 pts), if/else 4 (6 pts), ternaries 1 (3 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.
download_public_bfi.download_file (cognitive 28) tools/bfi_learning/download_public_bfi.py:224— download_public_bfi.download_file has cognitive complexity 28 (threshold 15). Drivers by points: if/else 4 (10 pts), boolean chains 7, loops 3 (7 pts), error handling 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli-ui.renderMmwave (cognitive 28) harness/ruview/src/cli-ui.js:134— cli-ui.renderMmwave has cognitive complexity 28 (threshold 15). Drivers by points: ternaries 12 (19 pts), boolean chains 5, if/else 2, loops 1 (2 pts) (nesting depth added 8). Of this number, 20 points are the body's own statements and 8 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
align-ground-truth.loadCsi (cognitive 28) scripts/align-ground-truth.js:218— align-ground-truth.loadCsi has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (5 pts), boolean chains 2, ternaries 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.
benchmark-rf-scan.printReport (cognitive 28) scripts/benchmark-rf-scan.js:377— benchmark-rf-scan.printReport has cognitive complexity 28 (threshold 15). Drivers by points: loops 6 (10 pts), boolean chains 8, ternaries 2 (6 pts), if/else 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
csi-graph-visualizer.startReplay (cognitive 28) scripts/csi-graph-visualizer.js:609— csi-graph-visualizer.startReplay has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
snn-csi-processor.main (cognitive 28) scripts/snn-csi-processor.js:302— snn-csi-processor.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (14 pts), loops 5 (8 pts), boolean chains 4, ternaries 2 (nesting depth added 5). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 332, 460, 448). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
Trigger::matches_sync (cognitive 27) v2/crates/homecore-automation/src/trigger.rs:106— Trigger::matches_sync has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (26 pts), match/switch 1 (nesting depth added 15). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
wifi_densepose_privshield::bin::veil::tui (cognitive 27) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:409— wifi_densepose_privshield::bin::veil::tui has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 5 (9 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
PossibleDistress::tick (cognitive 27) v2/crates/wifi-densepose-sensing-server/src/semantic/distress.rs:61— PossibleDistress::tick has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 3, match/switch 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SomeoneSleeping::tick (cognitive 27) v2/crates/wifi-densepose-sensing-server/src/semantic/sleeping.rs:35— SomeoneSleeping::tick has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4 (nesting depth added 12). 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.
AttractorDetector::process_frame (cognitive 27) v2/crates/wifi-densepose-wasm-edge/src/lrn_anomaly_attractor.rs:137— AttractorDetector::process_frame has cognitive complexity 27 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EwcLifelong::process_frame (cognitive 27) v2/crates/wifi-densepose-wasm-edge/src/lrn_ewc_lifelong.rs:174— EwcLifelong::process_frame has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (25 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.
CardiacArrhythmiaDetector::process_frame (cognitive 27) v2/crates/wifi-densepose-wasm-edge/src/med_cardiac_arrhythmia.rs:129— CardiacArrhythmiaDetector::process_frame has cognitive complexity 27 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7 (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.
wifi_veil::bin::veil::tui (cognitive 27) wifi-veil/src/bin/veil.rs:409— wifi_veil::bin::veil::tui has cognitive complexity 27 (threshold 15). Drivers by points: match/switch 7 (17 pts), if/else 5 (9 pts), loops 1 (nesting depth added 14). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
align-ground-truth.align (cognitive 27) scripts/align-ground-truth.js:429— align-ground-truth.align has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (15 pts), ternaries 5 (6 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
eval-wiflow.loadModel (cognitive 27) scripts/eval-wiflow.js:123— eval-wiflow.loadModel has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GaussianSplatRenderer.update (cognitive 27) ui/mobile/src/assets/webview/gaussian-splats.html:314— GaussianSplatRenderer.update has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LowRankLinear::train (cognitive 26) v2/crates/ruview-unified/src/heads.rs:310— LowRankLinear::train has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (26 pts) (nesting depth added 16). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
MeshGuard::update (cognitive 26) v2/crates/wifi-densepose-engine/src/mesh_guard.rs:105— MeshGuard::update has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CleanRoomMonitor::process_frame (cognitive 26) v2/crates/wifi-densepose-wasm-edge/src/ind_clean_room.rs:118— CleanRoomMonitor::process_frame has cognitive complexity 26 (threshold 15). Drivers by points: if/else 17 (21 pts), boolean chains 5 (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.
benchmark-model.benchmark_model (cognitive 26) scripts/benchmark-model.py:305— benchmark-model.benchmark_model has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 5 (9 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
remote.runRemote (cognitive 26) harness/ruview/src/remote.js:110— remote.runRemote has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (16 pts), if/else 5, boolean chains 3, error handling 2 (nesting depth added 11). 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.
csi-graph-visualizer.renderSpectrum (cognitive 26) scripts/csi-graph-visualizer.js:366— csi-graph-visualizer.renderSpectrum has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 5 (8 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MaterialClassifier.classify (cognitive 26) scripts/material-classifier.js:180— MaterialClassifier.classify has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 4). Of this number, 25 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
rf-scan.handlePacket (cognitive 26) scripts/rf-scan.js:299— rf-scan.handlePacket has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (25 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BodyModel.updateFromKeypoints (cognitive 26) ui/components/body-model.js:291— BodyModel.updateFromKeypoints has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 10, ternaries 4 (nesting depth added 1). Of this number, 17 points are the body's own statements and 9 belong to 3 function items inside it that branch. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
FigurePool.applyKeypoints (cognitive 26) ui/observatory/js/figure-pool.js:302— FigurePool.applyKeypoints has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), boolean chains 3, loops 3, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CanvasRenderer.drawEmbeddingSpace::drawPoints (cognitive 26) ui/pose-fusion/js/canvas-renderer.js:218— CanvasRenderer.drawEmbeddingSpace::drawPoints has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CnnEmbedder._extractJS (cognitive 26) ui/pose-fusion/js/cnn-embedder.js:137— CnnEmbedder._extractJS has cognitive complexity 26 (threshold 15). Drivers by points: loops 10 (16 pts), if/else 6 (8 pts), boolean chains 2 (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.
validateBrainRecord (cognitive 26) harness/ruview/src/brain.js:20— validateBrainRecord has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 12, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_updateDotMatrixMist (cognitive 26) REDACTED:558— _updateDotMatrixMist has cognitive complexity 26 (threshold 15). Drivers by points: boolean chains 10, ternaries 5 (9 pts), if/else 3 (4 pts), loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FlashAttention::process_frame (cognitive 25) v2/crates/wifi-densepose-wasm-edge/src/sig_flash_attention.rs:52— FlashAttention::process_frame has cognitive complexity 25 (threshold 15). Drivers by points: loops 11 (13 pts), if/else 8 (12 pts) (nesting depth added 6). 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.
StageVIModeler::bisect_by_similarity (cognitive 25) v2/patches/ruvector-crv/src/stage_vi.rs:228— StageVIModeler::bisect_by_similarity has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (19 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.
provision.main (cognitive 25) scripts/provision.py:151— provision.main has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (19 pts), ternaries 2 (4 pts), boolean chains 1, error handling 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.
render-readme-visuals.icon (cognitive 25) scripts/render-readme-visuals.py:19— render-readme-visuals.icon has cognitive complexity 25 (threshold 15). Drivers by points: loops 8 (16 pts), ternaries 2 (6 pts), if/else 3 (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.
LiDARCaptureManager.makeFrame (cognitive 25) integrations/iphone-lidar/native/RuViewLiDAR/LiDARCaptureManager.swift:51— LiDARCaptureManager.makeFrame has cognitive complexity 25 (threshold 15). Drivers by points: loops 4 (10 pts), boolean chains 6, if/else 5 (6 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli.run (cognitive 25) harness/ruview-kernel/bin/cli.js:81— cli.run has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (12 pts), if/else 4 (6 pts), boolean chains 4, loops 1 (2 pts), match/switch 1 (nesting depth added 9). Of this number, 23 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mincut-person-counter.stoerWagner (cognitive 25) scripts/mincut-person-counter.js:328— mincut-person-counter.stoerWagner has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PoseDecoder5.trainStep (cognitive 25) REDACTED:662— PoseDecoder5.trainStep has cognitive complexity 25 (threshold 15). Drivers by points: loops 12 (19 pts), boolean chains 3, if/else 2 (3 pts) (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.
updateModelUI (cognitive 25) ui/components/LiveDemoTab.js:1620— updateModelUI has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 6, ternaries 3 (6 pts) (nesting depth added 6). Of this number, 23 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
add (cognitive 25) harness/ruview/src/devices/esp32.js:238— add has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 9, other 2, ternaries 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.
h (cognitive 25) v2/crates/homecore-server/ui/js/ui.js:8— h has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 5). Of this number, 22 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Esp32CsiParser::parse_frame (cognitive 24) v2/crates/wifi-densepose-hardware/src/esp32_parser.rs:101— Esp32CsiParser::parse_frame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 2 (3 pts), boolean chains 2, match/switch 1 (2 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.
RespiratoryDistressDetector::process_frame (cognitive 24) v2/crates/wifi-densepose-wasm-edge/src/med_respiratory_distress.rs:142— RespiratoryDistressDetector::process_frame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6 (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.
verify.audit_codebase (cognitive 24) archive/v1/data/proof/verify.py:416— verify.audit_codebase has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (10 pts), error handling 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
stream.websocket_events_stream (cognitive 24) archive/v1/src/api/routers/stream.py:186— stream.websocket_events_stream has cognitive complexity 24 (threshold 15). Drivers by points: error handling 7 (12 pts), if/else 7 (10 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rvagent-mcp-consumer.main (cognitive 24) scripts/rvagent-mcp-consumer.py:79— rvagent-mcp-consumer.main has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 8, if/else 7, error handling 2 (4 pts), ternaries 2 (4 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
prepare.public_inventory (cognitive 24) tools/bfi_learning/prepare.py:259— prepare.public_inventory has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 4 (6 pts), boolean chains 5, ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
esphome.decodeFields (cognitive 24) harness/ruview/src/devices/esphome.js:51— esphome.decodeFields has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (23 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.
ApneaDetector.ingest (cognitive 24) scripts/apnea-detector.js:82— ApneaDetector.ingest has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6 (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.
mesh-graph-transformer.processLive (cognitive 24) scripts/mesh-graph-transformer.js:560— mesh-graph-transformer.processLive has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 7). None of this is in the body itself: all 24 points belong to one function literal inside it that branches (line 569). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
ThroughWallDetector.ingestFrame (cognitive 24) scripts/through-wall-detector.js:192— ThroughWallDetector.ingestFrame has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, loops 3 (5 pts), ternaries 1 (nesting depth added 4). Of this number, 23 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
Conv1d.forward (cognitive 24) scripts/wiflow-model.js:171— Conv1d.forward has cognitive complexity 24 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 3 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
DemoDataGenerator._blend (cognitive 24) ui/observatory/js/demo-data.js:1765— DemoDataGenerator._blend has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (8 pts), boolean chains 6 (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.
ruvector_attention_wasm.debugString (cognitive 24) ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js:1213— ruvector_attention_wasm.debugString has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
App.App (cognitive 24) v2/crates/wifi-densepose-desktop/ui/src/App.tsx:49— App.App has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 15 (18 pts), boolean chains 4, error handling 1, match/switch 1 (nesting depth added 3). Most of this is not in the body itself: 8 of the 24 points are its own statements and the rest belongs to 3 function items inside it that branch (a function literal at line 179, a function literal at line 67, renderPage). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
TemporalGestureClassifier::classify (cognitive 23) v2/crates/wifi-densepose-signal/src/ruvsense/temporal_gesture.rs:154— TemporalGestureClassifier::classify has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 2, match/switch 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
WiFlowStdConfig::validate (cognitive 23) v2/crates/wifi-densepose-train/src/wiflow_std/config.rs:233— WiFlowStdConfig::validate has cognitive complexity 23 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 7, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PageRankInfluence::power_iteration (cognitive 23) v2/crates/wifi-densepose-wasm-edge/src/spt_pagerank_influence.rs:147— PageRankInfluence::power_iteration has cognitive complexity 23 (threshold 15). Drivers by points: loops 9 (17 pts), if/else 2 (6 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.
StageIIIEncoder::encode (cognitive 23) v2/patches/ruvector-crv/src/stage_iii.rs:112— StageIIIEncoder::encode has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 5 (7 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.
stream.websocket_pose_stream (cognitive 23) archive/v1/src/api/routers/stream.py:70— stream.websocket_pose_stream has cognitive complexity 23 (threshold 15). Drivers by points: error handling 8 (14 pts), if/else 5 (7 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PoseService.estimate_poses (cognitive 23) archive/v1/src/services/pose_service.py:504— PoseService.estimate_poses has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 7, ternaries 2 (4 pts), loops 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
collect-training-data.collect_session (cognitive 23) scripts/collect-training-data.py:320— collect-training-data.collect_session has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (4 pts), loops 3 (4 pts), boolean chains 3, ternaries 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.
qemu_swarm.setup_network (cognitive 23) scripts/qemu_swarm.py:342— qemu_swarm.setup_network has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (14 pts), if/else 5 (7 pts), boolean chains 2 (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
codex_iteration.audit_events (cognitive 23) tools/bfi_learning/codex_iteration.py:163— codex_iteration.audit_events has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NvScene.onKey (cognitive 23) dashboard/src/components/nv-scene.ts:173— NvScene.onKey has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 5 (12 pts), if/else 6 (7 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.
eval-wiflow.computeMetrics (cognitive 23) scripts/eval-wiflow.js:346— eval-wiflow.computeMetrics has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (13 pts), ternaries 6, loops 3 (4 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
material-classifier.renderFrequencyProfile (cognitive 23) scripts/material-classifier.js:374— material-classifier.renderFrequencyProfile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (7 pts), loops 6 (7 pts), ternaries 4 (6 pts), boolean chains 3 (nesting depth added 4). Of this number, 22 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
rf-scan-multifreq.computePenetrationScores (cognitive 23) scripts/rf-scan-multifreq.js:494— rf-scan-multifreq.computePenetrationScores has cognitive complexity 23 (threshold 15). Drivers by points: loops 4 (9 pts), if/else 2 (7 pts), ternaries 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.
BatchNorm1d.forward (cognitive 23) scripts/wiflow-model.js:246— BatchNorm1d.forward has cognitive complexity 23 (threshold 15). Drivers by points: loops 6 (16 pts), if/else 4 (6 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
TrainingPanel._renderConfig (cognitive 23) ui/components/TrainingPanel.js:238— TrainingPanel._renderConfig has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 12, if/else 7 (10 pts), ternaries 1 (nesting depth added 3). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 9 function literals inside it that branch (lines 256, 298, 300, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
ConvergenceEngine.update (cognitive 23) ui/observatory/js/convergence-engine.js:122— ConvergenceEngine.update has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 8 (10 pts), loops 3 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FlashFirmware.FlashFirmware (cognitive 23) v2/crates/wifi-densepose-desktop/ui/src/pages/FlashFirmware.tsx:8— FlashFirmware.FlashFirmware has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, ternaries 3 (6 pts), if/else 5, error handling 3 (nesting depth added 3). Most of this is not in the body itself: 7 of the 23 points are its own statements and the rest belongs to 5 function items inside it that branch (pickFirmware, startFlash, a function literal at line 21, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
createLiDARRelay (cognitive 23) integrations/iphone-lidar/web/relay.mjs:25— createLiDARRelay has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, error handling 4, loops 1, ternaries 1 (nesting depth added 1). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 7 function literals inside it that branch (lines 29, 101, 72, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
SemanticIntentRecognizer::recognize_scored (cognitive 22) v2/crates/homecore-assist/src/semantic_recognizer.rs:133— SemanticIntentRecognizer::recognize_scored has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 1 (5 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
RangeConstraintFusion::refine (cognitive 22) v2/crates/wifi-densepose-mat/src/localization/range_constraint.rs:100— RangeConstraintFusion::refine has cognitive complexity 22 (threshold 15). Drivers by points: loops 5 (13 pts), if/else 6 (9 pts) (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
PersonalBaseline::update_daily (cognitive 22) v2/crates/wifi-densepose-signal/src/ruvsense/longitudinal.rs:267— PersonalBaseline::update_daily has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 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.
HyperbolicEmbedder::process_frame (cognitive 22) v2/crates/wifi-densepose-wasm-edge/src/exo_hyperbolic_space.rs:171— HyperbolicEmbedder::process_frame has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 5 (7 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
StageIEncoder::encode_stroke (cognitive 22) v2/patches/ruvector-crv/src/stage_i.rs:87— StageIEncoder::encode_stroke has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 4 (7 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.
provision.build_nvs_csv (cognitive 22) firmware/esp32-csi-node/provision.py:509— provision.build_nvs_csv has cognitive complexity 22 (threshold 15). Drivers by points: if/else 22. 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.
process-runner.terminateProcessTree (cognitive 22) harness/homecore/src/process-runner.js:21— process-runner.terminateProcessTree has cognitive complexity 22 (threshold 15). Drivers by points: error handling 8 (15 pts), if/else 3 (4 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). Most of this is not in the body itself: 8 of the 22 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 52, 74, 32, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
serial-pump.readSerial (cognitive 22) harness/ruview/src/devices/serial-pump.js:47— serial-pump.readSerial has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 8, ternaries 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
app.initDemo (cognitive 22) references/app.js:80— app.initDemo has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 3 (5 pts) (nesting depth added 7). None of this is in the body itself: all 22 points belong to 6 function items inside it that branch (startSignalAnimation::animate, a function literal at line 123, startPoseAnimation::animate, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
cog_pose_estimation::runtime::run_loop (cognitive 21) v2/crates/cog-pose-estimation/src/runtime.rs:12— cog_pose_estimation::runtime::run_loop has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (18 pts), match/switch 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
RfFrameV2::to_canonical (cognitive 21) v2/crates/ruview-unified/src/frame.rs:325— RfFrameV2::to_canonical has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (6 pts), match/switch 1 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SonaAdapter::mse_loss_grad (cognitive 21) v2/crates/wifi-densepose-aether/src/sona.rs:387— SonaAdapter::mse_loss_grad has cognitive complexity 21 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 2 (8 pts), boolean chains 2 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
PhysicsConfig::validate (cognitive 21) v2/crates/wifi-densepose-physics/src/config.rs:63— PhysicsConfig::validate has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12, boolean chains 9. 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.
VitalSignDetector::compute_fft_peak (cognitive 21) v2/crates/wifi-densepose-sensing-server/src/vital_signs.rs:214— VitalSignDetector::compute_fft_peak has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 3, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
GestureClassifier::classify (cognitive 21) v2/crates/wifi-densepose-signal/src/ruvsense/gesture.rs:205— GestureClassifier::classify has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (18 pts), loops 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
wifi_densepose_vitals::groundtruth::best_lag (cognitive 21) v2/crates/wifi-densepose-vitals/src/groundtruth.rs:692— wifi_densepose_vitals::groundtruth::best_lag has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (3 pts), match/switch 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OptimalTransportDetector::process_frame (cognitive 21) v2/crates/wifi-densepose-wasm-edge/src/sig_optimal_transport.rs:131— OptimalTransportDetector::process_frame has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (13 pts), boolean chains 4, loops 3 (4 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.
check_fix_markers.main (cognitive 21) scripts/check_fix_markers.py:143— check_fix_markers.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), loops 3 (5 pts), ternaries 1 (2 pts), error handling 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.
NvHelp.render (cognitive 21) dashboard/src/components/nv-help.ts:420— NvHelp.render has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 9 (21 pts) (nesting depth added 12). Most of this is not in the body itself: 10 of the 21 points are its own statements and the rest belongs to one function literal inside it that branches (line 428). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
raster.lineChart (cognitive 21) harness/ruview/mod/hooks/raster.mjs:232— raster.lineChart has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 5 (7 pts), if/else 5 (6 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 6). Of this number, 20 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body: 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.
views.radarView (cognitive 21) harness/ruview/mod/hooks/views.mjs:195— views.radarView has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 12 (15 pts), if/else 4, boolean chains 2 (nesting depth added 3). Of this number, 16 points are the body's own statements and 5 belong to one function item inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
material-detector.startLive (cognitive 21) scripts/material-detector.js:416— material-detector.startLive has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 3 (7 pts), ternaries 1 (4 pts) (nesting depth added 10). None of this is in the body itself: all 21 points belong to 3 function literals inside it that branch (lines 425, 420, 458). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
rf-tomography.startReplay (cognitive 21) scripts/rf-tomography.js:513— rf-tomography.startReplay has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-wiflow-supervised.augmentSample (cognitive 21) scripts/train-wiflow-supervised.js:620— train-wiflow-supervised.augmentSample has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 5 (10 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SensingService._handleData (cognitive 21) ui/services/sensing.service.js:538— SensingService._handleData has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (3 pts), boolean chains 2, error handling 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.
BodyModelManager.update (cognitive 21) ui/components/body-model.js:575— BodyModelManager.update has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 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.
CnnEmbedder._conv2d3x3 (cognitive 21) ui/pose-fusion/js/cnn-embedder.js:353— CnnEmbedder._conv2d3x3 has cognitive complexity 21 (threshold 15). Drivers by points: loops 6 (21 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.
Dashboard.Dashboard (cognitive 21) v2/crates/wifi-densepose-desktop/ui/src/pages/Dashboard.tsx:28— Dashboard.Dashboard has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 10 (12 pts), boolean chains 6, error handling 2, if/else 1 (nesting depth added 2). Of this number, 15 points are the body's own statements and 6 belong to 3 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
setupEventHandlers (cognitive 21) ui/services/websocket.service.js:150— setupEventHandlers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (13 pts), error handling 4 (7 pts), boolean chains 1 (nesting depth added 4). None of this is in the body itself: all 21 points belong to 5 function items inside it that branch (onclose, onmessage, onopen, …). 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.
listCognitumSpaces (cognitive 21) harness/ruview/src/spaces.js:181— listCognitumSpaces has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 8, error handling 2, other 1, ternaries 1. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
trainingCommand (cognitive 21) harness/ruview/src/training.js:96— trainingCommand has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), other 4, ternaries 3 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
homecore_migrate::main (cognitive 20) v2/crates/homecore-migrate/src/main.rs:21— homecore_migrate::main has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 4 (10 pts), if/else 3 (6 pts), loops 2 (4 pts) (nesting depth added 11). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
Recorder::latest_states (cognitive 20) v2/crates/homecore-recorder/src/db.rs:513— Recorder::latest_states has cognitive complexity 20 (threshold 15). Drivers by points: match/switch 5 (12 pts), if/else 4 (7 pts), loops 1 (nesting depth added 10). To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
CrossViewpointAttention::attend (cognitive 20) v2/crates/wifi-densepose-ruvector/src/viewpoint/attention.rs:368— CrossViewpointAttention::attend has cognitive complexity 20 (threshold 15). Drivers by points: loops 8 (14 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
WiFiDataSimulator.generate_csi_sample (cognitive 20) references/script_4.py:139— WiFiDataSimulator.generate_csi_sample has cognitive complexity 20 (threshold 15). Drivers by points: loops 6 (20 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.
run_trial_linux.send_traffic (cognitive 20) tools/bfi/run_trial_linux.py:115— run_trial_linux.send_traffic has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 2, ternaries 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.
firmware.listSerialPorts (cognitive 20) harness/ruview/src/firmware.js:240— firmware.listSerialPorts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, 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.
csi-graph-visualizer.renderClusters (cognitive 20) scripts/csi-graph-visualizer.js:426— csi-graph-visualizer.renderClusters has cognitive complexity 20 (threshold 15). Drivers by points: loops 3 (8 pts), if/else 3 (6 pts), ternaries 2 (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.
material-classifier.startReplay (cognitive 20) scripts/material-classifier.js:542— material-classifier.startReplay has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mincut-person-counter.startReplay (cognitive 20) scripts/mincut-person-counter.js:678— mincut-person-counter.startReplay has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
HRVAnalyzer.analyze (cognitive 20) scripts/stress-monitor.js:123— HRVAnalyzer.analyze has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 5, boolean chains 4, ternaries 2 (nesting depth added 3). Of this number, 19 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
hud-controller.vitalColor (cognitive 20) ui/observatory/js/hud-controller.js:117— hud-controller.vitalColor has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
watchCapture (cognitive 20) harness/ruview/src/cli.js:87— watchCapture has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), boolean chains 4, other 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.
flashFirmware (cognitive 20) harness/ruview/src/firmware.js:178— flashFirmware has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, other 2, ternaries 2, error handling 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.
summarizeEsphome (cognitive 20) harness/ruview/src/devices/esphome.js:148— summarizeEsphome has cognitive complexity 20 (threshold 15). Drivers by points: ternaries 8, boolean chains 7, if/else 1 (2 pts), other 2, loops 1 (nesting depth added 1). Most of this is not in the body itself: 8 of the 20 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 171, toCm, values, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
RfTensor::new (cognitive 19) v2/crates/ruview-unified/src/tensor.rs:127— RfTensor::new has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CsiGestaltClassifier::classify (cognitive 19) v2/crates/wifi-densepose-ruvector/src/crv/mod.rs:165— CsiGestaltClassifier::classify has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16, boolean chains 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.
CoherenceMonitor::process_frame (cognitive 19) v2/crates/wifi-densepose-wasm-edge/src/coherence.rs:68— CoherenceMonitor::process_frame has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (15 pts), loops 2 (3 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.
DreamStageDetector::process_frame (cognitive 19) v2/crates/wifi-densepose-wasm-edge/src/exo_dream_stage.rs:197— DreamStageDetector::process_frame has cognitive complexity 19 (threshold 15). Drivers by points: if/else 16 (17 pts), boolean chains 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
benchmark-rtl8721dx-csi.run_benchmark (cognitive 19) scripts/benchmark-rtl8721dx-csi.py:94— benchmark-rtl8721dx-csi.run_benchmark has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8, if/else 4 (7 pts), error handling 1 (2 pts), loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
traffic_coverage.report_timestamps (cognitive 19) tools/bfi_learning/traffic_coverage.py:94— traffic_coverage.report_timestamps has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NvApp.render (cognitive 19) dashboard/src/components/nv-app.ts:104— NvApp.render has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 8 (19 pts) (nesting depth added 11). 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.
main.onFrames (cognitive 19) dashboard/src/main.ts:68— main.onFrames has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (5 pts), loops 3 (4 pts), error handling 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.
doctor.verifyPackageManifest (cognitive 19) harness/ruview/src/doctor.js:25— doctor.verifyPackageManifest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (11 pts), error handling 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tools.which (cognitive 19) harness/ruview/src/tools.js:58— tools.which has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 3 (7 pts), if/else 3 (4 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
apnea-detector.startLive (cognitive 19) scripts/apnea-detector.js:334— apnea-detector.startLive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (4 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 6). None of this is in the body itself: all 19 points belong to 4 function literals inside it that branch (lines 343, 365, 386, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
FingerprintManager.ingestFrame (cognitive 19) scripts/device-fingerprint.js:284— FingerprintManager.ingestFrame has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
eval-wiflow.main (cognitive 19) scripts/eval-wiflow.js:534— eval-wiflow.main has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
room-fingerprint.startLive (cognitive 19) scripts/room-fingerprint.js:418— room-fingerprint.startLive has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 1 (nesting depth added 6). None of this is in the body itself: all 19 points belong to 3 function literals inside it that branch (lines 436, 422, 464). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
train-camera-free.generateMultiModalTriplets (cognitive 19) REDACTED:1286— train-camera-free.generateMultiModalTriplets has cognitive complexity 19 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), loops 3 (5 pts) (nesting depth added 5). Of this number, 15 points are the body's own statements and 4 belong to 4 function literals inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CausalConv1d.forward (cognitive 19) scripts/train-wiflow-supervised.js:710— CausalConv1d.forward has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 1 (5 pts), boolean chains 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
AxialAttention._multiheadAttention (cognitive 19) scripts/wiflow-model.js:694— AxialAttention._multiheadAttention has cognitive complexity 19 (threshold 15). Drivers by points: loops 7 (19 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.
LiveDemoTab.updateMetricsDisplay (cognitive 19) ui/components/LiveDemoTab.js:1363— LiveDemoTab.updateMetricsDisplay has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 5, 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.
ruvector_cnn_wasm.__wbg_load (cognitive 19) ui/pose-fusion/pkg/ruvector_cnn_wasm/ruvector_cnn_wasm.js:721— ruvector_cnn_wasm.__wbg_load has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1 (3 pts), match/switch 1 (nesting depth added 7). Of this number, 18 points are the body's own statements and 1 belongs to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
connect.open (cognitive 19) v2/crates/homecore-server/ui/js/ws.js:24— connect.open has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, error handling 3 (nesting depth added 1). Most of this is not in the body itself: 1 of the 19 points is its own statement and the rest belongs to 3 function items inside it that branch (onmessage, onclose, onerror). 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.
CsiSensoryEncoder::extract (cognitive 18) v2/crates/wifi-densepose-ruvector/src/crv/mod.rs:417— CsiSensoryEncoder::extract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 18. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
DeviceRing::fast_activity (cognitive 18) v2/crates/wifi-densepose-sensing-server/src/mediatek_csi_ring.rs:158— DeviceRing::fast_activity has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (8 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.
PhaseSanitizer::calculate_quality_map (cognitive 18) v2/crates/wifi-densepose-signal/src/phase_sanitizer.rs:397— PhaseSanitizer::calculate_quality_map has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ArrayCoordinator::coordinate (cognitive 18) v2/crates/wifi-densepose-signal/src/ruvsense/array_coordinator.rs:110— ArrayCoordinator::coordinate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ReferenceSeries::parse_csv_bounded (cognitive 18) v2/crates/wifi-densepose-vitals/src/groundtruth.rs:354— ReferenceSeries::parse_csv_bounded has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
DatabaseManager.health_check (cognitive 18) archive/v1/src/database/connection.py:349— DatabaseManager.health_check has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 5, error handling 2 (3 pts), ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
CORSMiddleware._handle_preflight (cognitive 18) archive/v1/src/middleware/cors.py:89— CORSMiddleware._handle_preflight has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
generate_nvs_matrix.main (cognitive 18) scripts/generate_nvs_matrix.py:343— generate_nvs_matrix.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mmwave_fusion_bridge.fuse_and_display (cognitive 18) scripts/mmwave_fusion_bridge.py:141— mmwave_fusion_bridge.fuse_and_display has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 3 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Handler.do_GET (cognitive 18) scripts/ruview-sensing-server.py:170— Handler.do_GET has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
swarm_health.assert_max_boot_time (cognitive 18) scripts/swarm_health.py:366— swarm_health.assert_max_boot_time has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
swarm_health._parse_assertion_spec (cognitive 18) scripts/swarm_health.py:442— swarm_health._parse_assertion_spec has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
codex_iteration.run_with_sinks (cognitive 18) tools/bfi_learning/codex_iteration.py:99— codex_iteration.run_with_sinks has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4, error handling 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
spaces.assertBoundedValue (cognitive 18) harness/ruview/src/spaces.js:52— spaces.assertBoundedValue has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
esp32.trackSequence (cognitive 18) harness/ruview/src/devices/esp32.js:198— esp32.trackSequence has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
deep-scan.server.on("message") (cognitive 18) scripts/deep-scan.js:30— deep-scan.server.on("message") has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WiFiDensePoseApp.cleanup (cognitive 18) ui/app.js:443— WiFiDensePoseApp.cleanup has cognitive complexity 18 (threshold 15). Drivers by points: if/else 17, boolean chains 1. Of this number, 16 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, 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.
MatDashboard.generateAlerts (cognitive 18) ui/mobile/src/assets/webview/mat-dashboard.html:280— MatDashboard.generateAlerts has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ServerPlugins::start (cognitive 17) v2/crates/homecore-server/src/plugins.rs:54— ServerPlugins::start has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (6 pts), if/else 3 (5 pts), match/switch 2 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PlacementParams::validate (cognitive 17) v2/crates/ruview-placement/src/coverage.rs:165— PlacementParams::validate has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 9, if/else 8. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
SecureTdmCoordinator::verify_beacon (cognitive 17) v2/crates/wifi-densepose-hardware/src/esp32/secure_tdm.rs:471— SecureTdmCoordinator::verify_beacon has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (12 pts), match/switch 2 (4 pts), boolean chains 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
QuantizedHnswIndex::beam_code (cognitive 17) v2/crates/wifi-densepose-ruvector/src/hnsw_quantized.rs:374— QuantizedHnswIndex::beam_code has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
wifi_densepose_sar::pointcloud::extract_point_cloud (cognitive 17) v2/crates/wifi-densepose-sar/src/pointcloud.rs:32— wifi_densepose_sar::pointcloud::extract_point_cloud has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ActivityTracker::observe (cognitive 17) v2/crates/wifi-densepose-sensing-server/src/mediatek_activity.rs:203— ActivityTracker::observe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 2, match/switch 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.
ElderlyInactivityAnomaly::tick (cognitive 17) v2/crates/wifi-densepose-sensing-server/src/semantic/elderly_anomaly.rs:40— ElderlyInactivityAnomaly::tick has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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.
CrossRoomTracker::match_entry (cognitive 17) v2/crates/wifi-densepose-signal/src/ruvsense/cross_room.rs:244— CrossRoomTracker::match_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GestureDetector::process_frame (cognitive 17) v2/crates/wifi-densepose-wasm-edge/src/gesture.rs:111— GestureDetector::process_frame has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 2, loops 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
StageIVEncoder::encode (cognitive 17) v2/patches/ruvector-crv/src/stage_iv.rs:126— StageIVEncoder::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (7 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.
StageVEngine::encode (cognitive 17) v2/patches/ruvector-crv/src/stage_v.rs:110— StageVEngine::encode has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 4 (8 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.
DomainConfig.validate_configuration (cognitive 17) archive/v1/src/config/domains.py:356— DomainConfig.validate_configuration has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
benchmark-model.load_test_data (cognitive 17) scripts/benchmark-model.py:179— benchmark-model.load_test_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
benchmark-model.main (cognitive 17) scripts/benchmark-model.py:452— benchmark-model.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (13 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
calibration_lib.solve_two_board_extrinsics (cognitive 17) scripts/calibration_lib.py:228— calibration_lib.solve_two_board_extrinsics has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (6 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
check_fix_markers.check_marker (cognitive 17) scripts/check_fix_markers.py:94— check_fix_markers.check_marker has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 4 (5 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SwarmOrchestrator.cleanup (cognitive 17) scripts/qemu_swarm.py:790— SwarmOrchestrator.cleanup has cognitive complexity 17 (threshold 15). Drivers by points: error handling 4 (12 pts), if/else 2 (3 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
run_trial_linux.wait_for_capture (cognitive 17) tools/bfi/run_trial_linux.py:92— run_trial_linux.wait_for_capture has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prepare.prepare_records (cognitive 17) tools/bfi_learning/prepare.py:137— prepare.prepare_records has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (6 pts), if/else 3 (5 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
run_batch.run (cognitive 17) tools/bfi_learning/run_batch.py:200— run_batch.run has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 5, if/else 3 (4 pts), error handling 2 (3 pts), loops 3, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train.load_dataset (cognitive 17) tools/bfi_learning/train.py:149— train.load_dataset has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 11, loops 3, ternaries 1 (2 pts), if/else 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
NvHome.render (cognitive 17) dashboard/src/components/nv-home.ts:191— NvHome.render has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 6 (9 pts), boolean chains 4, if/else 4 (nesting depth added 3). Of this number, 9 points are the body's own statements and 8 belong to 4 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
worker.ws.addEventListener("message") (cognitive 17) dashboard/src/transport/worker.ts:132— worker.ws.addEventListener("message") has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 1 (3 pts), error handling 1, match/switch 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
gate.evaluateGenome (cognitive 17) harness/ruview/flywheel/gate.mjs:5— gate.evaluateGenome has cognitive complexity 17 (threshold 15). Drivers by points: if/else 2 (6 pts), loops 3 (5 pts), boolean chains 3, ternaries 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.
align-ground-truth.loadJsonl (cognitive 17) scripts/align-ground-truth.js:156— align-ground-truth.loadJsonl has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (6 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.
eval-wiflow.generateBaselinePose (cognitive 17) scripts/eval-wiflow.js:208— eval-wiflow.generateBaselinePose has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (5 pts), boolean chains 2 (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.
rf-scan-multifreq.handlePacket (cognitive 17) scripts/rf-scan-multifreq.js:312— rf-scan-multifreq.handlePacket has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rf-scan-multifreq.buildWidebandSpectrum (cognitive 17) scripts/rf-scan-multifreq.js:545— rf-scan-multifreq.buildWidebandSpectrum has cognitive complexity 17 (threshold 15). Drivers by points: loops 7 (10 pts), if/else 4 (7 pts) (nesting depth added 6). 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.
RoomFingerprinter.analyze (cognitive 17) scripts/room-fingerprint.js:164— RoomFingerprinter.analyze has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (4 pts), loops 4, ternaries 2 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-camera-free.runBenchmark (cognitive 17) REDACTED:2409— train-camera-free.runBenchmark has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-wiflow-supervised.multiSpsaGrad (cognitive 17) scripts/train-wiflow-supervised.js:408— train-wiflow-supervised.multiSpsaGrad has cognitive complexity 17 (threshold 15). Drivers by points: loops 9 (16 pts), 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.
Environment.updateConfidenceHeatmap (cognitive 17) ui/components/environment.js:394— Environment.updateConfidenceHeatmap has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 2 (7 pts), if/else 3 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FigurePool._createFigure (cognitive 17) ui/observatory/js/figure-pool.js:142— FigurePool._createFigure has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 4 (8 pts), if/else 2 (4 pts), loops 4, boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FigurePool.applyColors (cognitive 17) ui/observatory/js/figure-pool.js:487— FigurePool.applyColors has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 4 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
Observatory._updateParticleTrail (cognitive 17) REDACTED:610— Observatory._updateParticleTrail has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (4 pts), loops 2 (4 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
handleRpc (cognitive 17) harness/ruview/src/mcp-server.js:60— handleRpc has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 3 (5 pts), ternaries 2 (4 pts), 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.
entityProvenance (cognitive 17) v2/crates/homecore-server/ui/js/api.js:129— entityProvenance has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 10, ternaries 5 (6 pts), if/else 1 (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
SpatialMemory::search (cognitive 16) v2/crates/ruview-spatial-memory/src/lib.rs:328— SpatialMemory::search has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RfTwin::build (cognitive 16) v2/crates/ruview-twin/src/twin.rs:283— RfTwin::build has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PcapCsiReader::read_next (cognitive 16) v2/crates/wifi-densepose-mat/src/integration/csi_receiver.rs:688— PcapCsiReader::read_next has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), match/switch 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SketchBank::topk (cognitive 16) v2/crates/wifi-densepose-ruvector/src/sketch.rs:626— SketchBank::topk has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MeetingInProgress::tick (cognitive 16) v2/crates/wifi-densepose-sensing-server/src/semantic/meeting.rs:25— MeetingInProgress::tick has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RoomActive::tick (cognitive 16) v2/crates/wifi-densepose-sensing-server/src/semantic/room_active.rs:25— RoomActive::tick has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (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.
CorrelationFeatures::correlation_matrix (cognitive 16) v2/crates/wifi-densepose-signal/src/features.rs:271— CorrelationFeatures::correlation_matrix has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (7 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TemporalKeypointAttention::smooth_keypoints (cognitive 16) v2/crates/wifi-densepose-signal/src/ruvsense/pose_tracker.rs:959— TemporalKeypointAttention::smooth_keypoints has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), if/else 4 (5 pts) (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.
RfTomographer::reconstruct (cognitive 16) v2/crates/wifi-densepose-signal/src/ruvsense/tomography.rs:248— RfTomographer::reconstruct has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (8 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.
WidarDataset::get (cognitive 16) v2/crates/wifi-densepose-train/src/dataset/widar.rs:808— WidarDataset::get has cognitive complexity 16 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 5, boolean chains 1 (nesting depth added 6). 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.
EnergyAuditor::process_frame (cognitive 16) v2/crates/wifi-densepose-wasm-edge/src/bld_energy_audit.rs:127— EnergyAuditor::process_frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
MetaAdapter::on_timer (cognitive 16) v2/crates/wifi-densepose-wasm-edge/src/lrn_meta_adapt.rs:203— MetaAdapter::on_timer has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (14 pts), boolean chains 1, match/switch 1 (nesting depth added 8). The drivers above price the dispatch low by construction — a dispatch is charged once however many cases it lists, while each branch inside an arm is charged in full — so most of this count is what the case bodies hold, and the arms are where it can be reduced. To reduce it, keep the dispatch but shrink the arms: move each non-trivial case body into its own named function (or onto the value being matched) so the dispatch reads one line per case, and group related cases into a sub-dispatch. Keep every case explicit, and make the behaviour for cases you do not list a deliberate choice rather than an accident.
SleepApneaDetector::process_frame (cognitive 16) v2/crates/wifi-densepose-wasm-edge/src/med_sleep_apnea.rs:111— SleepApneaDetector::process_frame has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rssi_collector.create_collector (cognitive 16) archive/v1/src/sensing/rssi_collector.py:770— rssi_collector.create_collector has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 2 (6 pts), ternaries 1 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SwarmOrchestrator.run (cognitive 16) scripts/qemu_swarm.py:815— SwarmOrchestrator.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4, boolean chains 2, error handling 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
qemu_swarm.validate_config (cognitive 16) scripts/qemu_swarm.py:121— qemu_swarm.validate_config has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 3 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
seed_csi_bridge._run_validation (cognitive 16) scripts/seed_csi_bridge.py:323— seed_csi_bridge._run_validation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 3 (6 pts), error handling 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.
swarm_health.assert_no_crashes (cognitive 16) scripts/swarm_health.py:148— swarm_health.assert_no_crashes has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (swarm_health.assert_no_heap_errors) 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.
swarm_health.assert_no_heap_errors (cognitive 16) scripts/swarm_health.py:398— swarm_health.assert_no_heap_errors has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), boolean chains 1, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (swarm_health.assert_no_crashes) 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.
benchmark_bfi.captured_bodies (cognitive 16) tools/bfi/benchmark_bfi.py:70— benchmark_bfi.captured_bodies has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, error handling 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.
download_public_bfi.run (cognitive 16) tools/bfi_learning/download_public_bfi.py:333— download_public_bfi.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 4, ternaries 1 (2 pts), error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
train.transform_recordings (cognitive 16) tools/bfi_learning/train.py:325— train.transform_recordings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 6, boolean chains 3, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
mmwave.decodeMr60 (cognitive 16) harness/ruview/src/devices/mmwave.js:54— mmwave.decodeMr60 has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 6 (12 pts), boolean chains 3, 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.
train-ruvllm.runBenchmark (cognitive 16) REDACTED:1682— train-ruvllm.runBenchmark has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
train-wiflow-supervised.minCutPersonSeparation (cognitive 16) scripts/train-wiflow-supervised.js:366— train-wiflow-supervised.minCutPersonSeparation has cognitive complexity 16 (threshold 15). Drivers by points: loops 5 (11 pts), ternaries 1 (4 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.
PoseService.validatePoseData (cognitive 16) ui/services/pose.service.js:400— PoseService.validatePoseData has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 5 (nesting depth added 4). Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to one function literal inside it that branches (line 417). The decisions are inside the literal, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literal's work into a named function or method at the enclosing scope and have the literal call it, then reduce whichever part then reads as the largest.
DashboardTab.updateComponentStatus (cognitive 16) ui/components/DashboardTab.js:200— DashboardTab.updateComponentStatus has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 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.
MatDashboard.addZoneFromPayload (cognitive 16) ui/mobile/src/assets/webview/mat-dashboard.html:133— MatDashboard.addZoneFromPayload has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 7 (10 pts), boolean chains 4, if/else 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PoseDecoder._findZoneCentroids (cognitive 16) ui/pose-fusion/js/pose-decoder.js:456— PoseDecoder._findZoneCentroids has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), ternaries 2, boolean chains 1 (nesting depth added 8). Of this number, 14 points are the body's own statements and 2 belong to one function item inside it that branches. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
REDACTED.pushFoundationContext (cognitive 16) REDACTED:197— REDACTED.pushFoundationContext has cognitive complexity 16 (threshold 15). Drivers by points: loops 8 (11 pts), ternaries 2 (5 pts) (nesting depth added 6). 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.
_connect (cognitive 16) ui/services/sensing.service.js:189— _connect has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 3, error handling 3. Most of this is not in the body itself: 7 of the 16 points are its own statements and the rest belongs to 5 function items inside it that branch (onclose, onmessage, isCurrent, …). 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· show (cognitive 16) · ×1
show (cognitive 16) ui/utils/toast.js:21— show has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3, boolean chains 1 (nesting depth added 3). Of this number, 10 points are the body's own statements and 6 belong to 7 function literals inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
automationBuilder (cognitive 16) v2/crates/homecore-server/ui/js/panels/events.js:176— automationBuilder has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 4, error handling 1, ternaries 1. Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 16 function items inside it that branch (a function literal at line 188, paintTriggerExtra, paintActionExtra, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
Change coupling: sensing.service.js ↔ REDACTED ui/services/sensing.service.js:1— `ui/services/sensing.service.js` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` change together 55% of the time (6 of the 11 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) and are written in DIFFERENT LANGUAGES, so no import can join them and they cannot be co-located into one unit — they compile and ship as separate artifacts. What binds them is a CONTRACT across that boundary — an event or message name, a route, a serialised shape — that each side currently spells out on its own, which is exactly why a change to one drags the other. Declare that contract once where both sides read it (a shared schema, a generated constants file, an interface-definition file) so a change on one side fails the other's build instead of drifting silently; where the surface is too small to be worth that, name the counterpart in a comment on both sides so the next reader finds it. There is nothing here to merge. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `73e82313` fix: issue triage batch (#1521-1557) + wire the certificate spine tog…; `34c98040` feat: implement ADR-292/293/294/295/296 — provenance, UDP hardening, …; `d8899481` feat: dynamic classifier classes, per-node UI, XSS fix, RSSI fix (at that commit the file was still `rust-port/wifi-densepose-rs/crates/wifi-densepose-sensing-server/src/main.rs`) — run `git show` on any of them.
D4 · Code Duplication· Near-duplicate member family (6 members, 19 shared lines) · ×1
Near-duplicate member family (6 members, 19 shared lines) v2/crates/wifi-densepose-privshield/src/attacker.rs:63— v2/crates/wifi-densepose-privshield/src/attacker.rs:63-90 | v2/crates/wifi-densepose-privshield/src/attacker.rs:178-205 | v2/crates/wifi-densepose-privshield/src/attacker.rs:256-308 | wifi-veil/src/attacker.rs:63-90 | wifi-veil/src/attacker.rs:178-205 | wifi-veil/src/attacker.rs:256-308 — These 6 members are variants of one another: a block of 19 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Near-duplicate member pair (131 shared lines) v2/crates/wifi-densepose-sensing-server/src/csi.rs:540— v2/crates/wifi-densepose-sensing-server/src/csi.rs:540-676 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4197-4362 — These two members are variants of one another: 131 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (114 shared lines) v2/crates/wifi-densepose-sensing-server/src/main.rs:7081— v2/crates/wifi-densepose-sensing-server/src/main.rs:7081-7285 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:28-201 — These two members are variants of one another: 114 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (59 shared lines) v2/crates/wifi-densepose-sensing-server/src/csi.rs:418— v2/crates/wifi-densepose-sensing-server/src/csi.rs:418-482 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4032-4106 — These two members are variants of one another: 59 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (49 shared lines) v2/crates/homecore-api/src/rest.rs:132— v2/crates/homecore-api/src/rest.rs:132-224 | v2/crates/homecore-api/src/rest.rs:268-340 — These two members are variants of one another: 49 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (22 shared lines) v2/crates/ruview-unified/src/heads.rs:136— v2/crates/ruview-unified/src/heads.rs:136-186 | v2/crates/ruview-unified/src/heads.rs:310-357 — These two members are variants of one another: 22 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
Near-duplicate member pair (19 shared lines) v2/crates/wifi-densepose-cli/src/room.rs:349— v2/crates/wifi-densepose-cli/src/room.rs:349-403 | v2/crates/wifi-densepose-cli/src/room.rs:406-488 — These two members are variants of one another: 19 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×1
Edited copy of a member (19 corresponding lines) v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs:86— v2/crates/wifi-densepose-sensing-server/src/mediatek_csi.rs:86-104 | v2/crates/wifi-densepose-sensing-server/src/qualcomm_csi.rs:76-94 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Edited copy of a member (18 corresponding lines) · ×1
Edited copy of a member (18 corresponding lines) archive/v1/src/models/densepose_head.py:98— archive/v1/src/models/densepose_head.py:98-117 | archive/v1/src/models/densepose_head.py:120-138 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (8 members, 50+ identical tokens) v2/crates/wifi-densepose-cli/src/calibrate.rs:255— v2/crates/wifi-densepose-cli/src/calibrate.rs:255-316 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:161-195 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:234-269 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:283-336 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3404-3438 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3487-3522 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3565-3612 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3711-3796 — These 8 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 8 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 8 times.
Duplicated block (129 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:87— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:87-215 | wifi-veil/src/bin/veil.rs:87-215 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (89 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:410— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:410-498 | wifi-veil/src/bin/veil.rs:410-498 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (64–80 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:542— v2/crates/wifi-densepose-sensing-server/src/csi.rs:542-605 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4199-4278 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (63–75 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:352— v2/crates/wifi-densepose-sensing-server/src/csi.rs:352-414 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3943-4017 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (49–62 lines × 4) v2/crates/wifi-densepose-sensing-server/src/csi.rs:815— v2/crates/wifi-densepose-sensing-server/src/csi.rs:815-863 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:869-917 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4696-4757 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4765-4818 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (61 lines × 2) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:300— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:300-360 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:288-348 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (56–58 lines × 2) v2/crates/wifi-densepose-physics/src/engine.rs:276— v2/crates/wifi-densepose-physics/src/engine.rs:276-333 | v2/crates/wifi-densepose-physics/src/engine.rs:557-612 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (52–57 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1049— v2/crates/wifi-densepose-sensing-server/src/csi.rs:1049-1100 | v2/crates/wifi-densepose-sensing-server/src/main.rs:6581-6637 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (46–53 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1001— v2/crates/wifi-densepose-sensing-server/src/csi.rs:1001-1046 | v2/crates/wifi-densepose-sensing-server/src/main.rs:6525-6577 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (49–53 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/bld_lighting_zones.rs:127— v2/crates/wifi-densepose-wasm-edge/src/bld_lighting_zones.rs:127-175 | v2/crates/wifi-densepose-wasm-edge/src/occupancy.rs:86-138 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (39–49 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:609— v2/crates/wifi-densepose-sensing-server/src/csi.rs:609-647 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4282-4330 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (44–48 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7129— v2/crates/wifi-densepose-sensing-server/src/main.rs:7129-7176 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:62-105 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (47 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:503— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:503-549 | wifi-veil/src/bin/veil.rs:503-549 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (41–45 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:950— v2/crates/wifi-densepose-sensing-server/src/csi.rs:950-990 | v2/crates/wifi-densepose-sensing-server/src/main.rs:6427-6471 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (26–42 lines × 3) v2/crates/wifi-densepose-sensing-server/src/csi.rs:697— v2/crates/wifi-densepose-sensing-server/src/csi.rs:697-722 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:728-753 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4422-4463 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (38 lines × 2) v2/crates/wifi-densepose-privshield/src/bin/veil.rs:285— v2/crates/wifi-densepose-privshield/src/bin/veil.rs:285-322 | wifi-veil/src/bin/veil.rs:285-322 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/bin/veil.rs` and `wifi-veil/src/bin/veil.rs` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 425 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (36 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:12687— v2/crates/wifi-densepose-sensing-server/src/main.rs:12687-12722 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13183-13218 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (27–32 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:419— v2/crates/wifi-densepose-sensing-server/src/csi.rs:419-445 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4033-4064 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (32 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:224— v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:224-255 | v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs:192-223 — before extracting anything, compare `v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs` and `v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (28–31 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:649— v2/crates/wifi-densepose-sensing-server/src/csi.rs:649-676 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4332-4362 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (29–31 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:763— v2/crates/wifi-densepose-sensing-server/src/csi.rs:763-791 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4643-4673 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (30–31 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:1119— v2/crates/wifi-densepose-sensing-server/src/csi.rs:1119-1148 | v2/crates/wifi-densepose-sensing-server/src/main.rs:6745-6775 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (4–29 lines × 6) v2/crates/wifi-densepose-privshield/src/attacker.rs:65— v2/crates/wifi-densepose-privshield/src/attacker.rs:65-68 | v2/crates/wifi-densepose-privshield/src/attacker.rs:179-182 | v2/crates/wifi-densepose-privshield/src/attacker.rs:257-285 | wifi-veil/src/attacker.rs:65-68 | wifi-veil/src/attacker.rs:179-182 | wifi-veil/src/attacker.rs:257-285 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/attacker.rs` and `wifi-veil/src/attacker.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (26–29 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:12524— v2/crates/wifi-densepose-sensing-server/src/main.rs:12524-12552 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13046-13071 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (24–26 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:925— v2/crates/wifi-densepose-sensing-server/src/csi.rs:925-948 | v2/crates/wifi-densepose-sensing-server/src/main.rs:6400-6425 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (7–24 lines × 5) v2/crates/wifi-densepose-sensing-server/src/csi.rs:166— v2/crates/wifi-densepose-sensing-server/src/csi.rs:166-172 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:288-294 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3409-3415 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3570-3576 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3717-3740 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (21–24 lines × 2) v2/crates/wifi-densepose-sensing-server/src/csi.rs:514— v2/crates/wifi-densepose-sensing-server/src/csi.rs:514-534 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4152-4175 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15–23 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:1762— v2/crates/wifi-densepose-sensing-server/src/main.rs:1762-1776 | v2/crates/wifi-densepose-sensing-server/src/types.rs:411-433 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/types.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 69 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (14–21 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7082— v2/crates/wifi-densepose-sensing-server/src/main.rs:7082-7102 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:29-42 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16–21 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7106— v2/crates/wifi-densepose-sensing-server/src/main.rs:7106-7126 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:45-60 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (13–21 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7240— v2/crates/wifi-densepose-sensing-server/src/main.rs:7240-7260 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:165-177 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (18–21 lines × 2) v2/crates/wifi-densepose-sensing-server/src/main.rs:7561— v2/crates/wifi-densepose-sensing-server/src/main.rs:7561-7581 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:233-250 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (11–20 lines × 2) v2/crates/wifi-densepose-nn/src/densepose.rs:339— v2/crates/wifi-densepose-nn/src/densepose.rs:339-358 | v2/crates/wifi-densepose-nn/src/translator.rs:437-447 — before extracting anything, compare `v2/crates/wifi-densepose-nn/src/densepose.rs` and `v2/crates/wifi-densepose-nn/src/translator.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 59 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (19–20 lines × 2) v2/crates/wifi-densepose-train/src/accuracy.rs:157— v2/crates/wifi-densepose-train/src/accuracy.rs:157-175 | v2/crates/wifi-densepose-train/src/metrics_core.rs:146-165 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (18–19 lines × 4) v2/crates/wifi-densepose-sensing-server/src/main.rs:5119— v2/crates/wifi-densepose-sensing-server/src/main.rs:5119-5137 | v2/crates/wifi-densepose-sensing-server/src/main.rs:12711-12728 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13207-13224 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13452-13470 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (17–19 lines × 2) v2/crates/wifi-densepose-train/src/metrics_core.rs:114— v2/crates/wifi-densepose-train/src/metrics_core.rs:114-132 | v2/crates/wifi-densepose-train/src/ruview_metrics.rs:641-657 — before extracting anything, compare `v2/crates/wifi-densepose-train/src/metrics_core.rs` and `v2/crates/wifi-densepose-train/src/ruview_metrics.rs` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 34 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17–18 lines × 2) v2/crates/wifi-densepose-sensing-server/src/training_api.rs:624— v2/crates/wifi-densepose-sensing-server/src/training_api.rs:624-640 | v2/crates/wifi-densepose-sensing-server/src/training_api.rs:697-714 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16–18 lines × 2) v2/crates/wifi-densepose-wasm-edge/src/ret_table_turnover.rs:196— v2/crates/wifi-densepose-wasm-edge/src/ret_table_turnover.rs:196-213 | v2/crates/wifi-densepose-wasm-edge/src/ret_table_turnover.rs:235-250 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (16–17 lines × 3) v2/crates/wifi-densepose-wasm/src/mat.rs:604— v2/crates/wifi-densepose-wasm/src/mat.rs:604-620 | v2/crates/wifi-densepose-wasm/src/mat.rs:643-659 | v2/crates/wifi-densepose-wasm/src/mat.rs:686-701 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (15–17 lines × 2) v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:406— v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:406-422 | v2/crates/wifi-densepose-ruvector/src/viewpoint/fusion.rs:468-482 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (2–17 lines × 3) v2/crates/wifi-densepose-sensing-server/src/csi.rs:179— v2/crates/wifi-densepose-sensing-server/src/csi.rs:179-195 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3422-3438 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3584-3585 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (16 lines × 3) v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:294— v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs:294-309 | v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs:282-297 | v2/crates/wifi-densepose-hardware/src/realtek_csi.rs:185-200 — before extracting anything, compare `v2/crates/wifi-densepose-hardware/src/mediatek_csi.rs` and `v2/crates/wifi-densepose-hardware/src/qualcomm_csi.rs` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 296 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15–16 lines × 3) v2/crates/wifi-densepose-sensing-server/src/csi.rs:776— v2/crates/wifi-densepose-sensing-server/src/csi.rs:776-790 | v2/crates/wifi-densepose-sensing-server/src/main.rs:4657-4672 | v2/crates/wifi-densepose-sensing-server/src/main.rs:12974-12989 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 6) v2/crates/wifi-densepose-privshield/src/attacker.rs:76— v2/crates/wifi-densepose-privshield/src/attacker.rs:76-90 | v2/crates/wifi-densepose-privshield/src/attacker.rs:191-205 | v2/crates/wifi-densepose-privshield/src/attacker.rs:294-308 | wifi-veil/src/attacker.rs:76-90 | wifi-veil/src/attacker.rs:191-205 | wifi-veil/src/attacker.rs:294-308 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/attacker.rs` and `wifi-veil/src/attacker.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 5) v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:337— v2/crates/wifi-densepose-wasm-edge/src/exo_gesture_language.rs:337-351 | v2/crates/wifi-densepose-wasm-edge/src/gesture.rs:216-230 | v2/crates/wifi-densepose-wasm-edge/src/lrn_dtw_gesture_learn.rs:401-415 | v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:318-332 | v2/crates/wifi-densepose-wasm-edge/src/vendor_common.rs:361-375 — there are 5 copies across 4 file(s) — more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 5 sites; resolving a subset leaves the remainder to drift apart.
Duplicated block (13–15 lines × 2) v2/crates/ruview-cognitum-spaces/src/lib.rs:429— v2/crates/ruview-cognitum-spaces/src/lib.rs:429-441 | v2/crates/ruview-cognitum-spaces/src/lib.rs:483-497 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11–13 lines × 3) REDACTED:502— REDACTED:502-512 | v2/crates/wifi-densepose-signal/src/ruvsense/pose_tracker.rs:644-656 | v2/crates/wifi-densepose-wifiscan/src/pipeline/fingerprint_matcher.rs:168-180 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (10–13 lines × 3) v2/crates/wifi-densepose-ruvector/src/coverage.rs:259— v2/crates/wifi-densepose-ruvector/src/coverage.rs:259-269 | v2/crates/wifi-densepose-ruvector/src/coverage.rs:327-336 | v2/crates/wifi-densepose-ruvector/src/coverage.rs:387-399 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (11–12 lines × 4) v2/crates/wifi-densepose-sensing-server/src/main.rs:5130— v2/crates/wifi-densepose-sensing-server/src/main.rs:5130-5141 | v2/crates/wifi-densepose-sensing-server/src/main.rs:5297-5307 | v2/crates/wifi-densepose-sensing-server/src/main.rs:12721-12732 | v2/crates/wifi-densepose-sensing-server/src/main.rs:13217-13228 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10–11 lines × 3) v2/crates/wifi-densepose-sensing-server/src/main.rs:7601— v2/crates/wifi-densepose-sensing-server/src/main.rs:7601-7610 | v2/crates/wifi-densepose-sensing-server/src/pose.rs:268-277 | v2/crates/wifi-densepose-signal/src/ruvsense/pose_tracker.rs:1022-1032 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/main.rs` and `v2/crates/wifi-densepose-sensing-server/src/pose.rs` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 226 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (8–11 lines × 2) v2/crates/wifi-densepose-train/src/dataset.rs:356— v2/crates/wifi-densepose-train/src/dataset.rs:356-363 | v2/crates/wifi-densepose-train/src/dataset.rs:369-379 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 8) v2/crates/wifi-densepose-cli/src/calibrate.rs:256— v2/crates/wifi-densepose-cli/src/calibrate.rs:256-264 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:162-170 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:235-243 | v2/crates/wifi-densepose-sensing-server/src/csi.rs:284-292 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3405-3413 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3488-3496 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3566-3574 | v2/crates/wifi-densepose-sensing-server/src/main.rs:3712-3737 — before extracting anything, compare `v2/crates/wifi-densepose-sensing-server/src/csi.rs` and `v2/crates/wifi-densepose-sensing-server/src/main.rs` as WHOLE FILES: this scan already matched 34 separate duplicated blocks between them, totalling at least 938 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 6) v2/crates/wifi-densepose-privshield/src/attacker.rs:124— v2/crates/wifi-densepose-privshield/src/attacker.rs:124-132 | v2/crates/wifi-densepose-privshield/src/attacker.rs:224-232 | v2/crates/wifi-densepose-privshield/src/attacker.rs:330-338 | wifi-veil/src/attacker.rs:124-132 | wifi-veil/src/attacker.rs:224-232 | wifi-veil/src/attacker.rs:330-338 — before extracting anything, compare `v2/crates/wifi-densepose-privshield/src/attacker.rs` and `wifi-veil/src/attacker.rs` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 93 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
Duplicated block (7–8 lines × 3) v2/crates/ruview-placement/src/lib.rs:166— v2/crates/ruview-placement/src/lib.rs:166-172 | v2/crates/ruview-placement/src/plan.rs:50-56 | v2/crates/ruview-twin/src/lib.rs:145-152 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (1–8 lines × 3) v2/crates/wifi-densepose-signal/src/ruvsense/cross_room.rs:372— v2/crates/wifi-densepose-signal/src/ruvsense/cross_room.rs:372-379 | v2/crates/wifi-densepose-signal/src/ruvsense/longitudinal.rs:586-593 | v2/patches/ruvector-crv/src/stage_ii.rs:174-174 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (6–7 lines × 3) v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:237— v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs:237-243 | v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs:205-211 | v2/crates/wifi-densepose-wasm-edge/src/sig_flash_attention.rs:59-64 — before extracting anything, compare `v2/crates/wifi-densepose-wasm-edge/src/exo_ghost_hunter.rs` and `v2/crates/wifi-densepose-wasm-edge/src/exo_plant_growth.rs` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 65 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (53 lines × 2) v2/crates/wifi-densepose-privshield/src/linalg.rs:10— v2/crates/wifi-densepose-privshield/src/linalg.rs:10-62 | wifi-veil/src/linalg.rs:10-62 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (51–53 lines × 2) archive/v1/src/api/routers/stream.py:76— archive/v1/src/api/routers/stream.py:76-128 | archive/v1/src/api/routers/stream.py:191-241 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `archive/v1/src/api/routers/stream.py:245` calls `strip`, `split` and `archive/v1/src/api/routers/stream.py:131` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (30–32 lines × 2) references/script_4.py:140— references/script_4.py:140-171 | references/script_5.py:275-304 — before extracting anything, compare `references/script_4.py` and `references/script_5.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (24–30 lines × 2) scripts/check_health.py:63— scripts/check_health.py:63-92 | scripts/check_health.py:127-150 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (22–29 lines × 2) scripts/train-count.py:220— scripts/train-count.py:220-241 | scripts/train-count.py:591-619 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `scripts/train-count.py:589` calls `perf_counter` and `scripts/train-count.py:219` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (28 lines × 2) archive/v1/src/api/dependencies.py:182— archive/v1/src/api/dependencies.py:182-209 | archive/v1/src/api/dependencies.py:222-249 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (26 lines × 3) archive/v1/src/services/health_check.py:251— archive/v1/src/services/health_check.py:251-276 | archive/v1/src/services/health_check.py:292-317 | archive/v1/src/services/health_check.py:333-358 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `archive/v1/src/services/health_check.py:251` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (25–26 lines × 2) archive/v1/src/middleware/error_handler.py:115— archive/v1/src/middleware/error_handler.py:115-140 | archive/v1/src/middleware/error_handler.py:156-180 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `exc` to `RequestValidationError` in one and `ValidationError` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
Duplicated block (18–24 lines × 3) scripts/train-count.py:236— scripts/train-count.py:236-254 | scripts/train-count.py:408-425 | scripts/train-count.py:611-634 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `scripts/train-count.py:426` calls `cross_entropy`, `item` and `scripts/train-count.py:255` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (24 lines × 2) archive/v1/src/tasks/backup.py:462— archive/v1/src/tasks/backup.py:462-485 | archive/v1/src/tasks/cleanup.py:466-489 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17–21 lines × 3) references/script.py:23— references/script.py:23-43 | references/script_2.py:23-43 | references/script_4.py:21-37 — before extracting anything, compare `references/script.py` and `references/script_2.py` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (21 lines × 3) references/script.py:60— references/script.py:60-80 | references/script_2.py:63-83 | references/script_4.py:56-76 — before extracting anything, compare `references/script.py` and `references/script_2.py` as WHOLE FILES: 92% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 2 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (15–21 lines × 2) archive/v1/src/app.py:245— archive/v1/src/app.py:245-265 | archive/v1/src/app.py:274-288 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `archive/v1/src/app.py:245` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (14–18 lines × 5) archive/v1/src/services/health_check.py:141— archive/v1/src/services/health_check.py:141-157 | archive/v1/src/services/health_check.py:181-198 | archive/v1/src/services/health_check.py:264-277 | archive/v1/src/services/health_check.py:305-318 | archive/v1/src/services/health_check.py:346-359 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `archive/v1/src/services/health_check.py:141` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15–17 lines × 3) archive/v1/src/middleware/error_handler.py:191— archive/v1/src/middleware/error_handler.py:191-205 | archive/v1/src/middleware/error_handler.py:228-244 | archive/v1/src/middleware/error_handler.py:260-276 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (15–16 lines × 2) scripts/mmwave_fusion_bridge.py:71— scripts/mmwave_fusion_bridge.py:71-86 | scripts/mmwave_fusion_bridge.py:111-125 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 6) archive/v1/src/services/health_check.py:147— archive/v1/src/services/health_check.py:147-160 | archive/v1/src/services/health_check.py:188-201 | archive/v1/src/services/health_check.py:226-239 | archive/v1/src/services/health_check.py:267-280 | archive/v1/src/services/health_check.py:308-321 | archive/v1/src/services/health_check.py:349-362 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 3) archive/v1/src/tasks/backup.py:472— archive/v1/src/tasks/backup.py:472-485 | archive/v1/src/tasks/cleanup.py:476-489 | archive/v1/src/tasks/monitoring.py:664-677 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11–14 lines × 2) firmware/esp32-csi-node/provision.py:895— firmware/esp32-csi-node/provision.py:895-905 | scripts/provision.py:211-224 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `scripts/provision.py:211` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–13 lines × 4) examples/research-sota/03-spatial-intelligence/r5_subcarrier_saliency.py:39— examples/research-sota/03-spatial-intelligence/r5_subcarrier_saliency.py:39-51 | examples/research-sota/04-rssi/r8_rssi_only_count.py:39-47 | examples/research-sota/04-rssi/r9_rssi_fingerprint_knn.py:42-50 | scripts/train-count.py:69-77 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10–12 lines × 3) scripts/train-count.py:272— scripts/train-count.py:272-283 | scripts/train-count.py:484-493 | scripts/train-count.py:675-686 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (2–11 lines × 6) REDACTED:26— REDACTED:26-27 | REDACTED:48-58 | REDACTED:80-90 | REDACTED:125-132 | REDACTED:161-168 | REDACTED:187-194 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:48` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:58` calls `Column`, `UUID` and `REDACTED:27` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8–10 lines × 2) references/script_4.py:188— references/script_4.py:188-195 | references/script_5.py:219-228 — before extracting anything, compare `references/script_4.py` and `references/script_5.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 77 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 5) examples/research-sota/03-spatial-intelligence/r5_subcarrier_saliency.py:45— examples/research-sota/03-spatial-intelligence/r5_subcarrier_saliency.py:45-53 | examples/research-sota/04-rssi/r8_rssi_only_count.py:41-49 | examples/research-sota/04-rssi/r9_rssi_fingerprint_knn.py:44-52 | examples/research-sota/06-structure-detection/r12_rf_weather_eigenshift.py:51-59 | scripts/train-count.py:71-79 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 5 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 5 times. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (4–6 lines × 4) scripts/qemu_swarm.py:386— scripts/qemu_swarm.py:386-389 | scripts/qemu_swarm.py:409-414 | scripts/qemu_swarm.py:421-426 | scripts/qemu_swarm.py:451-456 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `scripts/qemu_swarm.py:409` calls `_run_ip` and `scripts/qemu_swarm.py:386` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication· Edited copy of a member (9 corresponding lines) · ×1
Edited copy of a member (9 corresponding lines) examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:51— examples/research-sota/02-placement/r6_2_2_1_3d_multistatic.py:51-59 | examples/research-sota/02-placement/r6_2_4_3d_chest_multistatic.py:48-56 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
Duplicated block (15–25 lines × 3) examples/research-sota/04-rssi/r9_rssi_fingerprint_knn.py:125— examples/research-sota/04-rssi/r9_rssi_fingerprint_knn.py:125-139 | examples/research-sota/05-cross-room-reid/r3_2_embedding_physics_env.py:206-226 | examples/research-sota/06-structure-detection/r12_rf_weather_eigenshift.py:153-177 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 3 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 3 times.
Duplicated block (10–11 lines × 2) examples/research-sota/09-quantum-fusion/r20_1_quantum_classical_fusion.py:118— examples/research-sota/09-quantum-fusion/r20_1_quantum_classical_fusion.py:118-128 | examples/research-sota/09-quantum-fusion/r20_2_threshold_handoff.py:60-69 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6–8 lines × 2) examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:119— examples/research-sota/05-cross-room-reid/r3_1_physics_informed_env.py:119-126 | examples/research-sota/05-cross-room-reid/r3_2_embedding_physics_env.py:121-126 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
CI formatting step cannot fail .github/workflows/ruforecast-ci.yml:164— `cargo +1.89.0 fmt` invokes cargo fmt in the mode that REWRITES the files it reformats and exits 0 whatever it changed. The rewrite happens inside the runner's throwaway checkout and is then discarded, so the step passes on a badly-formatted change exactly as it passes on a clean one — it enforces nothing, and no other step in this file reads the result. `--check` is the flag that turns the same invocation into a gate: it leaves the files alone and exits non-zero when anything would have been reformatted.
Duplication concentrated across 6 sibling directories (18 clone groups) ui/components/scene.js:55— 18 duplicated blocks under ui/ have copies in at least two of the sibling directories components, mobile, observatory, pose-fusion, services, utils — 13 of them are reported below, and 5 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 18 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 18 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 18 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 8 sibling directories (17 clone groups) harness/wifi-densepose-privshield/bin/cli.js:26— 17 duplicated blocks under the repository root have copies in at least two of the sibling directories harness, integrations, references, scripts, tools, ui (+2 more sibling(s) not listed) — 12 of them are reported below, and 5 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 17 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 17 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 17 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 3 sibling directories (17 clone groups) harness/homecore/src/guidance.js:13— 17 duplicated blocks under harness/ have copies in at least two of the sibling directories homecore, ruview, ruview-kernel — 16 of them are reported below, and 1 is counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 17 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 17 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 17 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
Duplication concentrated across 3 sibling directories (6 clone groups) v2/crates/wifi-densepose-desktop/ui/src/components/NodeCard.tsx:125— 6 duplicated blocks under v2/crates/wifi-densepose-desktop/ui/src/ have copies in at least two of the sibling directories components, hooks, pages — 3 of them are reported below, and 3 are counted here but not reported individually: those copies match on shape but no longer clear R10's bar for an individually reported row — either they kept neither their own names nor their values, or what was copied is too small to stand on its own (it reports near-exact duplication only, and only of substantial extent). What this row states is the concentration, which the detector measured over all 6 and which does not depend on how exactly each block's copies still match. That concentration is one structural fact, not 6 local ones: the siblings replicate behaviour none of them owns, which is the shape of a missing shared module — a common library every sibling imports — rather than 6 separate extractions. Check first whether the siblings are deliberately standalone deliverables (scaffold templates, demo apps that must stay copy-pasteable); where they are, the duplication is the design and the per-block rows are the ones to act on.
R10 · Code Duplication· Duplicated block with local edits (278 matched lines × 2 locations) · ×1
Duplicated block with local edits (278 matched lines × 2 locations) REDACTED:1147— REDACTED:1147 · REDACTED:451 — the two spans are one implementation copied and then locally edited — 2856 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (251 matched lines × 2 locations) · ×1
Duplicated block with local edits (251 matched lines × 2 locations) scripts/device-fingerprint.js:50— scripts/device-fingerprint.js:50 · scripts/through-wall-detector.js:51 — the two spans are one implementation copied and then locally edited — 1805 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (210 matched lines × 2 locations) · ×1
Duplicated block with local edits (210 matched lines × 2 locations) REDACTED:2024— REDACTED:2024 · REDACTED:1358 — the two spans are one implementation copied and then locally edited — 2055 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (169 matched lines × 2 locations) · ×1
Duplicated block with local edits (169 matched lines × 2 locations) REDACTED:1696— REDACTED:1696 · REDACTED:1018 — the two spans are one implementation copied and then locally edited — 1679 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Wholesale file copy (159 identical lines × 2 files) harness/wifi-densepose-privshield/bin/cli.js:26— harness/wifi-densepose-privshield/bin/cli.js:26 · wifi-veil/harness/bin/cli.js:26 — these 2 files are line-for-line copies of one another — 159 lines are identical, in the same order, in every one of them — so this is one fact about the file set, not a block to extract. An edit made to one file and not the others changes behaviour silently, which is the failure a wholesale copy guarantees. Pick one file as the single source and derive the others from it (re-export it, spread it into the local overrides each variant genuinely needs, or generate the copies at build time) — the few lines that differ between the files are exactly the part each variant should still own. Check first whether the copies are deliberately standalone deliverables (a translation file seeded from its sibling and waiting to be translated); where they are, the duplication is the design, and the honest move is to mark the seeded file as untranslated rather than to let it pass as done.
R10 · Code Duplication· Duplicated block with local edits (159 matched lines × 2 locations) · ×1
Duplicated block with local edits (159 matched lines × 2 locations) scripts/passive-radar.js:359— scripts/passive-radar.js:359 · scripts/rf-tomography.js:239 — the two spans are one implementation copied and then locally edited — 1181 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (112 lines × 2 locations) harness/homecore/src/guidance.js:13— harness/homecore/src/guidance.js:13 · harness/ruview/src/guidance.js:368 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (97 matched lines × 2 locations) · ×1
Duplicated block with local edits (97 matched lines × 2 locations) harness/homecore/src/brain.js:9— harness/homecore/src/brain.js:9 · harness/ruview/src/brain.js:10 — the two spans are one implementation copied and then locally edited — 1336 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (75 matched lines × 2 locations) · ×1
Duplicated block with local edits (75 matched lines × 2 locations) scripts/csi-graph-visualizer.js:43— scripts/csi-graph-visualizer.js:43 · scripts/mincut-person-counter.js:47 — the two spans are one implementation copied and then locally edited — 719 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (71 matched lines × 2 locations) · ×1
Duplicated block with local edits (71 matched lines × 2 locations) scripts/gait-analyzer.js:47— scripts/gait-analyzer.js:47 · scripts/stress-monitor.js:43 — the two spans are one implementation copied and then locally edited — 630 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (66 matched lines × 2 locations) · ×1
Duplicated block with local edits (66 matched lines × 2 locations) tools/ruview-mcp/src/tools/count-infer.ts:18— tools/ruview-mcp/src/tools/count-infer.ts:18 · tools/ruview-mcp/src/tools/pose-infer.ts:20 — the two spans are one implementation copied and then locally edited — 332 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (64 matched lines × 2 locations) · ×1
Duplicated block with local edits (64 matched lines × 2 locations) scripts/material-detector.js:368— scripts/material-detector.js:368 · scripts/room-fingerprint.js:369 — the two spans are one implementation copied and then locally edited — 384 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (62 matched lines × 2 locations) · ×1
Duplicated block with local edits (62 matched lines × 2 locations) scripts/device-fingerprint.js:543— scripts/device-fingerprint.js:543 · scripts/material-classifier.js:491 — the two spans are one implementation copied and then locally edited — 463 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (57 lines × 2 locations) REDACTED:314— REDACTED:314 · REDACTED:115 — the 2 copies sit in sibling files in one directory, so check first whether one of them (or an existing module there) already owns this behaviour and the others should call it; otherwise extract it into one module in that directory and have each site call it.
R10 · Code Duplication· Duplicated block with local edits (53 matched lines × 2 locations) · ×1
Duplicated block with local edits (53 matched lines × 2 locations) scripts/rf-tomography.js:462— scripts/rf-tomography.js:462 · scripts/through-wall-detector.js:456 — the two spans are one implementation copied and then locally edited — 378 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (50 matched lines × 2 locations) · ×1
Duplicated block with local edits (50 matched lines × 2 locations) tools/ruview-mcp/src/tools/bfld-last-scan.ts:27— tools/ruview-mcp/src/tools/bfld-last-scan.ts:27 · tools/ruview-mcp/src/tools/bfld-subscribe.ts:34 — the two spans are one implementation copied and then locally edited — 216 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (49 matched lines × 2 locations) · ×1
Duplicated block with local edits (49 matched lines × 2 locations) REDACTED:2423— REDACTED:2423 · REDACTED:1692 — the two spans are one implementation copied and then locally edited — 590 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (49 lines × 2 locations) v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:285— v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:285 · v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:371 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (48 lines × 2 locations) scripts/material-classifier.js:499— scripts/material-classifier.js:499 · scripts/through-wall-detector.js:458 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (46 matched lines × 2 locations) · ×1
Duplicated block with local edits (46 matched lines × 2 locations) harness/homecore/src/policy.js:5— harness/homecore/src/policy.js:5 · REDACTED:13 — the two spans are one implementation copied and then locally edited — 552 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (45 lines × 2 locations) REDACTED:1357— REDACTED:1357 · REDACTED:377 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
Duplicated block (43 lines × 2 locations) harness/wifi-densepose-privshield/src/flywheel.ts:37— harness/wifi-densepose-privshield/src/flywheel.ts:37 · wifi-veil/harness/src/flywheel.ts:37 — the 2 copies are spread across 2 directories, so the shared home is a decision rather than an obvious spot: check first whether one of them already owns this behaviour, and otherwise put the extracted module somewhere all of the sites already reach rather than making one of them depend on another.
R10 · Code Duplication· Duplicated block with local edits (41 matched lines × 2 locations) · ×1
Duplicated block with local edits (41 matched lines × 2 locations) tools/ruview-cli/src/http.ts:7— tools/ruview-cli/src/http.ts:7 · tools/ruview-mcp/src/http.ts:11 — the two spans are one implementation copied and then locally edited — 342 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (39 lines × 2 locations) REDACTED:515— REDACTED:515 · REDACTED:353 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (37 matched lines × 2 locations) · ×1
Duplicated block with local edits (37 matched lines × 2 locations) scripts/csi-spectrogram.js:469— scripts/csi-spectrogram.js:469 · scripts/csi-spectrogram.js:580 — the two spans are one implementation copied and then locally edited — 311 tokens are still identical, in the same order in both spans, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (36 lines × 2 locations) v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1577— v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1577 · v2/crates/wifi-densepose-desktop/ui/src/pages/Nodes.tsx:119 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (34 matched lines × 2 locations) · ×1
Duplicated block with local edits (34 matched lines × 2 locations) tools/ruview-cli/src/commands/count.ts:31— tools/ruview-cli/src/commands/count.ts:31 · tools/ruview-cli/src/commands/pose.ts:26 — the two spans are one implementation copied and then locally edited — 259 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
R10 · Code Duplication· Duplicated block with local edits (33 matched lines × 2 locations) · ×1
Duplicated block with local edits (33 matched lines × 2 locations) ui/components/scene.js:55— ui/components/scene.js:55 · REDACTED:82 — the two spans are one implementation copied and then locally edited — 325 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (31 lines × 2 locations) scripts/train-wiflow-supervised.js:471— scripts/train-wiflow-supervised.js:471 · scripts/wiflow-model.js:89 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (30 matched lines × 2 locations) · ×1
Duplicated block with local edits (30 matched lines × 2 locations) ui/mobile/src/screens/VitalsScreen/BreathingGauge.tsx:8— ui/mobile/src/screens/VitalsScreen/BreathingGauge.tsx:8 · ui/mobile/src/screens/VitalsScreen/HeartRateGauge.tsx:9 — the two spans are one implementation copied and then locally edited — 264 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Duplicated block (29 lines × 2 locations) scripts/sleep-monitor.js:293— scripts/sleep-monitor.js:293 · scripts/stress-monitor.js:258 — the 2 copies are spread across 2 files, and the CITED SPAN is not a self-contained block — it runs from inside one construct into the next (the tail of a branch plus the head of the following one, a run of switch arms, the end of a declaration plus the list that follows it) rather than covering a whole unit. So do not lift these lines literally: no call can be substituted for a half-open construct. Extract the enclosing repeated UNIT instead — the whole function, component or branch these lines sit in — and where the repetition IS the construct (a run of switch arms, a stack of near-identical declarations) replace it with one table or registry looked up by key rather than a helper each arm calls. The copies still drift apart the first time only one of them is edited, which is why this is reported.
R10 · Code Duplication· Duplicated block with local edits (29 matched lines × 2 locations) · ×1
Duplicated block with local edits (29 matched lines × 2 locations) REDACTED:47— REDACTED:47 · REDACTED:178 — the two spans are one implementation copied and then locally edited — 156 tokens are still identical, in the same order in both files, with only local edits between them. The copies have already begun to drift, which is this row's finding: an edit made to one and not the other changes behaviour silently. Diff the two spans first to learn what genuinely differs, then extract the shared core into one module both sites use, passing the differences in as parameters — or, if one copy exists only because the other could not be imported from its context, make one of them the single source the other is generated or re-exported from. If one copy is no longer reachable, delete it rather than letting it shadow the live one.
Boundary violation [package:relative-cross-package] ui/pose-fusion/js/cnn-embedder.js:105— ui/pose-fusion/js/cnn-embedder.js:105 reaches into another package with a relative path (./ruvector_cnn_wasm.js) — import the package by name instead.
Complex function runDoctor (cyclomatic 98, cognitive 222) harness/ruview/src/doctor.js:63— runDoctor has cyclomatic complexity 98 and cognitive complexity 222; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function run (cyclomatic 96, cognitive 153) · ×1
Complex function run (cyclomatic 96, cognitive 153) harness/ruview/src/cli.js:243— run has cyclomatic complexity 96 and cognitive complexity 153; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 90, cognitive 175) · ×1
Complex function main (cyclomatic 90, cognitive 175) REDACTED:1703— main has cyclomatic complexity 90 and cognitive complexity 175; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parseSpacesOutput (cyclomatic 82, cognitive 71) harness/ruview/src/spaces.js:80— parseSpacesOutput has cyclomatic complexity 82 and cognitive complexity 71; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function generateWeakLabels (cyclomatic 69, cognitive 97) REDACTED:915— generateWeakLabels has cyclomatic complexity 69 and cognitive complexity 97; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function animate (cyclomatic 64, cognitive 140) ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx:447— animate has cyclomatic complexity 64 and cognitive complexity 140; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function _intrusionDetect (cyclomatic 64, cognitive 75) ui/observatory/js/demo-data.js:715— _intrusionDetect has cyclomatic complexity 64 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function run (cyclomatic 62, cognitive 87) · ×1
Complex function run (cyclomatic 62, cognitive 87) harness/homecore/bin/cli.js:103— run has cyclomatic complexity 62 and cognitive complexity 87; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function _searchRescue (cyclomatic 61, cognitive 69) ui/observatory/js/demo-data.js:1121— _searchRescue has cyclomatic complexity 61 and cognitive complexity 69; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 55, cognitive 101) · ×1
Complex function main (cyclomatic 55, cognitive 101) REDACTED:1025— main has cyclomatic complexity 55 and cognitive complexity 101; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function _fallEvent (cyclomatic 53, cognitive 55) ui/observatory/js/demo-data.js:444— _fallEvent has cyclomatic complexity 53 and cognitive complexity 55; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 51, cognitive 115) · ×1
Complex function main (cyclomatic 51, cognitive 115) REDACTED:483— main has cyclomatic complexity 51 and cognitive complexity 115; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function NetworkDiscovery (cyclomatic 51, cognitive 47) v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:43— NetworkDiscovery has cyclomatic complexity 51 and cognitive complexity 47; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function _securityPatrol (cyclomatic 45, cognitive 48) ui/observatory/js/demo-data.js:1521— _securityPatrol has cyclomatic complexity 45 and cognitive complexity 48; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function report (cyclomatic 43, cognitive 75) scripts/deep-scan.js:76— report has cyclomatic complexity 43 and cognitive complexity 75; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function drawSkeleton (cyclomatic 42, cognitive 56) ui/pose-fusion/js/canvas-renderer.js:33— drawSkeleton has cyclomatic complexity 42 and cognitive complexity 56; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function _elderlyCare (cyclomatic 42, cognitive 46) ui/observatory/js/demo-data.js:1247— _elderlyCare has cyclomatic complexity 42 and cognitive complexity 46; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R2 · Cyclomatic Complexity· Complex function main (cyclomatic 40, cognitive 83) · ×1
Complex function main (cyclomatic 40, cognitive 83) scripts/train-wiflow-supervised.js:1203— main has cyclomatic complexity 40 and cognitive complexity 83; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function parsePacket (cyclomatic 40, cognitive 53) harness/ruview/src/devices/esp32.js:111— parsePacket has cyclomatic complexity 40 and cognitive complexity 53; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive is at or above cyclomatic here, so the branching is nested or entangled rather than laid out side by side — extracting each decision into its own named function is the change that pays. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
Complex function OtaUpdate (cyclomatic 39, cognitive 30) v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:38— OtaUpdate has cyclomatic complexity 39 and cognitive complexity 30; this row is raised above a cyclomatic bar of 10. The two numbers answer different questions and the gap between them is what decides whether to act: cyclomatic counts the independent arms through the body, cognitive counts what it costs to hold them in your head, so nesting and mixed boolean chains raise it while a flat run of independent arms does not. Cognitive sits below cyclomatic here, so much of the count is breadth — arms side by side rather than stacked — and splitting per arm would leave a function per arm; group the work between the checks into named steps instead. Measured by this repository's own parse of the file, so a body assembled at runtime, or generated, is counted as written rather than as it executes.
R3 · Large Files· v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx · ×1
v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx: 1729 lines of code v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1— v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx has 1729 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/components/LiveDemoTab.js · ×1
ui/components/LiveDemoTab.js: 1640 lines of code ui/components/LiveDemoTab.js:1— ui/components/LiveDemoTab.js has 1640 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/observatory/js/demo-data.js · ×1
ui/observatory/js/demo-data.js: 1626 lines of code ui/observatory/js/demo-data.js:1— ui/observatory/js/demo-data.js has 1626 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/components/PoseDetectionCanvas.js · ×1
ui/components/PoseDetectionCanvas.js: 1316 lines of code ui/components/PoseDetectionCanvas.js:1— ui/components/PoseDetectionCanvas.js has 1316 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx · ×1
v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx: 1210 lines of code v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:1— v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx has 1210 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/components/SettingsPanel.js · ×1
ui/components/SettingsPanel.js: 851 lines of code ui/components/SettingsPanel.js:1— ui/components/SettingsPanel.js has 851 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx · ×1
v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx: 682 lines of code v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx:1— v2/crates/wifi-densepose-desktop/ui/src/pages/Sensing.tsx has 682 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx · ×1
ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx: 663 lines of code ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx:1— ui/mobile/src/screens/LiveScreen/GaussianSplatWebView.web.tsx has 663 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/observatory/js/scenario-props.js · ×1
ui/observatory/js/scenario-props.js: 655 lines of code ui/observatory/js/scenario-props.js:1— ui/observatory/js/scenario-props.js has 655 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· harness/ruview/src/tools.js · ×1
harness/ruview/src/tools.js: 645 lines of code harness/ruview/src/tools.js:1— harness/ruview/src/tools.js has 645 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· dashboard/src/components/nv-ghost-murmur.ts · ×1
dashboard/src/components/nv-ghost-murmur.ts: 642 lines of code dashboard/src/components/nv-ghost-murmur.ts:1— dashboard/src/components/nv-ghost-murmur.ts has 642 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/services/pose.service.js · ×1
ui/services/pose.service.js: 639 lines of code ui/services/pose.service.js:1— ui/services/pose.service.js has 639 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx · ×1
v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx: 639 lines of code v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx:1— v2/crates/wifi-densepose-desktop/ui/src/pages/MeshView.tsx has 639 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 634 lines of code REDACTED:1— REDACTED has 634 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
ui/utils/pose-renderer.js: 629 lines of code ui/utils/pose-renderer.js:1— ui/utils/pose-renderer.js has 629 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_browser.js · ×1
ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_browser.js: 598 lines of code ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_browser.js:1— ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_browser.js has 598 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/components/body-model.js · ×1
ui/components/body-model.js: 562 lines of code ui/components/body-model.js:1— ui/components/body-model.js has 562 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/services/sensing.service.js · ×1
ui/services/sensing.service.js: 554 lines of code ui/services/sensing.service.js:1— ui/services/sensing.service.js has 554 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx · ×1
v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx: 544 lines of code v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx:1— v2/crates/wifi-densepose-desktop/ui/src/pages/OtaUpdate.tsx has 544 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/services/websocket.service.js · ×1
ui/services/websocket.service.js: 536 lines of code ui/services/websocket.service.js:1— ui/services/websocket.service.js has 536 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· harness/ruview/src/guidance.js · ×1
harness/ruview/src/guidance.js: 512 lines of code harness/ruview/src/guidance.js:1— harness/ruview/src/guidance.js has 512 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/observatory/js/hud-controller.js · ×1
ui/observatory/js/hud-controller.js: 504 lines of code ui/observatory/js/hud-controller.js:1— ui/observatory/js/hud-controller.js has 504 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/pose-fusion/js/pose-decoder.js · ×1
ui/pose-fusion/js/pose-decoder.js: 490 lines of code ui/pose-fusion/js/pose-decoder.js:1— ui/pose-fusion/js/pose-decoder.js has 490 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/observatory/js/pose-system.js · ×1
ui/observatory/js/pose-system.js: 487 lines of code ui/observatory/js/pose-system.js:1— ui/observatory/js/pose-system.js has 487 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· harness/ruview/src/devices/esp32.js · ×1
harness/ruview/src/devices/esp32.js: 482 lines of code harness/ruview/src/devices/esp32.js:1— harness/ruview/src/devices/esp32.js has 482 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/observatory/js/figure-pool.js · ×1
ui/observatory/js/figure-pool.js: 461 lines of code ui/observatory/js/figure-pool.js:1— ui/observatory/js/figure-pool.js has 461 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· dashboard/src/components/nv-help.ts · ×1
dashboard/src/components/nv-help.ts: 439 lines of code dashboard/src/components/nv-help.ts:1— dashboard/src/components/nv-help.ts has 439 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
REDACTED: 438 lines of code REDACTED:1— REDACTED has 438 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· dashboard/src/components/nv-inspector.ts · ×1
dashboard/src/components/nv-inspector.ts: 419 lines of code dashboard/src/components/nv-inspector.ts:1— dashboard/src/components/nv-inspector.ts has 419 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
ui/app.js: 417 lines of code ui/app.js:1— ui/app.js has 417 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/components/environment.js · ×1
ui/components/environment.js: 416 lines of code ui/components/environment.js:1— ui/components/environment.js has 416 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
harness/ruview/src/cli.js: 403 lines of code harness/ruview/src/cli.js:1— harness/ruview/src/cli.js has 403 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/components/TrainingPanel.js · ×1
ui/components/TrainingPanel.js: 403 lines of code ui/components/TrainingPanel.js:1— ui/components/TrainingPanel.js has 403 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· dashboard/src/components/nv-onboarding.ts · ×1
dashboard/src/components/nv-onboarding.ts: 402 lines of code dashboard/src/components/nv-onboarding.ts:1— dashboard/src/components/nv-onboarding.ts has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
R3 · Large Files· ui/components/signal-viz.js · ×1
ui/components/signal-viz.js: 402 lines of code ui/components/signal-viz.js:1— ui/components/signal-viz.js has 402 significant lines (blank lines excluded), over the 400-line bar, and contains logic — a file this long is usually several responsibilities in one module.
Dead file (~221 LoC) ui/observatory/js/convergence-engine.js— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~187 LoC) ui/observatory/js/vitals-oracle.js— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~178 LoC) ui/observatory/js/presence-cartography.js— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~170 LoC) ui/observatory/js/phase-constellation.js— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~166 LoC) v2/crates/wifi-densepose-desktop/ui/src/components/NodeCard.tsx— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~163 LoC) ui/observatory/js/subcarrier-manifold.js— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~152 LoC) v2/crates/wifi-densepose-desktop/ui/src/components/Sidebar.tsx— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~121 LoC) ui/observatory/js/holographic-panel.js— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~97 LoC) ui/mobile/src/screens/LiveScreen/useGaussianBridge.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~38 LoC) ui/mobile/jest.setup.pre.js— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~27 LoC) scripts/pose-physics/verify-harness-tests.mjs— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~24 LoC) ui/mobile/jest.setup.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~17 LoC) ui/mobile/src/types/navigation.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Dead file (~0 LoC) ui/mobile/src/hooks/useWebViewBridge.ts— no import path from any entry point (168 application, 70 tooling, 134 test roots considered), and no other file in the scanned tree imports it — nothing in-repo names this module at all, which is the strongest form of this claim the import graph can make
Unused dependency '@metaharness/darwin' — Declared in harness/ruview/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'metaharness' — Declared in harness/ruview/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Unused dependency 'react-native-web' — Declared in ui/mobile/package.json but never imported anywhere in that package or its workspace members — no static import reaches it. Usually that is dead weight and attack surface, but two shapes are indistinguishable from source and are NOT dead: an optional or native peer that another dependency loads dynamically at runtime, and a package a build, docs or test step installs and invokes separately. Confirm which of the three this is before removing it.
Third-party script without Subresource Integrity ui/mobile/src/assets/webview/gaussian-splats.html:34— `https://cdnjs.cloudflare.com/ajax/libs/three.js/r165/three.min.js` is executed by this page with no Subresource Integrity. Whoever can answer that request — the CDN, anyone who compromises it, anyone on the network path — runs arbitrary script in this page's origin, with its session. The URL also names no version, so it resolves to whatever that origin serves at fetch time — the executed bytes can change with nobody touching this repository. 7 such include(s) across the repository's markup.
X1 · Async correctness· Task from `asyncio.create_task` is not kept · ×1
Task from `asyncio.create_task` is not kept archive/v1/src/main.py:28— The task this creates is not kept anywhere. The event loop holds only a weak reference to its tasks, so a task nobody references can be garbage-collected before it finishes (Python's documentation for `asyncio.create_task`: save a reference to the result); and nothing ever awaits it, so an exception it raises is never handled — it surfaces, if at all, as "Task exception was never retrieved" in a log. Keep the task: `await` it, gather it, start it in an `asyncio.TaskGroup` (`async with asyncio.TaskGroup() as tg: tg.create_task(…)`), or, for genuine fire-and-forget, add it to a set and `task.add_done_callback(tasks.discard)` with a callback that also reads its exception.
X14 · Bypassable address classification· IP classification is bypassable through an IPv4-in-IPv6 embedding · ×1
IP classification is bypassable through an IPv4-in-IPv6 embedding harness/ruview/src/devices/esphome.js:112— This function unwraps IPv4-MAPPED IPv6 (`::ffff:`, line 114) and then rejects `10.0.0.0/8` on its IPv4 path — but the IPv6 decision at line 112 classifies the address as written, and IPv4 reaches IPv6 through three MORE embeddings this function never mentions: IPv4-compatible (`::a.b.c.d`), 6to4 (`2002::/16`) and NAT64 (`64:ff9b::/96`). So `::10.0.0.1`, `2002:0a00:0001::` and `64:ff9b::10.0.0.0` all name a host inside `10.0.0.0/8` — the range this same function declares non-public — and all reach the IPv6 decision un-unwrapped, taking the opposite verdict. Unwrap every embedding to its IPv4 form before classifying, or reject any IPv6 address carrying an embedded IPv4 outright.
Classify ADR enforcement: ADR-001: WiFi-Mat Disaster Detection Architecture docs/adr/ADR-001-wifi-mat-disaster-detection.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-002: RuVector RVF Integration Strategy docs/adr/ADR-002-ruvector-rvf-integration-strategy.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-003: RVF Cognitive Containers for CSI Data docs/adr/ADR-003-rvf-cognitive-containers-csi.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-004: HNSW Vector Search for Signal Fingerprinting docs/adr/ADR-004-hnsw-vector-search-fingerprinting.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-005: SONA Self-Learning for Pose Estimation docs/adr/ADR-005-sona-self-learning-pose-estimation.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-006: GNN-Enhanced CSI Pattern Recognition docs/adr/ADR-006-gnn-enhanced-csi-pattern-recognition.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-007: Post-Quantum Cryptography for Secure Sensing docs/adr/ADR-007-post-quantum-cryptography-secure-sensing.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-008: Distributed Consensus for Multi-AP Coordination docs/adr/ADR-008-distributed-consensus-multi-ap.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-009: RVF WASM Runtime for Edge Deployment docs/adr/ADR-009-rvf-wasm-runtime-edge-deployment.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-010: Witness Chains for Audit Trail Integrity docs/adr/ADR-010-witness-chains-audit-trail-integrity.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-011: Python Proof-of-Reality and Mock Elimination docs/adr/ADR-011-python-proof-of-reality-mock-elimination.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-012: ESP32 CSI Sensor Mesh for Distributed Sensing docs/adr/ADR-012-esp32-csi-sensor-mesh.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-013: Feature-Level Sensing on Commodity Gear (Option 3) docs/adr/ADR-013-feature-level-sensing-commodity-gear.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-014: SOTA Signal Processing Algorithms for WiFi Sensing docs/adr/ADR-014-sota-signal-processing.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-015: Public Dataset Strategy for Trained Pose Estimation Model docs/adr/ADR-015-public-dataset-training-strategy.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-016: RuVector Integration for Training Pipeline docs/adr/ADR-016-ruvector-integration.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-017: RuVector Integration for Signal Processing and MAT Crates docs/adr/ADR-017-ruvector-signal-mat-integration.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-018: ESP32 Development Implementation Path docs/adr/ADR-018-esp32-dev-implementation.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-019: Sensing-Only UI Mode with Gaussian Splat Visualization docs/adr/ADR-019-sensing-only-ui-mode.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-020: Migrate AI/Model Inference to Rust with RuVector and ONNX Runtime docs/adr/ADR-020-rust-ruvector-ai-model-migration.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-021: Vital Sign Detection via rvdna Signal Processing Pipeline docs/adr/ADR-021-vital-sign-detection-rvdna-pipeline.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-022: Enhanced Windows WiFi DensePose Fidelity via RuVector Multi-BSSID Pipeline docs/adr/ADR-022-windows-wifi-enhanced-fidelity-ruvector.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-023: Trained DensePose Model with RuVector Signal Intelligence Pipeline docs/adr/ADR-023-trained-densepose-model-ruvector-pipeline.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-024: Project AETHER -- Contrastive CSI Embedding Model via CsiToPoseTransformer Backbone docs/adr/ADR-024-contrastive-csi-embedding-model.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
Classify ADR enforcement: ADR-025: macOS CoreWLAN WiFi Sensing via Swift Helper Bridge docs/adr/ADR-025-macos-corewlan-wifi-sensing.md— This record carries no `enforcement:` field, so nothing says whether the decision is checked by anything or is upheld by convention alone — and an unclassified record is counted as UNENFORCED in this dimension's score, which is the same bucket as a rule known to have no check behind it. If this is a mechanizable rule, add an analyzer/test (or `enforcement: analyzer|test`); if it's a design decision, mark `enforcement: not-applicable` so it isn't counted as unenforced.
ADR declares no status docs/adr/ADR-019-sensing-only-ui-mode.md:1— `docs/adr/ADR-019-sensing-only-ui-mode.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-020-rust-ruvector-ai-model-migration.md:1— `docs/adr/ADR-020-rust-ruvector-ai-model-migration.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-021-vital-sign-detection-rvdna-pipeline.md:1— `docs/adr/ADR-021-vital-sign-detection-rvdna-pipeline.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-022-windows-wifi-enhanced-fidelity-ruvector.md:1— `docs/adr/ADR-022-windows-wifi-enhanced-fidelity-ruvector.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-024-contrastive-csi-embedding-model.md:1— `docs/adr/ADR-024-contrastive-csi-embedding-model.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-025-macos-corewlan-wifi-sensing.md:1— `docs/adr/ADR-025-macos-corewlan-wifi-sensing.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-027-cross-environment-domain-generalization.md:1— `docs/adr/ADR-027-cross-environment-domain-generalization.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-029-ruvsense-multistatic-sensing-mode.md:1— `docs/adr/ADR-029-ruvsense-multistatic-sensing-mode.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-030-ruvsense-persistent-field-model.md:1— `docs/adr/ADR-030-ruvsense-persistent-field-model.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-031-ruview-sensing-first-rf-mode.md:1— `docs/adr/ADR-031-ruview-sensing-first-rf-mode.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-033-crv-signal-line-sensing-integration.md:1— `docs/adr/ADR-033-crv-signal-line-sensing-integration.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-034-expo-mobile-app.md:1— `docs/adr/ADR-034-expo-mobile-app.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-038-sublinear-goal-oriented-action-planning.md:1— `docs/adr/ADR-038-sublinear-goal-oriented-action-planning.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-048-adaptive-csi-classifier.md:1— `docs/adr/ADR-048-adaptive-csi-classifier.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-049-cross-platform-wifi-interface-detection.md:1— `docs/adr/ADR-049-cross-platform-wifi-interface-detection.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-052-tauri-desktop-frontend.md:1— `docs/adr/ADR-052-tauri-desktop-frontend.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-053-ui-design-system.md:1— `docs/adr/ADR-053-ui-design-system.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-057-firmware-csi-build-guard.md:1— `docs/adr/ADR-057-firmware-csi-build-guard.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-061-qemu-esp32s3-firmware-testing.md:1— `docs/adr/ADR-061-qemu-esp32s3-firmware-testing.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-062-qemu-swarm-configurator.md:1— `docs/adr/ADR-062-qemu-swarm-configurator.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-068-per-node-state-pipeline.md:1— `docs/adr/ADR-068-per-node-state-pipeline.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-069-cognitum-seed-csi-pipeline.md:1— `docs/adr/ADR-069-cognitum-seed-csi-pipeline.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-070-self-supervised-pretraining.md:1— `docs/adr/ADR-070-self-supervised-pretraining.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-073-multifrequency-mesh-scan.md:1— `docs/adr/ADR-073-multifrequency-mesh-scan.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
ADR declares no status docs/adr/ADR-074-spiking-neural-csi-sensing.md:1— `docs/adr/ADR-074-spiking-neural-csi-sensing.md` declares no status, while 187 of the 319 other records in `docs/adr` do, so a reader cannot tell whether this decision is in force. Add a `Status:` line.
Interpolated log message defeats structured logging scripts/collect-training-data.py:215— `info` at line 215 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging scripts/collect-training-data.py:267— `info` at line 267 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging scripts/collect-training-data.py:287— `warning` at line 287 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging scripts/collect-training-data.py:310— `info` at line 310 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging scripts/collect-training-data.py:314— `info` at line 314 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging scripts/collect-training-data.py:348— `info` at line 348 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging scripts/collect-training-data.py:375— `info` at line 375 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging scripts/collect-training-data.py:386— `warning` at line 386 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/__init__.py:245— `debug` at line 245 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.debug("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.debug("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/app.py:47— `error` at line 47 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/app.py:160— `error` at line 160 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/app.py:264— `error` at line 264 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/app.py:288— `error` at line 288 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/app.py:321— `error` at line 321 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:126— `error` at line 126 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:159— `error` at line 159 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:191— `error` at line 191 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:241— `warning` at line 241 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.warning("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.warning("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:246— `error` at line 246 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:267— `info` at line 267 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:270— `error` at line 270 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:292— `info` at line 292 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:295— `error` at line 295 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.error("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.error("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:327— `info` at line 327 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
Interpolated log message defeats structured logging archive/v1/src/cli.py:332— `info` at line 332 is handed an f-string as its message, so the logger receives one finished string — the values in it cannot be queried, filtered or aggregated as fields, every occurrence reads as a different message, and the string is built even when the record is filtered out. Pass the values beside a constant message instead: `logger.info("order %s moved to %s", order_id, status)` with the standard library's `logging`, which keeps the message and its arguments apart on the record, or `log.info("order moved", order_id=order_id, status=status)` with structlog.
+ 15 more in this group — see findings.md.
P2 · Observability· Console output used as the logging channel · ×39
Console output used as the logging channel ui/app.js:42— `ui/app.js` reports through `console.*` at line 42 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:60— `ui/app.js` reports through `console.*` at line 60 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:63— `ui/app.js` reports through `console.*` at line 63 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:73— `ui/app.js` reports through `console.*` at line 73 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:83— `ui/app.js` reports through `console.*` at line 83 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:91— `ui/app.js` reports through `console.*` at line 91 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:95— `ui/app.js` reports through `console.*` at line 95 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:98— `ui/app.js` reports through `console.*` at line 98 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:140— `ui/app.js` reports through `console.*` at line 140 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:192— `ui/app.js` reports through `console.*` at line 192 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:284— `ui/app.js` reports through `console.*` at line 284 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:288— `ui/app.js` reports through `console.*` at line 288 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:301— `ui/app.js` reports through `console.*` at line 301 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:303— `ui/app.js` reports through `console.*` at line 303 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:310— `ui/app.js` reports through `console.*` at line 310 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:335— `ui/app.js` reports through `console.*` at line 335 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:380— `ui/app.js` reports through `console.*` at line 380 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:403— `ui/app.js` reports through `console.*` at line 403 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:407— `ui/app.js` reports through `console.*` at line 407 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:416— `ui/app.js` reports through `console.*` at line 416 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:423— `ui/app.js` reports through `console.*` at line 423 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/app.js:444— `ui/app.js` reports through `console.*` at line 444 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/sw.js:62— `ui/sw.js` reports through `console.*` at line 62 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/utils/backend-detector.js:23— `ui/utils/backend-detector.js` reports through `console.*` at line 23 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Console output used as the logging channel ui/utils/backend-detector.js:42— `ui/utils/backend-detector.js` reports through `console.*` at line 42 although other files in its module log through a logger. Console lines carry no level, fields or correlation and never reach the log pipeline.
Duplicated predicate harness/homecore/src/process-runner.js:105— `!Number.isSafeInteger(maxOutputBytes) || maxOutputBytes < 1` appears character-identically in 2 files — harness/homecore/src/process-runner.js, harness/ruview/src/process-runner.js. 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 scripts/csi-graph-visualizer.js:280— `!bestPartitionSide || bestPartitionSide.length === 0` appears character-identically in 2 files — scripts/csi-graph-visualizer.js, scripts/mincut-person-counter.js. 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 v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js:1464— `!element._store || element._store.validated || element.key != null` appears character-identically in 2 files — v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js, v2/crates/wifi-densepose-desktop/ui/.vite/deps/react_jsx-dev-runtime.js. 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 harness/homecore/src/guidance.js:53— `!input || typeof input !== 'object' || Array.isArray(input)` appears character-identically in 2 files — harness/homecore/src/guidance.js, harness/ruview/src/guidance.js. 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 harness/homecore/src/repo-trust.js:67— `!isWithin(trustAnchor, root) || root !== trustAnchor` appears character-identically in 2 files — harness/homecore/src/repo-trust.js, harness/ruview/src/repo-trust.js. 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 harness/homecore/src/guidance.js:56— `!options || typeof options !== 'object' || Array.isArray(options)` appears character-identically in 2 files — harness/homecore/src/guidance.js, harness/ruview/src/guidance.js. 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 harness/ruview/src/devices/lidar.js:81— `!packet || packet.type !== 'ruview.lidar.depth.v1'` appears character-identically in 2 files — harness/ruview/src/devices/lidar.js, integrations/iphone-lidar/web/codec.mjs. 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 ui/services/pose.service.js:403— `!poseData || typeof poseData !== 'object'` appears character-identically in 2 files — ui/services/pose.service.js, ui/utils/pose-renderer.js. 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 harness/homecore/src/brain.js:21— `!record || typeof record !== 'object' || Array.isArray(record)` appears character-identically in 2 files — harness/homecore/src/brain.js, harness/ruview/src/brain.js. 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 harness/homecore/src/brain.js:34— `!record.source || typeof record.source.path !== 'string' || !Number.isInteger(record.source.line) || record.source.line < 1` appears character-identically in 2 files — harness/homecore/src/brain.js, harness/ruview/src/brain.js. 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 v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js:35— `MAYBE_ITERATOR_SYMBOL && maybeIterable[MAYBE_ITERATOR_SYMBOL] || maybeIterable[FAUX_ITERATOR_SYMBOL]` appears character-identically in 2 files — v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js, v2/crates/wifi-densepose-desktop/ui/.vite/deps/react_jsx-dev-runtime.js. 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 harness/homecore/src/redact.js:24— `SECRET_KEY_RE.test(key) && typeof value === 'string' && value.length >= 6` appears character-identically in 2 files — harness/homecore/src/redact.js, harness/ruview/src/redact.js. 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 harness/homecore/src/brain.js:182— `String(input.contributor || '').trim() || 'unknown'` appears character-identically in 2 files — harness/homecore/src/brain.js, harness/ruview/src/brain.js. 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 harness/homecore/src/brain.js:98— `String(value).toLowerCase().match(/[a-z0-9][a-z0-9_-]{1,}/g) || []` appears character-identically in 4 files — harness/homecore/src/brain.js, harness/homecore/src/guidance.js, harness/ruview/src/brain.js, harness/ruview/src/guidance.js. 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 harness/homecore/src/process-runner.js:17— `allowed.has(key) && typeof value === 'string'` appears character-identically in 2 files — harness/homecore/src/process-runner.js, harness/ruview/src/process-runner.js. 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 harness/homecore/src/brain.js:123— `b.score - a.score || a.id.localeCompare(b.id)` appears character-identically in 2 files — harness/homecore/src/brain.js, harness/ruview/src/brain.js. 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 REDACTED:1201— `bestMatch && bestDist < config.positiveWindowSec` appears character-identically in 2 files — REDACTED, REDACTED. 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 v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js:1289— `c < 0 || sampleLines[s] !== controlLines[c]` appears character-identically in 2 files — v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js, v2/crates/wifi-densepose-desktop/ui/.vite/deps/react_jsx-dev-runtime.js. 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 ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js:1296— `cachedDataViewMemory0 === null || cachedDataViewMemory0.buffer.detached === true || (cachedDataViewMemory0.buffer.detached === undefined && …` appears character-identically in 2 files — ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js, ui/pose-fusion/pkg/ruvector_cnn_wasm/ruvector_cnn_wasm.js. 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 ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js:1304— `cachedFloat32ArrayMemory0 === null || cachedFloat32ArrayMemory0.byteLength === 0` appears character-identically in 2 files — ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js, ui/pose-fusion/pkg/ruvector_cnn_wasm/ruvector_cnn_wasm.js. 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 ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js:1317— `cachedUint8ArrayMemory0 === null || cachedUint8ArrayMemory0.byteLength === 0` appears character-identically in 2 files — ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js, ui/pose-fusion/pkg/ruvector_cnn_wasm/ruvector_cnn_wasm.js. 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 tools/ruview-cli/src/http.ts:48— `e instanceof Error && e.name === "AbortError"` appears character-identically in 2 files — tools/ruview-cli/src/http.ts, tools/ruview-mcp/src/http.ts. 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 v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js:1404— `error$1 instanceof Error && !(error$1.message in loggedTypeFailures)` appears character-identically in 2 files — v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js, v2/crates/wifi-densepose-desktop/ui/.vite/deps/react_jsx-dev-runtime.js. 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 REDACTED:1257— `firstHalf.length < 3 || secondHalf.length < 3` appears character-identically in 2 files — REDACTED, REDACTED. 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 v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js:1291— `fn.displayName && _frame.includes("<anonymous>")` appears character-identically in 2 files — v2/crates/wifi-densepose-desktop/ui/.vite/deps/chunk-JCH2SJW3.js, v2/crates/wifi-densepose-desktop/ui/.vite/deps/react_jsx-dev-runtime.js. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Silent fallback default in catch archive/v1/src/database/migrations/env.py:47— `get_database_url` swallows every exception into `return 'sqlite:///./data/wifi_densepose_fallback.db'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch wifi_densepose/__init__.py:94— `get_latest_poses` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch ui/mobile/src/screens/MATScreen/AlertCard.tsx:50— `formatTime` swallows every exception into `return 'Unknown'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch ui/pose-fusion/pkg/ruvector-attention/ruvector_attention_wasm.js:1266— `debugString` swallows every exception into `return 'Object'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch v2/crates/wifi-densepose-desktop/ui/src/pages/Nodes.tsx:165— `formatLastSeen` swallows every exception into `return "--"` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch v2/crates/wifi-densepose-desktop/ui/src/pages/NetworkDiscovery.tsx:1259— `formatLastSeen` swallows every exception into `return "--"` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch v2/crates/wifi-densepose-desktop/ui/src/pages/EdgeModules.tsx:1819— `formatLoadedAt` swallows every exception into `return "--"` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch v2/crates/wifi-densepose-desktop/ui/src/components/NodeCard.tsx:25— `formatLastSeen` swallows every exception into `return "--"` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on Err v2/crates/homecore-plugins/src/wasmtime_runtime.rs:225— `register_hc_state_get` turns every `Err` into `-1` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err v2/crates/ruview-kernel/src/wasm_abi.rs:23— `layout` turns every `Err` into `std::alloc::Layout::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err v2/crates/ruview-placement/src/coverage.rs:359— `build_links` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err v2/crates/wifi-densepose-sensing-server/src/adaptive_classifier.rs:410— `load_recording` turns every `Err` into `Vec::new()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err v2/crates/wifi-densepose-sensing-server/src/main.rs:1973— `load_runtime_config` turns every `Err` into `RuntimeConfig::default()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err v2/crates/ruview-kernel-napi/src/lib.rs:20— `call` turns every `Err` into `r#"{"ok":false,"error":{"code":"internal","message":"kernel panicked"}}"#.to_string()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
Silent fallback default on Err v2/crates/ruview-kernel-napi/src/lib.rs:31— `call_f64` turns every `Err` into `r#"{"ok":false,"error":{"code":"internal","message":"kernel panicked"}}"#.to_string()` — a failure becomes a plausible value and a silent behavior change with no trail. Log the error or propagate it with `?`. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the arm or in the doc comment, and the row stops firing.
README/code drift docs/validation/2026-08-31-esp32-c6-occupancy-integrity.md:44— docs/validation/2026-08-31-esp32-c6-occupancy-integrity.md names Node.js 4, but the repository declares engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20`, engines `>=20.0.0`, engines `>=20.0.0`, engines `>=20.0.0`. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift v2/crates/README.md:33— v2/crates/README.md links to `wifi-densepose-config/`, but `v2/crates/wifi-densepose-config` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift v2/crates/README.md:34— v2/crates/README.md links to `wifi-densepose-db/`, but `v2/crates/wifi-densepose-db` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift v2/crates/README.md:69— v2/crates/README.md links to `wifi-densepose-api/`, but `v2/crates/wifi-densepose-api` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
D20 · ADR Quality· ADR has no Context section · ×3
ADR has no Context section docs/adr/ADR-269-qualcomm-csi-wire-protocol.md:1— docs/adr/ADR-269-qualcomm-csi-wire-protocol.md has no Context section (a heading such as `## Context`, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds.
ADR has no Context section docs/adr/ADR-283-ruview-community-metaharness-flywheel.md:1— docs/adr/ADR-283-ruview-community-metaharness-flywheel.md has no Context section (a heading such as `## Context`, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds.
ADR has no Context section docs/adr/ADR-350-ruvector-predictive-memory-and-ruvllm-boundary.md:1— docs/adr/ADR-350-ruvector-predictive-memory-and-ruvllm-boundary.md has no Context section (a heading such as `## Context`, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds.
Silent fallback default on parse failure python/wifi_densepose/client/ws.py:70— `_select_header_kwarg` returns `'additional_headers'` when `(TypeError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure tools/bfi_learning/download_public_bfi.py:131— `approved_transport_url` returns `False` when `(TypeError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
D20 · ADR Quality· ADR has no Consequences section · ×1
ADR has no Consequences section docs/adr/ADR-092-nvsim-dashboard-implementation.md:1— docs/adr/ADR-092-nvsim-dashboard-implementation.md has no Consequences section (a heading such as `## Consequences`, or the MADR equivalent). A decision record states the context that forced it, the decision and its consequences, so a reader can tell later whether it still holds.
D20 · ADR Quality· ADR consequences name no cost · ×1
ADR consequences name no cost docs/adr/ADR-124-rvagent-mcp-ruvector-npm-integration.md:386— `docs/adr/ADR-124-rvagent-mcp-ruvector-npm-integration.md:386` records the good consequences of the decision and has no section for the bad ones. State what this decision costs or rules out.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 8 of 92 project(s) overshoot their size bounds, lowering Project Cohesion to 8.3/10. The most over is `(repository root)` (70571 LoC, 410 module-visible types across 44 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
D40 · Network Egress Confinement· No network policy · ×1
No network policy — No Kubernetes NetworkPolicy (or Cilium policy) found. Without one, every pod can talk to every other pod and reach out to the internet by default. Add a default-deny policy and open only the flows you need.
No runtime threat detection — No runtime threat-detection engine (Tetragon TracingPolicy / Falco) is committed. These observe process, file and network activity in-kernel and can alert or kill on malicious behaviour a static scan cannot catch.
P10 · Library API & versioning· Large public API surface · ×1
Large public API surface — 2274/2707 types (84%) declared in the published library are public. For a library, every public type is a stability contract — keep implementation types off the surface and expose only the intended API.
Logging is not universal — Only 23/41 runnable modules use logging (modules with no entry point or server are excluded — they are libraries a runnable module hosts). Silent: `.`, `aether-arena/space`, `harness/homecore`, `harness/ruview`, `harness/ruview-kernel` and 13 more.
Unused export 'NvTopbar' dashboard/src/components/nv-topbar.ts:13— Nothing imports this binding — it is safe to review for removal.
X2 · Cancellation propagation· Not all async functions that make a request accept an AbortSignal · ×1
Not all async functions that make a request accept an AbortSignal — Only 4/15 async functions that make a cancellable request (fetch, axios, ky, ofetch) accept an AbortSignal or pass one on, so a request keeps running after whatever wanted it has given up — a page navigated away from, an unmounted component, a timed-out job. Take a `signal` (or an options object that carries one) and hand it to the request; where nothing could ever cancel the call, omitting it is a deliberate choice — judge against how the function is used.
X23 · Unguarded diagnostic materialisation· Diagnostic log message is built whether or not it is wanted · ×1
Diagnostic log message is built whether or not it is wanted ui/services/pose.service.js:322— `debug` at line 322 is called with an argument built by `Object.keys(convertedData.zone_summary || { })` (line 324), whose cost grows with the collection it walks. JavaScript evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isLevelEnabled`/`isDebugEnabled` test, no debug flag, no `NODE_ENV` build switch.
Null assertions (`!`) reduce the strict null checking score — ~0.6 `!` null assertions per 1k TypeScript source lines — 14 assertion(s) across the 24053 source line(s) of the 162 TypeScript file(s) read, which is the only code the operator asserts anything in (a `!` in a `.js` file is not this operator and was not counted, and one in a file whose null checking is off silences nothing). Densest: dashboard/src/transport/worker.ts (8), ui/mobile/src/utils/ringBuffer.ts (2), dashboard/src/components/nv-console.ts (1). Each one tells the compiler to trust the author about null, suppressing the very diagnostic `strictNullChecks` exists to produce.
Subsumed condition operand v2/crates/homecore-hap/src/mapping.rs:146— `name.contains("temperature")` can never decide this `||` — every value satisfying `name.contains("temperature")` also satisfies `name.contains("temp")`, so the `||` chain is already decided by the latter. The expression is equivalent to the chain without it, which means it is wider than it reads. Delete the dead operand, or narrow the surviving one if IT is the accident.
Outdated: anyhow — `anyhow` is locked at 1.0.102 but 1.0.104 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in v2/crates/homecore-migrate/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p anyhow` and commit the updated REDACTED.
Outdated: async-trait — `async-trait` is locked at 0.1.91 but 0.1.92 is the current stable release on crates.io, and it already satisfies the `"0.1"` requirement declared in v2/crates/homecore-assist/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p async-trait` and commit the updated REDACTED.
Outdated: bitflags — `bitflags` is locked at 2.11.1 but 2.13.2 is the current stable release on crates.io, and it already satisfies the `"2.9"` requirement declared in v2/crates/wifi-densepose-physics/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p bitflags` and commit the updated REDACTED.
Outdated: blake3 — `blake3` is locked at 1.8.5 but 1.8.7 is the current stable release on crates.io, and it already satisfies the `"1.5"` requirement declared in v2/crates/ruview-attest/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p blake3` and commit the updated REDACTED.
Outdated: chrono — `chrono` is locked at 0.4.44 but 0.4.45 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in v2/crates/homecore-api/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p chrono` and commit the updated REDACTED.
Outdated: clap — `clap` is locked at 4.6.4 but 4.6.7 is the current stable release on crates.io, and it already satisfies the `"4"` requirement declared in v2/crates/cog-ha-matter/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p clap` and commit the updated REDACTED.
Outdated: futures-util — `futures-util` is locked at 0.3.32 but 0.3.34 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in v2/crates/homecore-api/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p futures-util` and commit the updated REDACTED.
Outdated: js-sys — `js-sys` is locked at 0.3.99 but 0.3.106 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in v2/crates/nvsim/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p js-sys` and commit the updated REDACTED.
Outdated: libc — `libc` is locked at 0.2.186 but 0.2.191 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in v2/crates/ruview-auth/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p libc` and commit the updated REDACTED.
Outdated: log — `log` is locked at 0.4.29 but 0.4.34 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in v2/crates/wifi-densepose-wasm/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p log` and commit the updated REDACTED.
Outdated: memmap2 — `memmap2` is locked at 0.9.11 but 0.9.12 is the current stable release on crates.io, and it already satisfies the `"0.9"` requirement declared in v2/crates/wifi-densepose-nn/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p memmap2` and commit the updated REDACTED.
Outdated: ruvector-attention — `ruvector-attention` is locked at 2.2.3 but 2.3.0 is the current stable release on crates.io, and it already satisfies the `"2.1.0"` requirement declared in v2/crates/wifi-densepose-ruvector/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ruvector-attention` and commit the updated REDACTED.
Outdated: ruvector-attn-mincut — `ruvector-attn-mincut` is locked at 2.0.4 but 2.3.0 is the current stable release on crates.io, and it already satisfies the `"2.0.4"` requirement declared in v2/crates/wifi-densepose-ruvector/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ruvector-attn-mincut` and commit the updated REDACTED.
Outdated: ruvector-core — `ruvector-core` is locked at 2.3.0 but 2.4.0 is the current stable release on crates.io, and it already satisfies the `"2.2.0"` requirement declared in v2/crates/homecore-recorder/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ruvector-core` and commit the updated REDACTED.
Outdated: ruvector-mincut — `ruvector-mincut` is locked at 2.0.6 but 2.3.1 is the current stable release on crates.io, and it already satisfies the `"2.0.6"` requirement declared in v2/crates/wifi-densepose-engine/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ruvector-mincut` and commit the updated REDACTED.
Outdated: ruvector-solver — `ruvector-solver` is locked at 2.2.3 but 2.3.0 is the current stable release on crates.io, and it already satisfies the `"2.0.6"` requirement declared in v2/crates/wifi-densepose-mat/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ruvector-solver` and commit the updated REDACTED.
Outdated: ruvector-temporal-tensor — `ruvector-temporal-tensor` is locked at 2.0.6 but 2.3.0 is the current stable release on crates.io, and it already satisfies the `"2.0.6"` requirement declared in v2/crates/wifi-densepose-mat/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p ruvector-temporal-tensor` and commit the updated REDACTED.
Outdated: serde — `serde` is locked at 1.0.228 but 1.0.229 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in v2/crates/cog-ha-matter/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde` and commit the updated REDACTED.
Outdated: serde_json — `serde_json` is locked at 1.0.150 but 1.0.154 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in v2/crates/cog-ha-matter/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p serde_json` and commit the updated REDACTED.
Outdated: smallvec — `smallvec` is locked at 1.15.2 but 1.16.4 is the current stable release on crates.io, and it already satisfies the `"1.15"` requirement declared in v2/crates/wifi-densepose-physics/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p smallvec` and commit the updated REDACTED.
Outdated: tokio — `tokio` is locked at 1.53.1 but 1.54.1 is the current stable release on crates.io, and it already satisfies the `"1.35"` requirement declared in python/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p tokio` and commit the updated REDACTED.
Outdated: uuid — `uuid` is locked at 1.23.1 but 1.29.0 is the current stable release on crates.io, and it already satisfies the `"1"` requirement declared in v2/crates/homecore-api/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p uuid` and commit the updated REDACTED.
Outdated: wasm-bindgen — `wasm-bindgen` is locked at 0.2.122 but 0.2.129 is the current stable release on crates.io, and it already satisfies the `"0.2"` requirement declared in v2/crates/nvsim/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p wasm-bindgen` and commit the updated REDACTED.
Outdated: wasm-bindgen-futures — `wasm-bindgen-futures` is locked at 0.4.72 but 0.4.79 is the current stable release on crates.io, and it already satisfies the `"0.4"` requirement declared in v2/crates/wifi-densepose-wasm/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p wasm-bindgen-futures` and commit the updated REDACTED.
Outdated: web-sys — `web-sys` is locked at 0.3.99 but 0.3.106 is the current stable release on crates.io, and it already satisfies the `"0.3"` requirement declared in v2/crates/wifi-densepose-wasm/Cargo.toml — so the lockfile is behind this repository's own declared range. Run `cargo update -p web-sys` and commit the updated REDACTED.
Skipped (documented): monitor script flags Ameba CSI buffer starvation harness/ruview/test/cli-ui.test.mjs:79— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): public converter CLI preserves source capture when output is ${alias} harness/ruview/test/csi-transcode-source-preservation.test.mjs:11— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): boot-log capture survives non-ASCII firmware logs on a cp1252 stdout harness/ruview/test/firmware.test.mjs:206— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Skipped (documented): remote command is fully shell-quoted and ssh options are fixed harness/ruview/test/remote.test.mjs:20— Skipped with a documented reason — a deferral, not lazy debt: skipped at run time by a this.skip()/t.skip() call
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 2 file(s) — `references/script_1.py`, `v2/crates/wifi-densepose-desktop/ui/.vite/deps/react-dom_client.js` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.
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.
Run 01a174e8-6978-7b0f-b49d-c5b42139f7ad · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 159 · Warnings: 2110 · Recommendations: 623 · Info: 30 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 25-10-2026 @ 21:12 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.