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

DoosanRobotics/doosan-robot2

Measured 17 November 2026, 11:55 UTC, at code version 243af5d

Test reliability is not measured: The suite could not be re-run, but the repository declares tests of its own unreliable.

Supply-chain provenance & signing is not measured: Supply-chain provenance is not scored (this pipeline releases no artifact), but its build steps or GitHub Actions workflows have integrity defects, or nothing watches its dependency set for published advisories.

CAI score 51.5out of 100 Weak
CriticalWeakAdequateStrongExemplary

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 medium codebase: 26,385 lines of product code in 23 projects, tests not counted · Estimated rebuild effort: about 0.2 person-years · Weakest lens: Production Readiness, 31.5

Findings by how serious they are

10 critical 454 serious 64 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
17 November 2026, 11:55 UTC

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

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

36of 36 dimensions measured by tools.
523of 528 findings point to an exact file and line, so you can open each one in the code. The other 5 concern the repository as a whole, such as missing documentation.
36dimensions across 5 lenses, read from 26,385 lines of product code in 23 projects.
Chapters

Executive summary

DoosanRobotics/doosan-robot2 falls short of our standard for production because its Testing dimensions are rated Critical, and we found no logging, tracing or health checks in the code. It scores 51.5 out of 100, which alone would earn Adequate, but it is rated Weak: a rating can't sit more than one step above its weakest group.

Production Readiness, at 31.5, is the weakest lens and counts most in the score. The best first step is adding tests for untested code, worth about 19.4 points. Adding a diagnostic log would lift Production Readiness itself, worth about 6.7 points. Raising Production Readiness to 70 would lift the score to about 67.8.

Five pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Four secrets can leak from the build pipeline. Pinning each tool to an exact version and limiting each secret to its own step would close both risks. The test the project itself marks as unreliable needs fixing or deleting.

The product code is 26,385 lines, about €28,000 to rebuild.

A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.

How the score is built: what each lens counts for The lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Production Readiness 31.5 · counts for 47%Maturity 64.0 · counts for 26%Code Health 64.0 · counts for 14%Security and Compliance 82.3 · counts for 8%Architecture 98.4 · counts for 4%

If Production Readiness rose from 31.5 to 70, the lowest score rated Strong, the score would rise from 51.5 to about 67.8.

Code composition: what the lines of code are
Product code 90%Tests 10%
Rebuild cost: about €28,000 · Estimate
Cost to rebuild€9,300 to €47,000, for 155 to 493 hours of work, about 0.2 person-years for one engineer
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.7 at a score of 52. 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.
SizeMedium: 26,385 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. 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
Resolve the 21 Low coverage finding(s) in Code Coverage — start with setup.py (4), controller_config.py, dsr_mujoco_bridge.py.
Raises the score by about 19.4 points · Medium effort · Code Coverage
2
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with setup.py.
Raises the score by about 4.0 points · Low effort · ADR Quality
3
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag.
Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Raises the score by about 6.7 points · Medium effort · Observability

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 €28,000 to build again, about 0.2 person-years of work. Its weakest lens is Production Readiness, at 31.5 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
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 3.1 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 12% to 27% on every change. The history of the code shows how much it changes: about 8,476 lines over the last 90 days, which is about 34,375 lines a year. At that pace, the extra work comes to an estimated 10.5 to 62.8 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
If you do one thing first · First action
Resolve the 21 Low coverage finding(s) in Code Coverage. Of all the actions in this report, it raises the score most for the work it takes: about 19.4 points for medium effort, because it clears the 21 Code Coverage findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort

At a glance — Code Health · 64.0 · Adequate · gated by D1, D2, D4 ·

At a glance — Architecture · 98.4 · Exemplary ·

At a glance — Maturity · 64.0 · Adequate · gated by D34, M2 ·

At a glance — Readiness · 31.5 · Weak · gated by D8, P2, P3 ·

At a glance — Security · 82.3 · Adequate · gated by D29 ·

Security & Compliance — OWASP Top-10 mapping

Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).

OWASP categoryFindingsSeverity
A05:2025 — Injection15High / Critical
A02:2025 — Security Misconfiguration6Medium

Roadmap

Top priorities: Resolve the 21 Low coverage finding(s) in Code Coverage — start with setup.py (4), controller_config.py, dsr_mujoco_bridge.py; Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce; Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.

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

Do thisHelpsEffortDimension
Resolve the 21 Low coverage finding(s) in Code Coverage — start with setup.py (4), controller_config.py, dsr_mujoco_bridge.py.+19.4 ptsMediumCode Coverage
Resolve the 1 No ADRs found finding(s) in ADR Quality — start with setup.py.+4.0 ptsLowADR Quality
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.+6.7 ptsMediumObservability
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.+6.7 ptsMediumSecurity & performance tooling
Resolve the 48 Orphaned file finding(s) in Knowledge Freshness — start with start.launch.py (14), demo.launch.py (8), dsr_mobile_manipulator_dual_rviz.launch.py.+3.2 ptsMediumKnowledge Freshness
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.+2.8 ptsMediumDeployment & Rollback
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+2.7 ptsMediumArchitecture documentation
Bring the 66 bodies over 15 down to 15 or less in Cognitive Complexity — start with CDsrRobot.set_user_cart_coord (cognitive 144), DSR_ROBOT2.set_user_cart_coord (cognitive 144), CDsrRobot.align_axis (cognitive 130).+2.8 ptsHighCognitive Complexity

File quality

Per-file score 0–10 — a quality signature. Of 49 files carrying findings, judged against the Production bar: 4% slop · 49% mixed · 47% near-clean.

FileScoreBandWorst signal
REDACTED2.0SlopStatic Analysis (SAST): High: REDACTED
REDACTED2.5SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.0MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED4.8MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): High: REDACTED
dsr_common2/imp/DSR_ROBOT2.py5.5MixedCyclomatic Complexity: CDsrRobot.set_user_cart_coord (cyclomatic 84)
dsr_tests/test/test_cli_dsr_system.py6.4MixedExplicit Debt: TodoComment
dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py7.0MixedCode Duplication: Near-duplicate member family (16 members, 34 shared lines)
dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py7.0MixedCode Duplication: Near-duplicate member family (6 members, 63 shared lines)
dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py7.0MixedCode Duplication: Near-duplicate member family (3 members, 89 shared lines)
dsr_example2/dsr_visualservoing/dsr_visualservoing/camera_publisher.py7.0MixedCode Duplication: Edited copy of a member (10 corresponding lines)
dsr_bringup2/dsr_bringup2/run_emulator.py7.0MixedCode Duplication: Duplicated block (15–27 lines × 2)
dsr_bringup2/dsr_bringup2/moveit_connection.py7.0MixedCode Duplication: Duplicated block (6 lines × 2)
dsr_example2/dsr_example/dsr_example/demo/slope_demo.py7.0MixedCode Duplication: Duplicated block (12–13 lines × 2)
dsr_common2/imp/DR_tcp_client2.py7.0MixedCyclomatic Complexity: DR_tcp_client2.client_socket_read (cyclomatic 18)
dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py7.1MixedCode Duplication: Near-duplicate member family (4 members, 75 shared lines)
dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py7.1MixedGod Classes: FileTooLong: launch/start.launch.py
dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py7.1MixedCode Duplication: Edited copies of one member (3 members, 128+ corresponding lines)
dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py7.2MixedCode Duplication: Duplicated block (47–54 lines × 2)
dsr_mujoco/launch/dsr_mujoco.launch.py7.4MixedCognitive Complexity: launch.prepare_mjcf_files_for_mujoco (cognitive 22)

How the grades work

Every finding carries one of four grades. Three say how serious it is. The fourth says this survey could not settle it — and it is a grade, not a gap.

Critical — 10

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

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

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

Could not be resolved — 13

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

Methodology & how to trust this report

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

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

What we checked — 36 dimensions across the health lenses
D1D2D3D4D5D6D8D13D14D15D16D17D19D20D26D28D29D31D34D35D44AX10AX3AX4M1M2M3M4P1P10P2P3P4P6X12X3

Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.

How to trust any code-health report — three questions
  1. Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 523 of 528 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

This report answers yes to all three. That's the bar to hold any assessment to.

Tools & methods

The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.

MethodBacksVersionEvaluator
Roslyn static analysisComplexity, cohesion, coupling, dead code, API surface, layering5.3.0✓ deterministic
Native secret scannerHardcoded secrets / credentials1.0.0✓ deterministic
Canine Code Analyzer duplication detector (in-process)Code duplication1.0.0✓ deterministic
Coverage (coverlet / dotnet-coverage)Line & branch coverage10.0.400✓ deterministic
NuGet / dotnetOutdated, vulnerable & deprecated dependencies10.0.400✓ deterministic
git / LibGit2SharpChurn hotspots, knowledge concentration, history2.43.0 · 0.31.0✓ deterministic
gitleaks · semgrep · trivy · checkovSecrets in history, SAST, CVEs, IaC & container, PII / GDPR1.86.0 · 0.69.3 · 3.2.533✓ deterministic

Every finding is locatable in findings.md. Run 01a1e95d-202e-779f-b432-daa2b18571f0.

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

Run transparency — what happened this run

What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.

  • D4 Code Duplication — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. The 229 duplicated block group(s) on this row were found in the languages this pass could tokenize, and they do NOT cover all of this repository's production source: .cpp (14,821 lines, 37% of production source) went unread, because no language model this pass could load exposed a clone-unit token stream for those file kinds. Duplication in that source is UNMEASURED — its absence from the count above is a gap in this analyzer's language coverage, not a finding that the code is free of duplication.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This repository declares 1 of its own test(s) unreliable. The built-in reliability runner does not support this repository's ecosystem (.py), so the suite was not re-run and no reliability score is given — these are the repository's own declarations, not our measurement.
  • D12 Dependency Hygiene — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — 1 shipped Python distribution(s) were read, but the outdated signal needs pypi.org, and no declaration here carries an exact pin to ask about — a floor or a range installs the newest release it admits and cannot be behind one, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is a COLLECTOR gap, not an environment fault: no published-package marker D22 reads admitted any project here, so this ecosystem's public API has no collector, and the remedy is to write one — no change to the scan image can close it.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 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.
  • D26 Project Cohesion — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Project size and spread are measured over build units whose source a code model reads. This repository's .cpp source is a material share of its production lines and was read by none, so the score is a verdict about the units that were read. Not a finding that the unread source is cohesive — it is unmeasured.
  • C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust or Java was found, and this repository's Python, c, cpp 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 — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby, Scala or Rust was found, and this repository's Python, c, cpp 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 — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security 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 web-security controls.
  • X12 Unreachable branch — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala, Kotlin and Rust source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala, Kotlin or Rust was found in this repository, 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.
  • X18 Disposal-pattern correctness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala, PHP, Rust and Elixir source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala, PHP, Rust or Elixir was found in this repository, 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.
  • X29 Per-element action decided by a fixed element — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript (Vue and Svelte components included), Java, Rust, Dart, Ruby, Scala, Kotlin and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, 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.
  • X3 Exception handling — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. This check's reader does not cover every language in this repository. The score describes the part it read, which is most of the product; the rest is a gap in this analyzer's language reach.
  • X4 Structured logging — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala, Rust, Go, Swift, Erlang, F# and Visual Basic source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP log through no library that carries a message's values as fields (pino, winston, bunyan, tslog, LogTape, roarr; Python's logging, structlog; PHP's PSR-3 loggers), so its log calls cannot be judged, 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.
  • X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, Kotlin source, and Rust source only, and no C# was loaded, no TypeScript was found, and this repository's C, Cpp, Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • D5 Coupling: Coupling is measured between projects/assemblies — runtime coupling through DI, reflection, messaging or shared databases is invisible to a static reference graph.
  • D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
  • D8 Code Coverage: Coverage is measured by building and running the test suite inside our isolated image — the target repo is never modified, and nothing on your systems runs. So coverage exists only when the suite builds and runs within the inline time budget; one that needs external services, can't build, or exceeds the budget yields no coverage (D8 then degrades to not-measured, not a low score). Line coverage also says nothing about assertion quality.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D20 ADR Quality: ADR quality checks the structure of the decision records present: it cannot know about decisions made and never recorded, and it does not judge how well a record argues its case. Records in a language the section lexicon does not cover are not evaluated.
  • 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").
  • 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.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a REDACTED (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • 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.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity2.0 / 10Critical✓ Tool-verified

What it measures: How tangled the control flow is — methods with many branches are hard to test and change.

Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.

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

47 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was CDsrRobot.set_user_cart_coord at 84.

CDsrRobot.set_user_cart_coord (cyclomatic 84)dsr_common2/imp/DSR_ROBOT2.py:10085
DSR_ROBOT2.set_user_cart_coord (cyclomatic 84)dsr_common2/imp/DSR_ROBOT2.py:4951
CDsrRobot.align_axis (cyclomatic 68)dsr_common2/imp/DSR_ROBOT2.py:9537
DSR_ROBOT2.align_axis (cyclomatic 68)dsr_common2/imp/DSR_ROBOT2.py:4403
CDsrRobot.parallel_axis (cyclomatic 62)dsr_common2/imp/DSR_ROBOT2.py:9319

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

What to do

  1. Bring the 6 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with CDsrRobot.set_user_cart_coord (cyclomatic 84), DSR_ROBOT2.set_user_cart_coord (cyclomatic 84), CDsrRobot.align_axis (cyclomatic 68). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 6 together lifts Cyclomatic Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D2 · Cognitive Complexity2.0 / 10Critical✓ Tool-verified

What it measures: How hard the code is for a person to follow, beyond raw branching.

Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.

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

66 method(s) exceeded the cognitive complexity threshold of 15; the worst was CDsrRobot.set_user_cart_coord at 144.

CDsrRobot.set_user_cart_coord (cognitive 144)dsr_common2/imp/DSR_ROBOT2.py:10085
DSR_ROBOT2.set_user_cart_coord (cognitive 144)dsr_common2/imp/DSR_ROBOT2.py:4951
CDsrRobot.align_axis (cognitive 130)dsr_common2/imp/DSR_ROBOT2.py:9537
DSR_ROBOT2.align_axis (cognitive 130)dsr_common2/imp/DSR_ROBOT2.py:4403
CDsrRobot.parallel_axis (cognitive 125)dsr_common2/imp/DSR_ROBOT2.py:9319

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

What to do

  1. Bring the 66 bodies over 15 down to 15 or less in Cognitive Complexity — start with CDsrRobot.set_user_cart_coord (cognitive 144), DSR_ROBOT2.set_user_cart_coord (cognitive 144), CDsrRobot.align_axis (cognitive 130). — 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 66 together lifts Cognitive Complexity from 2.0 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

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

D3 · God Classes9.3 / 10Stronggated by 5 serious findings✓ Tool-verified

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

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

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

5 god class(es) detected.

FileTooLong: imp/DSR_ROBOT2.py · ×4dsr_common2/imp/DSR_ROBOT2.py
TooManyMethods: CDsrRobotdsr_common2/imp/DSR_ROBOT2.py:6659

What to do

  1. Resolve the 4 FileTooLong finding(s) in God Classes — start with start.launch.py (3), DSR_ROBOT2.py. — One of this dimension's main actionable groups (4 warning-level).
  2. Resolve the 1 TooManyMethods finding(s) in God Classes — start with DSR_ROBOT2.py. — One of this dimension's main actionable groups (1 warning-level).

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

D4 · Code Duplication0.0 / 10Critical✓ Tool-verified

What it measures: How much of the production code is copy-pasted: the share of production lines inside a reported copy (every copy of a duplicated block or of an edited member, each line once), 10 at none and 0 at a quarter of the lines.

Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), scored on the share of production lines inside a reported copy (each line once; 10 at none, 0 at a quarter). Deterministic.

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

229 duplicated block group(s) detected. 61.9 % of the production lines (16,323 of 26,385) are in a reported copy. A further 55 rows report members as variants of one another; the share counts each copied line once, however many rows cite it. 1 of the 284 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. Measured on part of this repository only: .cpp (37% of production source) was not exposed to the token comparison, so duplication there is unmeasured and is not in this count.

Duplicated block (12 lines × 2) · ×25dsr_common2/imp/DSR_ROBOT2.py:657
Duplicated block (16 lines × 2) · ×10dsr_common2/imp/DSR_ROBOT2.py:1061
Duplicated block (19 lines × 2) · ×9dsr_common2/imp/DSR_ROBOT2.py:1351
Duplicated block (13 lines × 2) · ×9dsr_common2/imp/DSR_ROBOT2.py:679
Edited copy of a member (16 corresponding lines) · ×8dsr_common2/imp/DSR_ROBOT2.py:696

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

What to do

  1. Resolve the 25 Duplicated block (12 lines × 2) finding(s) in Code Duplication — start with DSR_ROBOT2.py (25). — One of this dimension's main actionable groups (25 warning-level).
  2. Resolve the 10 Duplicated block (16 lines × 2) finding(s) in Code Duplication — start with DSR_ROBOT2.py (10). — One of this dimension's main actionable groups (10 warning-level).
  3. Resolve the 9 Duplicated block (19 lines × 2) finding(s) in Code Duplication — start with DSR_ROBOT2.py (9). — One of this dimension's main actionable groups (9 warning-level).

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

D5 · Coupling10.0 / 10Exemplary✓ Tool-verified

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

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

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

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

14 production modules (Python+CMake), 0 dependency cycle(s), 0 unstable depended-on module(s). Read from the build's own module declarations; 0 module(s) off the main sequence, with abstractness counted on 2 of the 14 (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).

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

D6 · Cohesion (LCOM4)8.5 / 10Strong✓ Tool-verified

What it measures: Whether a class's methods are focused on a single responsibility.

Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.

Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.

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

1 of 8 classes have LCOM4 above 3.

Low cohesion: CDsrRobot (LCOM4 93)dsr_common2/imp/DSR_ROBOT2.py:6659

What to do

  1. Resolve the 1 Low cohesion finding(s) in Cohesion (LCOM4) — start with DSR_ROBOT2.py. — One of this dimension's main actionable groups (1 warning-level).

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

D8 · Code Coverage1.0 / 10Critical✓ Tool-verified

What it measures: How much of the code is actually exercised by tests.

Method: Coverage from the analyzer's own run of the suite, computed per-file with structured exclusions for generated, trivial, and glue code. A coverage report found in the repository is never read. When the suite can't be built/run in-image, coverage is reported NOT-MEASURED (excluded from the score) with the precondition to make it measurable — never a LoC-ratio proxy folded in as if measured. Deterministic.

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

Line coverage 0.2% — 21 file(s) below 50%. Measured from the Python suite (repository root: `coverage run -m pytest`, the 3 run(s) test reliability made; dsr_example2/dsr_example: `coverage run -m pytest`, the 3 run(s) test reliability made; dsr_example2/dsr_visualservoing: `coverage run -m pytest`, the 3 run(s) test reliability made; dsr_tests: `coverage run -m pytest`, the 3 run(s) test reliability made). Taken over 3 runs of the suite: a line counts as covered only when every run executed it.

Low coverage: dsr_bringup2/dsr_bringup2/controller_config.py · ×21dsr_bringup2/dsr_bringup2/controller_config.py:1

What to do

  1. Resolve the 21 Low coverage finding(s) in Code Coverage — start with setup.py (4), controller_config.py, dsr_mujoco_bridge.py. — One of this dimension's main actionable groups (21 warning-level).

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

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

What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.

Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

What it measures: Whether the licenses of third-party packages are compatible with your policy.

Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.

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

0 of 1 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 1 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (0 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version.

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

D15 · Churn × Complexity Hotspots10.0 / 10Exemplary✓ Tool-verified

What it measures: Files that change often and are also complex — the riskiest hotspots.

Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.

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

No churn × complexity hotspots in the window.

✓ On the Gold path — maintain.

Detailed fixes: d15_recommendation.md.

D16 · Bus Factor10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether knowledge is concentrated in too few people (the "bus factor").

Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.

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

No source file's living knowledge is concentrated in a single author. Counted over 63 of the 85 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

✓ On the Gold path — maintain.

Detailed fixes: d16_recommendation.md.

D17 · Explicit Debt9.9 / 10Stronggated by 18 serious findings✓ Tool-verified

What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.

Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.

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

18 deducted task-comment markers across 26385 LoC (0.1/KLoC) → score 9.9. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.

TodoComment · ×18dsr_tests/test/test_cli_dsr_system.py:32

What to do

  1. Resolve the 18 TodoComment finding(s) in Explicit Debt — start with test_cli_dsr_system.py (18). — One of this dimension's main actionable groups (18 warning-level).

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

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

What it measures: Whether the project's documentation is clear, complete, and useful.

Method: Every README, docs/ document and root guide parsed by its markup and measured in Unicode letters. Published: a runnable or packaged .NET project whose README (or a document it links, or a root guide) shows no example, and a root README naming none of three or more projects. Overview, licence, boilerplate, wall-of-text, empty-section and XML-doc rows are measured and withheld (counted in gaps) after adjudication. Deterministic, exhaustive, advisory.

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

2 of 2 documentation facets pass in full. 7 document(s) read across 5 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

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

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

Method: Every ADR read by its section structure: nine located rules (a missing Decision, Context or Consequences section, a stale status, two records deciding the same question, a dangling supersede link, a number-only title, a single option, no named cost, no status where the log uses one, no enforcement field where the log adopted one), each a fixed deduction from 10; the score is the mean over evaluated records. Deterministic, no model. Advisory.

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

No architecture decision records were found.

No ADRs founddsr_tests/setup.py:25

What to do

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

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

D26 · Project Cohesion10.0 / 10Exemplary✓ Tool-verified

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

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

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

0 of 23 build units (CMake, Python) flagged as possibly oversized/incoherent. This repository's .cpp source was read by no build unit, so this covers part of the tree, not all of it.

✓ On the Gold path — maintain.

Detailed fixes: d26_recommendation.md.

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

What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.

Method: Secret scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)3.1 / 10Weak✓ Tool-verified

What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.

Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.

Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).

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

15 finding(s): 0 critical, 9 high, 6 medium, 0 low. 4 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `dsr_common2/include/DRFLEx.h` (line 125, line 130, line 138, …) — 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 2 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

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

What to do

  1. Resolve the 3 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2), REDACTED. — One of this dimension's main actionable groups (3 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) — all 4 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (4 issue-level, 0 of them charged here).

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

D31 · IaC & Container Security9.8 / 10Exemplary✓ Tool-verified

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

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

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

6 finding(s): 0 critical, 0 high, 0 medium, 6 low.

REDACTED

✓ On the Gold path — maintain.

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

D34 · Knowledge Freshness1.9 / 10Critical✓ Tool-verified

What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.

Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.

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

51 of 63 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is dsr_common2/imp/DRFC.py. Counted over 63 of the 85 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Orphaned file · ×48dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:1
Most significant orphaned file · ×3dsr_common2/imp/DRFC.py:1
Concentrated knowledge decay

What to do

  1. Resolve the 48 Orphaned file finding(s) in Knowledge Freshness — start with start.launch.py (14), demo.launch.py (8), dsr_mobile_manipulator_dual_rviz.launch.py. — One of this dimension's main actionable groups (48 recommendation-level).
  2. Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with start.launch.py (2), DRFC.py. — One of this dimension's main actionable groups (3 recommendation-level).
  3. Resolve the 1 Concentrated knowledge decay finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).

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

D35 · Change Coupling10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.

Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.

Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.

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

No strong hidden change-coupling between production files.

✓ On the Gold path — maintain.

Detailed fixes: d35_recommendation.md.

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

What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.

Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code composition10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. 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.

AX3 · Project dependency cycles10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).

Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.

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

Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.

Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.

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

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

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

What to do

  • Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
M2 · Architecture documentation3.0 / 10Weak✓ Tool-verified

Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.

Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.

  • No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.

What to do

  • Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
M3 · Folder & project structure10.0 / 10Exemplary✓ Tool-verified

Maturity · Maturity — Whether the repository is organised deliberately: production code and tests are set apart in a way its ecosystem or the repository itself declares.

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

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

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

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

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

Readiness · Readiness — Whether an automated pipeline builds and tests every change.

Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.

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

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

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

P2 · Observability0.0 / 10Critical✓ Tool-verified

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

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

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

What to do

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

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

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

  • No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:7

What to do

  • Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
P4 · Deployment & Rollback5.0 / 10Adequate✓ Tool-verified

Readiness · Readiness — Whether releases are automated and safely reversible (probes, rolling updates, approval gates) — from manifests/pipeline files, not the live environment.

Method: Filesystem scan: deployment manifests/IaC (K8s YAML, Helm, Terraform) for rolling updates, probes, approval gates, migration hooks. Exhaustive, deterministic.

What to do

  • Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.
P6 · Release Hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

X12 · Unreachable branch10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.

Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.

X3 · Exception handling7.9 / 10Strong✓ Tool-verified

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

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

  • `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. — dsr_bringup2/dsr_bringup2/utils.py:120

What to do

  • Swallowed exception (caught, then discarded)

Reference — by lens

The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.

LensScoreRatingImpact
Code Health64.0Adequate — gated by D1, D2, D4Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture98.4ExemplaryStrongest area.
Maturity64.0Adequate — gated by D34, M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness31.5Weak — gated by D8, P2, P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security82.3Adequate — gated by D29Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Unscored — 4 check(s) recorded observations but carry no score

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

  • D11 Test Reliability — 1 observation(s) recorded · This repository declares 1 of its own test(s) unreliable. The built-in reliability runner does not support this repository's ecosystem (.py), so the suite was not re-run and no reliability score is given — these are the repository's own declarations, not our measurement.
  • D36 Supply-chain Provenance & Signing — 3 observation(s) recorded · The CI pipeline publishes no artifact — no package publish, container push or release with files to download. Supply-chain provenance, signing and an SBOM describe a PUBLISHED artifact for the people who obtain it, so there is nothing to attest here; a deployment of the service itself publishes nothing for anyone else to verify. Add them to the release pipeline when this repo starts publishing artifacts (a package, a container image, or a release with downloadable files). Build integrity and workflow-token hygiene are reported below: they describe what the CI runs and the token it runs with, neither of which is affected by whether the pipeline ships an artifact.
  • X10 Duplicated predicate — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.

  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 76 check(s) not relevant to this codebase

These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: 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.
  • 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.
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX6 Interface segregation — no interface, protocol or abstract type declares an operation an implementer must write
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — docker build failed (exit 1) — 12 | >>> curl \ 13 | >>> wget \ 14 | >>> vim \ 15 | >>> git \ 16 | >>> python3-pip \ 17 | >>> && rm -rf /var/lib/apt/lists/* 18 | -------------------- ERROR: failed to solve: process "/bin/sh -c apt-get update && apt-get install -y sudo curl wget vim git python3-pip && rm -rf /var/lib/apt/lists/*" did not complete successfully: exit code: 100; likely cause (the repository): a RUN step of the repository's REDACTED exited with code 100 (`/bin/sh -c apt-get update && apt-get install -y sudo curl wget vim git python3-pip && rm -rf…`): the build's own command failed, for example a compile or test error; runtime evidence skipped The cause is in the repository, not in our sandbox: a RUN step of the repository's REDACTED exited with code 100 (`/bin/sh -c apt-get update && apt-get install -y sudo curl wget vim git python3-pip && rm -rf…`): the build's own command failed, for example a compile or test error. 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 — No access-control surface detected in the analyzed source — this repository registers no route and starts no server another machine can reach (no Flask/FastAPI/Starlette route, Django urlpatterns or class-based view, Tornado handler). Access control is therefore N/A here — a library or command-line tool is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or MongoEngine model, a migration or a SQL schema — and no database or data-store client (Django ORM, SQLAlchemy, psycopg, PyMongo, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~3050 lines of test source are present (.py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
  • D12 Dependency Hygiene — Not scored — 1 shipped Python distribution(s) were read, but the outdated signal needs pypi.org, and no declaration here carries an exact pin to ask about — a floor or a range installs the newest release it admits and cannot be behind one, so this dimension's own question is only partly answered. NOT a finding that these dependencies are current or healthy.
  • 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 — D21 withholds its case and prefix conventions rows: 1 candidate(s) found and not reported.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only — this repository's production source is .py, which was left unread. Not scored: this is a gap in the analyzer, not a verdict about this repository.
  • D25 ADR Conformance — no ADRs to check
  • D27 Navigability — symbol resolution incomplete — navigability not assessed
  • D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Python source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage data present for 23 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.
  • PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
  • S1 Web-Security Posture — Not assessed: these web-security 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 web-security 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.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X13 Undrained process stream — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — not 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
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not 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
  • X19 Unrestored process-global state — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
  • 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.
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X23 Unguarded diagnostic materialisation — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X25 Inert configuration knob — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X27 Collection changed while being enumerated — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X28 Index access outside its own emptiness guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not 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
  • X30 Support guard that admits what it rejects — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — 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.
  • X4 Structured logging — 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
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X6 Hand-rolled structured-format parsing — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.

Critical — 10 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D11 · Test Reliability · Test declared unreliable · ×1
  • Test declared unreliable: test_flake8 dsr_example2/dsr_visualservoing/test/test_flake8.py:20 — This test is disabled or skipped with a reason naming unreliability — the repository's own words: "The package sources have not been brought up to flake8 style yet.". A test that is skipped for flakiness is neither passing nor protecting the code it covers; either stabilise it or delete it, but do not leave it disabled indefinitely. (Found by reading the repository's own test source — the suite itself was not re-run, since the reliability runner does not support this ecosystem.)
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 454 finding(s)
D4 · Code Duplication · Duplicated block (12 lines × 2) · ×25
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:657 — dsr_common2/imp/DSR_ROBOT2.py:657-668 | dsr_common2/imp/DSR_ROBOT2.py:6860-6871 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:700 — dsr_common2/imp/DSR_ROBOT2.py:700-711 | dsr_common2/imp/DSR_ROBOT2.py:6903-6914 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:719 — dsr_common2/imp/DSR_ROBOT2.py:719-730 | dsr_common2/imp/DSR_ROBOT2.py:6922-6933 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:761 — dsr_common2/imp/DSR_ROBOT2.py:761-772 | dsr_common2/imp/DSR_ROBOT2.py:6964-6975 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:807 — dsr_common2/imp/DSR_ROBOT2.py:807-818 | dsr_common2/imp/DSR_ROBOT2.py:7010-7021 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:845 — dsr_common2/imp/DSR_ROBOT2.py:845-856 | dsr_common2/imp/DSR_ROBOT2.py:7048-7059 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:889 — dsr_common2/imp/DSR_ROBOT2.py:889-900 | dsr_common2/imp/DSR_ROBOT2.py:7092-7103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:907 — dsr_common2/imp/DSR_ROBOT2.py:907-918 | dsr_common2/imp/DSR_ROBOT2.py:7110-7121 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:994 — dsr_common2/imp/DSR_ROBOT2.py:994-1005 | dsr_common2/imp/DSR_ROBOT2.py:7185-7196 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1109 — dsr_common2/imp/DSR_ROBOT2.py:1109-1120 | dsr_common2/imp/DSR_ROBOT2.py:7301-7312 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:1154 — dsr_common2/imp/DSR_ROBOT2.py:1154-1165 | dsr_common2/imp/DSR_ROBOT2.py:7346-7357 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1219 — dsr_common2/imp/DSR_ROBOT2.py:1219-1230 | dsr_common2/imp/DSR_ROBOT2.py:7411-7422 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1237 — dsr_common2/imp/DSR_ROBOT2.py:1237-1248 | dsr_common2/imp/DSR_ROBOT2.py:7429-7440 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1300 — dsr_common2/imp/DSR_ROBOT2.py:1300-1311 | dsr_common2/imp/DSR_ROBOT2.py:7493-7504 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:1318 — dsr_common2/imp/DSR_ROBOT2.py:1318-1329 | dsr_common2/imp/DSR_ROBOT2.py:7511-7522 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1335 — dsr_common2/imp/DSR_ROBOT2.py:1335-1346 | dsr_common2/imp/DSR_ROBOT2.py:7528-7539 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1377 — dsr_common2/imp/DSR_ROBOT2.py:1377-1388 | dsr_common2/imp/DSR_ROBOT2.py:7571-7582 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1409 — dsr_common2/imp/DSR_ROBOT2.py:1409-1420 | dsr_common2/imp/DSR_ROBOT2.py:7603-7614 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1449 — dsr_common2/imp/DSR_ROBOT2.py:1449-1460 | dsr_common2/imp/DSR_ROBOT2.py:7643-7654 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2161 — dsr_common2/imp/DSR_ROBOT2.py:2161-2172 | dsr_common2/imp/DSR_ROBOT2.py:2184-2195 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2211 — dsr_common2/imp/DSR_ROBOT2.py:2211-2222 | dsr_common2/imp/DSR_ROBOT2.py:2238-2249 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3889 — dsr_common2/imp/DSR_ROBOT2.py:3889-3900 | dsr_common2/imp/DSR_ROBOT2.py:9023-9034 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4152 — dsr_common2/imp/DSR_ROBOT2.py:4152-4163 | dsr_common2/imp/DSR_ROBOT2.py:9286-9297 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (12 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:6053 — dsr_common2/imp/DSR_ROBOT2.py:6053-6064 | dsr_common2/imp/DSR_ROBOT2.py:11186-11197 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:6641 — dsr_common2/imp/DSR_ROBOT2.py:6641-6653 | dsr_common2/imp/DSR_ROBOT2.py:11774-11785 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D8 · Code Coverage · Low coverage · ×21
  • Low coverage: dsr_bringup2/dsr_bringup2/controller_config.py dsr_bringup2/dsr_bringup2/controller_config.py:1 — 0.0% line coverage (0/35).
  • Low coverage: dsr_bringup2/dsr_bringup2/dsr_mujoco_bridge.py dsr_bringup2/dsr_bringup2/dsr_mujoco_bridge.py:1 — 0.0% line coverage (0/48).
  • Low coverage: dsr_bringup2/dsr_bringup2/gazebo_connection.py dsr_bringup2/dsr_bringup2/gazebo_connection.py:1 — 0.0% line coverage (0/54).
  • Low coverage: dsr_bringup2/dsr_bringup2/gazebo_connection_pos.py dsr_bringup2/dsr_bringup2/gazebo_connection_pos.py:1 — 0.0% line coverage (0/30).
  • Low coverage: dsr_bringup2/dsr_bringup2/moveit_connection.py dsr_bringup2/dsr_bringup2/moveit_connection.py:1 — 0.0% line coverage (0/55).
  • Low coverage: dsr_bringup2/dsr_bringup2/run_emulator.py dsr_bringup2/dsr_bringup2/run_emulator.py:1 — 0.0% line coverage (0/59).
  • Low coverage: dsr_bringup2/dsr_bringup2/set_config.py dsr_bringup2/dsr_bringup2/set_config.py:1 — 0.0% line coverage (0/32).
  • Low coverage: dsr_bringup2/dsr_bringup2/utils.py dsr_bringup2/dsr_bringup2/utils.py:1 — 0.0% line coverage (0/98).
  • Low coverage: dsr_bringup2/setup.py dsr_bringup2/setup.py:1 — 0.0% line coverage (0/7).
  • Low coverage: dsr_example2/dsr_example/dsr_example/demo/dance_m1013.py dsr_example2/dsr_example/dsr_example/demo/dance_m1013.py:1 — 0.0% line coverage (0/90).
  • Low coverage: dsr_example2/dsr_example/dsr_example/demo/slope_demo.py dsr_example2/dsr_example/dsr_example/demo/slope_demo.py:1 — 0.0% line coverage (0/54).
  • Low coverage: dsr_example2/dsr_example/dsr_example/simple/single_robot_simple.py dsr_example2/dsr_example/dsr_example/simple/single_robot_simple.py:1 — 0.0% line coverage (0/69).
  • Low coverage: REDACTED REDACTED:1 — 0.0% line coverage (0/28).
  • Low coverage: REDACTED REDACTED:1 — 0.0% line coverage (0/33).
  • Low coverage: dsr_tests/setup.py dsr_tests/setup.py:1 — 0.0% line coverage (0/5).
  • Low coverage: dsr_example2/dsr_example/setup.py dsr_example2/dsr_example/setup.py:1 — 0.0% line coverage (0/3).
  • Low coverage: dsr_example2/dsr_visualservoing/dsr_visualservoing/camera_publisher.py dsr_example2/dsr_visualservoing/dsr_visualservoing/camera_publisher.py:1 — 0.0% line coverage (0/36).
  • Low coverage: dsr_example2/dsr_visualservoing/dsr_visualservoing/detect_marker_gz.py dsr_example2/dsr_visualservoing/dsr_visualservoing/detect_marker_gz.py:1 — 0.0% line coverage (0/139).
  • Low coverage: dsr_example2/dsr_visualservoing/dsr_visualservoing/joint90.py dsr_example2/dsr_visualservoing/dsr_visualservoing/joint90.py:1 — 0.0% line coverage (0/32).
  • Low coverage: dsr_example2/dsr_visualservoing/dsr_visualservoing/send_pose_servol_gz.py dsr_example2/dsr_visualservoing/dsr_visualservoing/send_pose_servol_gz.py:1 — 0.0% line coverage (0/57).
  • Low coverage: dsr_example2/dsr_visualservoing/setup.py dsr_example2/dsr_visualservoing/setup.py:1 — 0.0% line coverage (0/6).
D17 · Explicit Debt · TodoComment · ×18
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:32 — ### !Note: Currently, real mode doesn't work. (TODO) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:62 — # TODO: handle node only once over classes. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:167 — ## TODO: fix hard code section — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:195 — ## TODO: fix hard code section — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:223 — ## TODO: fix hard code section — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:398 — ## TODO: fix hard code section — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:581 — ## TODO: fix hard code section — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:847 — ## TODO: fix hard code section — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:306 — ## TODO: Move home service occurs asynchronously. need to update logic to wait. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:326 — # ## TODO: fix hard code section — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:891 — # ## TODO: fix hard code section — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:1965 — ### Note: we added sleep to make sure set_current_tool works (TODO: Fix service) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:2017 — ### Note: we added sleep to make sure set_current_tool works (TODO: Fix service) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:2731 — ### Note: we added sleep to make sure set_current_tool works (TODO: Fix service) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:2375 — # """ TODO : Operating in API but not operating in ROS 2 """ — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:2413 — # """ TODO : Operating in API but not operating in ROS 2 """ — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:2536 — # """ TODO : Do not create Coordinate Transform Result """ — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
  • TodoComment dsr_tests/test/test_cli_dsr_system.py:2781 — ### Note: we added sleep to make sure set_current_tool works (TODO: Fix ) — 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.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×10
  • Duplicated block (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1061 — dsr_common2/imp/DSR_ROBOT2.py:1061-1076 | dsr_common2/imp/DSR_ROBOT2.py:7253-7268 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3281 — dsr_common2/imp/DSR_ROBOT2.py:3281-3296 | dsr_common2/imp/DSR_ROBOT2.py:8420-8435 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3425 — dsr_common2/imp/DSR_ROBOT2.py:3425-3440 | dsr_common2/imp/DSR_ROBOT2.py:8564-8579 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3578 — dsr_common2/imp/DSR_ROBOT2.py:3578-3593 | dsr_common2/imp/DSR_ROBOT2.py:8717-8732 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5251 — dsr_common2/imp/DSR_ROBOT2.py:5251-5266 | dsr_common2/imp/DSR_ROBOT2.py:10385-10400 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5323 — dsr_common2/imp/DSR_ROBOT2.py:5323-5338 | dsr_common2/imp/DSR_ROBOT2.py:10457-10472 — both copies are in the same file, so extract the 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 (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2808 — dsr_common2/imp/DSR_ROBOT2.py:2808-2823 | dsr_common2/imp/DSR_ROBOT2.py:7951-7966 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2972 — dsr_common2/imp/DSR_ROBOT2.py:2972-2987 | dsr_common2/imp/DSR_ROBOT2.py:8111-8126 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3166 — dsr_common2/imp/DSR_ROBOT2.py:3166-3181 | dsr_common2/imp/DSR_ROBOT2.py:8299-8314 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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 (16 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3711 — dsr_common2/imp/DSR_ROBOT2.py:3711-3726 | dsr_common2/imp/DSR_ROBOT2.py:8847-8862 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×9
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1351 — dsr_common2/imp/DSR_ROBOT2.py:1351-1369 | dsr_common2/imp/DSR_ROBOT2.py:7545-7563 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1424 — dsr_common2/imp/DSR_ROBOT2.py:1424-1442 | dsr_common2/imp/DSR_ROBOT2.py:7618-7636 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1476 — dsr_common2/imp/DSR_ROBOT2.py:1476-1494 | dsr_common2/imp/DSR_ROBOT2.py:7670-7688 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3546 — dsr_common2/imp/DSR_ROBOT2.py:3546-3564 | dsr_common2/imp/DSR_ROBOT2.py:8685-8703 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4313 — dsr_common2/imp/DSR_ROBOT2.py:4313-4331 | dsr_common2/imp/DSR_ROBOT2.py:4359-4377 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5140 — dsr_common2/imp/DSR_ROBOT2.py:5140-5158 | dsr_common2/imp/DSR_ROBOT2.py:5196-5214 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5151 — dsr_common2/imp/DSR_ROBOT2.py:5151-5169 | dsr_common2/imp/DSR_ROBOT2.py:10285-10303 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:9447 — dsr_common2/imp/DSR_ROBOT2.py:9447-9465 | dsr_common2/imp/DSR_ROBOT2.py:9493-9511 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:10274 — dsr_common2/imp/DSR_ROBOT2.py:10274-10292 | dsr_common2/imp/DSR_ROBOT2.py:10330-10348 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×9
  • Duplicated block (13 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:679 — dsr_common2/imp/DSR_ROBOT2.py:679-691 | dsr_common2/imp/DSR_ROBOT2.py:6882-6894 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (13 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:975 — dsr_common2/imp/DSR_ROBOT2.py:975-987 | dsr_common2/imp/DSR_ROBOT2.py:7166-7178 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (13 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1010 — dsr_common2/imp/DSR_ROBOT2.py:1010-1022 | dsr_common2/imp/DSR_ROBOT2.py:7201-7213 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:1092 — dsr_common2/imp/DSR_ROBOT2.py:1092-1104 | dsr_common2/imp/DSR_ROBOT2.py:7284-7296 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (13 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1200 — dsr_common2/imp/DSR_ROBOT2.py:1200-1212 | dsr_common2/imp/DSR_ROBOT2.py:7392-7404 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (13 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4068 — dsr_common2/imp/DSR_ROBOT2.py:4068-4080 | dsr_common2/imp/DSR_ROBOT2.py:9202-9214 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (13 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4341 — dsr_common2/imp/DSR_ROBOT2.py:4341-4353 | dsr_common2/imp/DSR_ROBOT2.py:4386-4398 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:5301 — dsr_common2/imp/DSR_ROBOT2.py:5301-5313 | dsr_common2/imp/DSR_ROBOT2.py:10435-10447 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (13 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:9475 — dsr_common2/imp/DSR_ROBOT2.py:9475-9487 | dsr_common2/imp/DSR_ROBOT2.py:9520-9532 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Edited copy of a member (16 corresponding lines) · ×8
  • Edited copy of a member (16 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:696 — dsr_common2/imp/DSR_ROBOT2.py:696-711 | dsr_common2/imp/DSR_ROBOT2.py:6899-6914 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:715 — dsr_common2/imp/DSR_ROBOT2.py:715-730 | dsr_common2/imp/DSR_ROBOT2.py:6918-6933 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:757 — dsr_common2/imp/DSR_ROBOT2.py:757-772 | dsr_common2/imp/DSR_ROBOT2.py:6960-6975 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:841 — dsr_common2/imp/DSR_ROBOT2.py:841-856 | dsr_common2/imp/DSR_ROBOT2.py:7044-7059 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:885 — dsr_common2/imp/DSR_ROBOT2.py:885-900 | dsr_common2/imp/DSR_ROBOT2.py:7088-7103 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:903 — dsr_common2/imp/DSR_ROBOT2.py:903-918 | dsr_common2/imp/DSR_ROBOT2.py:7106-7121 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:3885 — dsr_common2/imp/DSR_ROBOT2.py:3885-3900 | dsr_common2/imp/DSR_ROBOT2.py:9019-9034 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:6637 — dsr_common2/imp/DSR_ROBOT2.py:6637-6653 | dsr_common2/imp/DSR_ROBOT2.py:11770-11785 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×5
  • Duplicated block (14 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:822 — dsr_common2/imp/DSR_ROBOT2.py:822-835 | dsr_common2/imp/DSR_ROBOT2.py:1168-1181 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:1125 — dsr_common2/imp/DSR_ROBOT2.py:1125-1138 | dsr_common2/imp/DSR_ROBOT2.py:7317-7330 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (14 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2654 — dsr_common2/imp/DSR_ROBOT2.py:2654-2667 | dsr_common2/imp/DSR_ROBOT2.py:7803-7816 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (14 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5519 — dsr_common2/imp/DSR_ROBOT2.py:5519-5532 | dsr_common2/imp/DSR_ROBOT2.py:10653-10666 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:7025 — dsr_common2/imp/DSR_ROBOT2.py:7025-7038 | dsr_common2/imp/DSR_ROBOT2.py:7360-7373 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×5
  • Duplicated block (8 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1859 — dsr_common2/imp/DSR_ROBOT2.py:1859-1866 | dsr_common2/imp/DSR_ROBOT2.py:1872-1879 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:2640 — dsr_common2/imp/DSR_ROBOT2.py:2640-2647 | dsr_common2/imp/DSR_ROBOT2.py:7793-7800 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:3567 — dsr_common2/imp/DSR_ROBOT2.py:3567-3574 | dsr_common2/imp/DSR_ROBOT2.py:8706-8713 — both copies are in the same file, so extract the block into 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) dsr_controller2/launch/dsr_moveit2.launch.py:31 — dsr_controller2/launch/dsr_moveit2.launch.py:31-38 | dsr_description2/launch/dsr_description.launch.py:32-39 — before extracting anything, compare `dsr_controller2/launch/dsr_moveit2.launch.py` and `dsr_description2/launch/dsr_description.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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. 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) dsr_controller2/launch/dsr_moveit2.launch.py:41 — dsr_controller2/launch/dsr_moveit2.launch.py:41-48 | dsr_description2/launch/dsr_description.launch.py:42-49 — before extracting anything, compare `dsr_controller2/launch/dsr_moveit2.launch.py` and `dsr_description2/launch/dsr_description.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 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. 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.
D3 · God Classes · FileTooLong · ×4
  • FileTooLong: imp/DSR_ROBOT2.py dsr_common2/imp/DSR_ROBOT2.py — FileTooLong — 8764 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 8264 over it, 17.53× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: launch/start.launch.py dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py — FileTooLong — 567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 67 over it, 1.13× 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: launch/start.launch.py dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py — FileTooLong — 567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 67 over it, 1.13× 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: launch/start.launch.py dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py — FileTooLong — 567 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 67 over it, 1.13× 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.
D4 · Code Duplication · Duplicated block (24 lines × 2) · ×4
  • Duplicated block (24 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2588 — dsr_common2/imp/DSR_ROBOT2.py:2588-2611 | dsr_common2/imp/DSR_ROBOT2.py:2721-2744 — both copies are in the same file, so extract the block into 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 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3243 — dsr_common2/imp/DSR_ROBOT2.py:3243-3266 | dsr_common2/imp/DSR_ROBOT2.py:8376-8399 — both copies are in the same file, so extract the block into 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 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5886 — dsr_common2/imp/DSR_ROBOT2.py:5886-5909 | dsr_common2/imp/DSR_ROBOT2.py:11019-11042 — both copies are in the same file, so extract the block into 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 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:6086 — dsr_common2/imp/DSR_ROBOT2.py:6086-6109 | dsr_common2/imp/DSR_ROBOT2.py:11219-11242 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×4
  • Duplicated block (10 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2364 — dsr_common2/imp/DSR_ROBOT2.py:2364-2373 | dsr_common2/imp/DSR_ROBOT2.py:2393-2402 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:2791 — dsr_common2/imp/DSR_ROBOT2.py:2791-2800 | dsr_common2/imp/DSR_ROBOT2.py:7937-7946 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:4083 — dsr_common2/imp/DSR_ROBOT2.py:4083-4092 | dsr_common2/imp/DSR_ROBOT2.py:9217-9226 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DR_tcp_client2.py:152 — dsr_common2/imp/DR_tcp_client2.py:152-161 | dsr_common2/imp/DR_tcp_server2.py:177-186 — 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.
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (6 members, 50+ identical tokens) · ×3
  • Members sharing a duplicated core (6 members, 50+ identical tokens) dsr_common2/imp/DSR_ROBOT2.py:822 — dsr_common2/imp/DSR_ROBOT2.py:822-837 | dsr_common2/imp/DSR_ROBOT2.py:1168-1183 | dsr_common2/imp/DSR_ROBOT2.py:1278-1296 | dsr_common2/imp/DSR_ROBOT2.py:7025-7040 | dsr_common2/imp/DSR_ROBOT2.py:7360-7375 | dsr_common2/imp/DSR_ROBOT2.py:7471-7489 — 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) dsr_common2/imp/DSR_ROBOT2.py:1108 — dsr_common2/imp/DSR_ROBOT2.py:1108-1138 | dsr_common2/imp/DSR_ROBOT2.py:1351-1388 | dsr_common2/imp/DSR_ROBOT2.py:3929-3983 | dsr_common2/imp/DSR_ROBOT2.py:7300-7330 | dsr_common2/imp/DSR_ROBOT2.py:7545-7582 | dsr_common2/imp/DSR_ROBOT2.py:9063-9117 — 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) dsr_common2/imp/DSR_ROBOT2.py:1589 — dsr_common2/imp/DSR_ROBOT2.py:1589-1657 | dsr_common2/imp/DSR_ROBOT2.py:1661-1713 | dsr_common2/imp/DSR_ROBOT2.py:1717-1777 | dsr_common2/imp/DSR_ROBOT2.py:1904-1939 | dsr_common2/imp/DSR_ROBOT2.py:1942-1992 | dsr_common2/imp/DSR_ROBOT2.py:1996-2022 — These 6 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
D4 · Code Duplication · Edited copy of a member (21 corresponding lines) · ×3
  • Edited copy of a member (21 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:671 — dsr_common2/imp/DSR_ROBOT2.py:671-691 | dsr_common2/imp/DSR_ROBOT2.py:6874-6894 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (21 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:2100 — dsr_common2/imp/DSR_ROBOT2.py:2100-2120 | dsr_common2/imp/DSR_ROBOT2.py:2123-2149 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (21 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:4060 — dsr_common2/imp/DSR_ROBOT2.py:4060-4080 | dsr_common2/imp/DSR_ROBOT2.py:9194-9214 — These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×3
  • Duplicated block (21 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:548 — dsr_common2/imp/DSR_ROBOT2.py:548-568 | dsr_common2/imp/DSR_ROBOT2.py:574-594 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (21 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1622 — dsr_common2/imp/DSR_ROBOT2.py:1622-1642 | dsr_common2/imp/DSR_ROBOT2.py:1743-1763 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (21 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:6011 — dsr_common2/imp/DSR_ROBOT2.py:6011-6031 | dsr_common2/imp/DSR_ROBOT2.py:11144-11164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (20 lines × 2) · ×3
  • Duplicated block (20 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3604 — dsr_common2/imp/DSR_ROBOT2.py:3604-3623 | dsr_common2/imp/DSR_ROBOT2.py:8743-8762 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (20 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4554 — dsr_common2/imp/DSR_ROBOT2.py:4554-4573 | dsr_common2/imp/DSR_ROBOT2.py:4605-4624 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (20 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:9688 — dsr_common2/imp/DSR_ROBOT2.py:9688-9707 | dsr_common2/imp/DSR_ROBOT2.py:9739-9758 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (18–19 lines × 2) · ×3
  • Duplicated block (18–19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1027 — dsr_common2/imp/DSR_ROBOT2.py:1027-1044 | dsr_common2/imp/DSR_ROBOT2.py:7218-7236 — both copies are in the same file, so extract the 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 (18–19 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5164 — dsr_common2/imp/DSR_ROBOT2.py:5164-5181 | dsr_common2/imp/DSR_ROBOT2.py:5220-5238 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:10298 — dsr_common2/imp/DSR_ROBOT2.py:10298-10315 | dsr_common2/imp/DSR_ROBOT2.py:10354-10372 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (15 lines × 2) · ×3
  • Duplicated block (15 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4372 — dsr_common2/imp/DSR_ROBOT2.py:4372-4386 | dsr_common2/imp/DSR_ROBOT2.py:9506-9520 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:4653 — dsr_common2/imp/DSR_ROBOT2.py:4653-4667 | dsr_common2/imp/DSR_ROBOT2.py:9787-9801 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:5817 — dsr_common2/imp/DSR_ROBOT2.py:5817-5831 | dsr_common2/imp/DSR_ROBOT2.py:10950-10964 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (12 lines × 6) · ×3
  • Duplicated block (12 lines × 6) dsr_common2/imp/DSR_ROBOT2.py:826 — dsr_common2/imp/DSR_ROBOT2.py:826-837 | dsr_common2/imp/DSR_ROBOT2.py:1172-1183 | dsr_common2/imp/DSR_ROBOT2.py:1285-1296 | dsr_common2/imp/DSR_ROBOT2.py:7029-7040 | dsr_common2/imp/DSR_ROBOT2.py:7364-7375 | dsr_common2/imp/DSR_ROBOT2.py:7478-7489 — 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 `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 lines × 6) dsr_common2/imp/DSR_ROBOT2.py:4719 — dsr_common2/imp/DSR_ROBOT2.py:4719-4730 | dsr_common2/imp/DSR_ROBOT2.py:4763-4774 | dsr_common2/imp/DSR_ROBOT2.py:5399-5410 | dsr_common2/imp/DSR_ROBOT2.py:9853-9864 | dsr_common2/imp/DSR_ROBOT2.py:9897-9908 | dsr_common2/imp/DSR_ROBOT2.py:10533-10544 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (12 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:127 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:127-138 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:147-158 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:127-138 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:147-158 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:127-138 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:147-158 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (11 lines × 4) · ×3
  • Duplicated block (11 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:807 — dsr_common2/imp/DSR_ROBOT2.py:807-817 | dsr_common2/imp/DSR_ROBOT2.py:1061-1071 | dsr_common2/imp/DSR_ROBOT2.py:7010-7020 | dsr_common2/imp/DSR_ROBOT2.py:7253-7263 — 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 (11 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:975 — dsr_common2/imp/DSR_ROBOT2.py:975-985 | dsr_common2/imp/DSR_ROBOT2.py:1125-1135 | dsr_common2/imp/DSR_ROBOT2.py:7166-7176 | dsr_common2/imp/DSR_ROBOT2.py:7317-7327 — 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 (11 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:6014 — dsr_common2/imp/DSR_ROBOT2.py:6014-6024 | dsr_common2/imp/DSR_ROBOT2.py:6052-6062 | dsr_common2/imp/DSR_ROBOT2.py:11147-11157 | dsr_common2/imp/DSR_ROBOT2.py:11185-11195 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (10 lines × 4) · ×3
  • Duplicated block (10 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:2381 — dsr_common2/imp/DSR_ROBOT2.py:2381-2390 | dsr_common2/imp/DSR_ROBOT2.py:2410-2419 | dsr_common2/imp/DSR_ROBOT2.py:2437-2446 | dsr_common2/imp/DSR_ROBOT2.py:2464-2473 — 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. 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 (10 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4196 — dsr_common2/imp/DSR_ROBOT2.py:4196-4205 | dsr_common2/imp/DSR_ROBOT2.py:4415-4424 | dsr_common2/imp/DSR_ROBOT2.py:9330-9339 | dsr_common2/imp/DSR_ROBOT2.py:9549-9558 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (10 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4304 — dsr_common2/imp/DSR_ROBOT2.py:4304-4313 | dsr_common2/imp/DSR_ROBOT2.py:4545-4554 | dsr_common2/imp/DSR_ROBOT2.py:9438-9447 | dsr_common2/imp/DSR_ROBOT2.py:9679-9688 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_common2/imp/DSR_ROBOT2.py:4543` calls `get_posx` and `dsr_common2/imp/DSR_ROBOT2.py:4302` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×3
  • Duplicated block (9 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2957 — dsr_common2/imp/DSR_ROBOT2.py:2957-2965 | dsr_common2/imp/DSR_ROBOT2.py:8099-8107 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:3413 — dsr_common2/imp/DSR_ROBOT2.py:3413-3421 | dsr_common2/imp/DSR_ROBOT2.py:8552-8560 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:3696 — dsr_common2/imp/DSR_ROBOT2.py:3696-3704 | dsr_common2/imp/DSR_ROBOT2.py:8835-8843 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (6 lines × 4) · ×3
  • Duplicated block (6 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:2958 — dsr_common2/imp/DSR_ROBOT2.py:2958-2963 | dsr_common2/imp/DSR_ROBOT2.py:3150-3155 | dsr_common2/imp/DSR_ROBOT2.py:8100-8105 | dsr_common2/imp/DSR_ROBOT2.py:8285-8290 — 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 (6 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:3414 — dsr_common2/imp/DSR_ROBOT2.py:3414-3419 | dsr_common2/imp/DSR_ROBOT2.py:3568-3573 | dsr_common2/imp/DSR_ROBOT2.py:8553-8558 | dsr_common2/imp/DSR_ROBOT2.py:8707-8712 — 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 (6 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4556 — dsr_common2/imp/DSR_ROBOT2.py:4556-4561 | dsr_common2/imp/DSR_ROBOT2.py:4607-4612 | dsr_common2/imp/DSR_ROBOT2.py:9690-9695 | dsr_common2/imp/DSR_ROBOT2.py:9741-9746 — 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.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (10 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (10 members, 50+ identical tokens) dsr_common2/imp/DSR_ROBOT2.py:5834 — dsr_common2/imp/DSR_ROBOT2.py:5834-5857 | dsr_common2/imp/DSR_ROBOT2.py:5860-5883 | dsr_common2/imp/DSR_ROBOT2.py:5930-5953 | dsr_common2/imp/DSR_ROBOT2.py:6130-6154 | dsr_common2/imp/DSR_ROBOT2.py:6300-6321 | dsr_common2/imp/DSR_ROBOT2.py:10967-10990 | dsr_common2/imp/DSR_ROBOT2.py:10993-11016 | dsr_common2/imp/DSR_ROBOT2.py:11063-11086 | dsr_common2/imp/DSR_ROBOT2.py:11263-11287 | dsr_common2/imp/DSR_ROBOT2.py:11433-11454 — These 10 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 10 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 10 times.
  • Members sharing a duplicated core (10 members, 50+ identical tokens) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:212 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:214-366 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:212-364 — These 10 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 10 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 10 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (4 members, 50+ identical tokens) dsr_common2/imp/DSR_ROBOT2.py:799 — dsr_common2/imp/DSR_ROBOT2.py:799-818 | dsr_common2/imp/DSR_ROBOT2.py:1049-1076 | dsr_common2/imp/DSR_ROBOT2.py:7002-7021 | dsr_common2/imp/DSR_ROBOT2.py:7241-7268 — 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) dsr_common2/imp/DSR_ROBOT2.py:6355 — dsr_common2/imp/DSR_ROBOT2.py:6355-6371 | dsr_common2/imp/DSR_ROBOT2.py:6405-6421 | dsr_common2/imp/DSR_ROBOT2.py:11488-11504 | dsr_common2/imp/DSR_ROBOT2.py:11538-11554 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Edited copy of a member (35 corresponding lines) · ×2
  • Edited copy of a member (35 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:1010 — dsr_common2/imp/DSR_ROBOT2.py:1010-1044 | dsr_common2/imp/DSR_ROBOT2.py:7201-7236 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (35 corresponding lines) dsr_common2/imp/DR_tcp_client2.py:327 — dsr_common2/imp/DR_tcp_client2.py:327-361 | dsr_common2/imp/DR_tcp_server2.py:349-383 — These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (25 corresponding lines) · ×2
  • Edited copy of a member (25 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:1188 — dsr_common2/imp/DSR_ROBOT2.py:1188-1212 | dsr_common2/imp/DSR_ROBOT2.py:7380-7404 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (25 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:1080 — dsr_common2/imp/DSR_ROBOT2.py:1080-1104 | dsr_common2/imp/DSR_ROBOT2.py:7272-7296 — These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (22 corresponding lines) · ×2
  • Edited copy of a member (22 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:5317 — dsr_common2/imp/DSR_ROBOT2.py:5317-5338 | dsr_common2/imp/DSR_ROBOT2.py:10451-10472 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (22 corresponding lines) dsr_common2/imp/DR_tcp_client2.py:196 — dsr_common2/imp/DR_tcp_client2.py:196-218 | dsr_common2/imp/DR_tcp_server2.py:221-242 — These two members are one piece of code written twice and then edited apart: 22 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (17 corresponding lines) · ×2
  • Edited copy of a member (17 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:4147 — dsr_common2/imp/DSR_ROBOT2.py:4147-4163 | dsr_common2/imp/DSR_ROBOT2.py:9281-9297 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:652 — dsr_common2/imp/DSR_ROBOT2.py:652-668 | dsr_common2/imp/DSR_ROBOT2.py:6855-6871 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×2
  • Edited copy of a member (10 corresponding lines) dsr_common2/imp/DR_common2.py:238 — dsr_common2/imp/DR_common2.py:238-247 | dsr_common2/imp/DR_common2.py:261-270 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) dsr_example2/dsr_visualservoing/dsr_visualservoing/camera_publisher.py:55 — dsr_example2/dsr_visualservoing/dsr_visualservoing/camera_publisher.py:55-64 | dsr_example2/dsr_visualservoing/dsr_visualservoing/detect_marker_gz.py:215-224 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (59 lines × 3) · ×2
  • Duplicated block (59 lines × 3) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:132 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:132-190 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:132-190 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:132-190 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 541 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:132` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (59 lines × 3) dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:152 — dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:152-210 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:152-210 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:152-210 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 576 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:152` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (35 lines × 2) · ×2
  • Duplicated block (35 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3451 — dsr_common2/imp/DSR_ROBOT2.py:3451-3485 | dsr_common2/imp/DSR_ROBOT2.py:8590-8624 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (35 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3929 — dsr_common2/imp/DSR_ROBOT2.py:3929-3963 | dsr_common2/imp/DSR_ROBOT2.py:9063-9097 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (29 lines × 2) · ×2
  • Duplicated block (29 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2607 — dsr_common2/imp/DSR_ROBOT2.py:2607-2635 | dsr_common2/imp/DSR_ROBOT2.py:7760-7788 — both copies are in the same file, so extract the 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 `dsr_common2/imp/DSR_ROBOT2.py:2607` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
  • Duplicated block (29 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3665 — dsr_common2/imp/DSR_ROBOT2.py:3665-3693 | dsr_common2/imp/DSR_ROBOT2.py:8804-8832 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (18 lines × 8) · ×2
  • Duplicated block (18 lines × 8) dsr_common2/imp/DSR_ROBOT2.py:1517 — dsr_common2/imp/DSR_ROBOT2.py:1517-1534 | dsr_common2/imp/DSR_ROBOT2.py:1787-1804 | dsr_common2/imp/DSR_ROBOT2.py:2551-2568 | dsr_common2/imp/DSR_ROBOT2.py:2684-2701 | dsr_common2/imp/DSR_ROBOT2.py:3203-3220 | dsr_common2/imp/DSR_ROBOT2.py:7704-7721 | dsr_common2/imp/DSR_ROBOT2.py:7832-7849 | dsr_common2/imp/DSR_ROBOT2.py:8336-8353 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_common2/imp/DSR_ROBOT2.py:1517` 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 (18 lines × 8) dsr_common2/imp/DSR_ROBOT2.py:2839 — dsr_common2/imp/DSR_ROBOT2.py:2839-2856 | dsr_common2/imp/DSR_ROBOT2.py:3011-3028 | dsr_common2/imp/DSR_ROBOT2.py:3319-3336 | dsr_common2/imp/DSR_ROBOT2.py:3487-3504 | dsr_common2/imp/DSR_ROBOT2.py:7983-8000 | dsr_common2/imp/DSR_ROBOT2.py:8148-8165 | dsr_common2/imp/DSR_ROBOT2.py:8458-8475 | dsr_common2/imp/DSR_ROBOT2.py:8626-8643 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_common2/imp/DSR_ROBOT2.py:2839` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×2
  • Duplicated block (18 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:1688 — dsr_common2/imp/DSR_ROBOT2.py:1688-1705 | dsr_common2/imp/DSR_ROBOT2.py:1914-1931 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:3625 — dsr_common2/imp/DSR_ROBOT2.py:3625-3642 | dsr_common2/imp/DSR_ROBOT2.py:8764-8781 — both copies are in the same file, so extract the 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 `dsr_common2/imp/DSR_ROBOT2.py:3625` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3811 — dsr_common2/imp/DSR_ROBOT2.py:3811-3827 | dsr_common2/imp/DSR_ROBOT2.py:8944-8960 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
  • Duplicated block (17 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5553 — dsr_common2/imp/DSR_ROBOT2.py:5553-5569 | dsr_common2/imp/DSR_ROBOT2.py:10687-10703 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (16 lines × 4) · ×2
  • Duplicated block (16 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4186 — dsr_common2/imp/DSR_ROBOT2.py:4186-4201 | dsr_common2/imp/DSR_ROBOT2.py:4811-4826 | dsr_common2/imp/DSR_ROBOT2.py:9320-9335 | dsr_common2/imp/DSR_ROBOT2.py:9945-9960 — 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 (16 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4257 — dsr_common2/imp/DSR_ROBOT2.py:4257-4272 | dsr_common2/imp/DSR_ROBOT2.py:4482-4497 | dsr_common2/imp/DSR_ROBOT2.py:9391-9406 | dsr_common2/imp/DSR_ROBOT2.py:9616-9631 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (16 lines × 3) · ×2
  • Duplicated block (16 lines × 3) dsr_common2/imp/DSR_ROBOT2.py:1601 — dsr_common2/imp/DSR_ROBOT2.py:1601-1616 | dsr_common2/imp/DSR_ROBOT2.py:1620-1635 | dsr_common2/imp/DSR_ROBOT2.py:1741-1756 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (16 lines × 3) dsr_common2/imp/DSR_ROBOT2.py:4583 — dsr_common2/imp/DSR_ROBOT2.py:4583-4598 | dsr_common2/imp/DSR_ROBOT2.py:4631-4646 | dsr_common2/imp/DSR_ROBOT2.py:9765-9780 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (14–15 lines × 4) · ×2
  • Duplicated block (14–15 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4935 — dsr_common2/imp/DSR_ROBOT2.py:4935-4949 | dsr_common2/imp/DSR_ROBOT2.py:5787-5800 | dsr_common2/imp/DSR_ROBOT2.py:10069-10083 | dsr_common2/imp/DSR_ROBOT2.py:10921-10934 — 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. 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 (14–15 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:5207 — dsr_common2/imp/DSR_ROBOT2.py:5207-5220 | dsr_common2/imp/DSR_ROBOT2.py:5231-5245 | dsr_common2/imp/DSR_ROBOT2.py:10341-10354 | dsr_common2/imp/DSR_ROBOT2.py:10365-10379 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (13 lines × 8) · ×2
  • Duplicated block (13 lines × 8) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:167 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:167-179 | dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:153-165 | dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:190-202 | dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:252-265 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:262-275 | dsr_controller2/launch/dsr_controller2.launch.py:117-129 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:175-187 | dsr_tests/launch/dsr_spawner_cli_test.launch.py:34-46 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:149` calls `LaunchConfiguration` and `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:164` 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 (13 lines × 8) dsr_common2/imp/DSR_ROBOT2.py:5149 — dsr_common2/imp/DSR_ROBOT2.py:5149-5162 | dsr_common2/imp/DSR_ROBOT2.py:5172-5184 | dsr_common2/imp/DSR_ROBOT2.py:5205-5217 | dsr_common2/imp/DSR_ROBOT2.py:5229-5241 | dsr_common2/imp/DSR_ROBOT2.py:10283-10296 | dsr_common2/imp/DSR_ROBOT2.py:10306-10318 | dsr_common2/imp/DSR_ROBOT2.py:10339-10351 | dsr_common2/imp/DSR_ROBOT2.py:10363-10375 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (12 lines × 5) · ×2
  • Duplicated block (12 lines × 5) dsr_common2/imp/DSR_ROBOT2.py:1631 — dsr_common2/imp/DSR_ROBOT2.py:1631-1642 | dsr_common2/imp/DSR_ROBOT2.py:1688-1699 | dsr_common2/imp/DSR_ROBOT2.py:1752-1763 | dsr_common2/imp/DSR_ROBOT2.py:1914-1925 | dsr_common2/imp/DSR_ROBOT2.py:1998-2009 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_common2/imp/DSR_ROBOT2.py:1627` calls `DR_Error` and `dsr_common2/imp/DSR_ROBOT2.py:1687` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (12 lines × 5) dsr_common2/imp/DSR_ROBOT2.py:2261 — dsr_common2/imp/DSR_ROBOT2.py:2261-2272 | dsr_common2/imp/DSR_ROBOT2.py:2284-2295 | dsr_common2/imp/DSR_ROBOT2.py:2317-2328 | dsr_common2/imp/DSR_ROBOT2.py:2350-2361 | dsr_common2/imp/DSR_ROBOT2.py:2524-2535 — 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. 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.
D4 · Code Duplication · Duplicated block (12 lines × 4) · ×2
  • Duplicated block (12 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4218 — dsr_common2/imp/DSR_ROBOT2.py:4218-4229 | dsr_common2/imp/DSR_ROBOT2.py:4437-4448 | dsr_common2/imp/DSR_ROBOT2.py:9352-9363 | dsr_common2/imp/DSR_ROBOT2.py:9571-9582 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
  • Duplicated block (12 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:5437 — dsr_common2/imp/DSR_ROBOT2.py:5437-5448 | dsr_common2/imp/DSR_ROBOT2.py:5524-5535 | dsr_common2/imp/DSR_ROBOT2.py:10571-10582 | dsr_common2/imp/DSR_ROBOT2.py:10658-10669 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×2
  • Duplicated block (11 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:925 — dsr_common2/imp/DSR_ROBOT2.py:925-935 | dsr_common2/imp/DSR_ROBOT2.py:950-960 — both copies are in the same file, so extract the block into 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) dsr_common2/imp/DSR_ROBOT2.py:3149 — dsr_common2/imp/DSR_ROBOT2.py:3149-3159 | dsr_common2/imp/DSR_ROBOT2.py:8284-8294 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×2
  • Duplicated block (6 lines × 2) dsr_bringup2/dsr_bringup2/moveit_connection.py:38 — dsr_bringup2/dsr_bringup2/moveit_connection.py:38-43 | dsr_bringup2/dsr_bringup2/set_config.py:57-62 — 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) dsr_common2/imp/DSR_ROBOT2.py:3799 — dsr_common2/imp/DSR_ROBOT2.py:3799-3804 | dsr_common2/imp/DSR_ROBOT2.py:8935-8940 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D1 · Cyclomatic Complexity · CDsrRobot.set_user_cart_coord (cyclomatic 84) · ×1
  • CDsrRobot.set_user_cart_coord (cyclomatic 84) dsr_common2/imp/DSR_ROBOT2.py:10085 — CDsrRobot.set_user_cart_coord 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2.set_user_cart_coord) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.set_user_cart_coord (cyclomatic 84) · ×1
  • DSR_ROBOT2.set_user_cart_coord (cyclomatic 84) dsr_common2/imp/DSR_ROBOT2.py:4951 — DSR_ROBOT2.set_user_cart_coord 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. This shape REPEATS in the file: one other method here (CDsrRobot.set_user_cart_coord) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.align_axis (cyclomatic 68) · ×1
  • CDsrRobot.align_axis (cyclomatic 68) dsr_common2/imp/DSR_ROBOT2.py:9537 — CDsrRobot.align_axis has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (DSR_ROBOT2.align_axis) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.align_axis (cyclomatic 68) · ×1
  • DSR_ROBOT2.align_axis (cyclomatic 68) dsr_common2/imp/DSR_ROBOT2.py:4403 — DSR_ROBOT2.align_axis has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (CDsrRobot.align_axis) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.parallel_axis (cyclomatic 62) · ×1
  • CDsrRobot.parallel_axis (cyclomatic 62) dsr_common2/imp/DSR_ROBOT2.py:9319 — CDsrRobot.parallel_axis has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (DSR_ROBOT2.parallel_axis) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.parallel_axis (cyclomatic 62) · ×1
  • DSR_ROBOT2.parallel_axis (cyclomatic 62) dsr_common2/imp/DSR_ROBOT2.py:4185 — DSR_ROBOT2.parallel_axis has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (CDsrRobot.parallel_axis) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.check_orientation_condition (cyclomatic 57) · ×1
  • CDsrRobot.check_orientation_condition (cyclomatic 57) dsr_common2/imp/DSR_ROBOT2.py:10725 — CDsrRobot.check_orientation_condition has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (DSR_ROBOT2.check_orientation_condition) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.check_orientation_condition (cyclomatic 57) · ×1
  • DSR_ROBOT2.check_orientation_condition (cyclomatic 57) dsr_common2/imp/DSR_ROBOT2.py:5591 — DSR_ROBOT2.check_orientation_condition has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (CDsrRobot.check_orientation_condition) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._movec (cyclomatic 54) · ×1
  • DSR_ROBOT2._movec (cyclomatic 54) dsr_common2/imp/DSR_ROBOT2.py:2997 — DSR_ROBOT2._movec has cyclomatic complexity 54 (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 file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._movec (cyclomatic 53) · ×1
  • CDsrRobot._movec (cyclomatic 53) dsr_common2/imp/DSR_ROBOT2.py:8134 — CDsrRobot._movec has cyclomatic complexity 53 (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 file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.calc_coord (cyclomatic 45) · ×1
  • CDsrRobot.calc_coord (cyclomatic 45) dsr_common2/imp/DSR_ROBOT2.py:9928 — CDsrRobot.calc_coord has cyclomatic complexity 45 (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 (DSR_ROBOT2.calc_coord) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._movejx (cyclomatic 45) · ×1
  • DSR_ROBOT2._movejx (cyclomatic 45) dsr_common2/imp/DSR_ROBOT2.py:2676 — DSR_ROBOT2._movejx has cyclomatic complexity 45 (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 file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._movel (cyclomatic 45) · ×1
  • DSR_ROBOT2._movel (cyclomatic 45) dsr_common2/imp/DSR_ROBOT2.py:2831 — DSR_ROBOT2._movel has cyclomatic complexity 45 (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 file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.calc_coord (cyclomatic 45) · ×1
  • DSR_ROBOT2.calc_coord (cyclomatic 45) dsr_common2/imp/DSR_ROBOT2.py:4794 — DSR_ROBOT2.calc_coord has cyclomatic complexity 45 (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 (CDsrRobot.calc_coord) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._movejx (cyclomatic 44) · ×1
  • CDsrRobot._movejx (cyclomatic 44) dsr_common2/imp/DSR_ROBOT2.py:7824 — CDsrRobot._movejx has cyclomatic complexity 44 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._movel (cyclomatic 44) · ×1
  • CDsrRobot._movel (cyclomatic 44) dsr_common2/imp/DSR_ROBOT2.py:7975 — CDsrRobot._movel has cyclomatic complexity 44 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._moveb (cyclomatic 42) · ×1
  • CDsrRobot._moveb (cyclomatic 42) dsr_common2/imp/DSR_ROBOT2.py:8587 — CDsrRobot._moveb 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2._moveb) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._moveb (cyclomatic 42) · ×1
  • DSR_ROBOT2._moveb (cyclomatic 42) dsr_common2/imp/DSR_ROBOT2.py:3448 — DSR_ROBOT2._moveb 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. This shape REPEATS in the file: one other method here (CDsrRobot._moveb) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._move_spiral (cyclomatic 42) · ×1
  • DSR_ROBOT2._move_spiral (cyclomatic 42) dsr_common2/imp/DSR_ROBOT2.py:3602 — DSR_ROBOT2._move_spiral 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._movesx (cyclomatic 41) · ×1
  • CDsrRobot._movesx (cyclomatic 41) dsr_common2/imp/DSR_ROBOT2.py:8445 — CDsrRobot._movesx 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2._movesx) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._move_spiral (cyclomatic 41) · ×1
  • CDsrRobot._move_spiral (cyclomatic 41) dsr_common2/imp/DSR_ROBOT2.py:8741 — CDsrRobot._move_spiral 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._movesx (cyclomatic 41) · ×1
  • DSR_ROBOT2._movesx (cyclomatic 41) dsr_common2/imp/DSR_ROBOT2.py:3306 — DSR_ROBOT2._movesx 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. This shape REPEATS in the file: one other method here (CDsrRobot._movesx) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._movej (cyclomatic 38) · ×1
  • DSR_ROBOT2._movej (cyclomatic 38) dsr_common2/imp/DSR_ROBOT2.py:2543 — DSR_ROBOT2._movej has cyclomatic complexity 38 (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 file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._movej (cyclomatic 37) · ×1
  • CDsrRobot._movej (cyclomatic 37) dsr_common2/imp/DSR_ROBOT2.py:7696 — CDsrRobot._movej 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._movesj (cyclomatic 34) · ×1
  • CDsrRobot._movesj (cyclomatic 34) dsr_common2/imp/DSR_ROBOT2.py:8323 — CDsrRobot._movesj 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._movesj (cyclomatic 32) · ×1
  • DSR_ROBOT2._movesj (cyclomatic 32) dsr_common2/imp/DSR_ROBOT2.py:3190 — DSR_ROBOT2._movesj has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.check_position_condition (cyclomatic 29) · ×1
  • CDsrRobot.check_position_condition (cyclomatic 29) dsr_common2/imp/DSR_ROBOT2.py:10565 — CDsrRobot.check_position_condition has cyclomatic complexity 29 (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 (DSR_ROBOT2.check_position_condition) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.check_position_condition (cyclomatic 29) · ×1
  • DSR_ROBOT2.check_position_condition (cyclomatic 29) dsr_common2/imp/DSR_ROBOT2.py:5431 — DSR_ROBOT2.check_position_condition has cyclomatic complexity 29 (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 (CDsrRobot.check_position_condition) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.check_force_condition (cyclomatic 27) · ×1
  • CDsrRobot.check_force_condition (cyclomatic 27) dsr_common2/imp/DSR_ROBOT2.py:10651 — CDsrRobot.check_force_condition has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.servoj (cyclomatic 27) · ×1
  • DSR_ROBOT2.servoj (cyclomatic 27) dsr_common2/imp/DSR_ROBOT2.py:1509 — DSR_ROBOT2.servoj has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.add_modbus_signal (cyclomatic 26) · ×1
  • CDsrRobot.add_modbus_signal (cyclomatic 26) dsr_common2/imp/DSR_ROBOT2.py:11292 — CDsrRobot.add_modbus_signal has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (DSR_ROBOT2.add_modbus_signal) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2._move_periodic (cyclomatic 26) · ×1
  • DSR_ROBOT2._move_periodic (cyclomatic 26) dsr_common2/imp/DSR_ROBOT2.py:3734 — DSR_ROBOT2._move_periodic 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.add_modbus_signal (cyclomatic 26) · ×1
  • DSR_ROBOT2.add_modbus_signal (cyclomatic 26) dsr_common2/imp/DSR_ROBOT2.py:6159 — DSR_ROBOT2.add_modbus_signal has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (CDsrRobot.add_modbus_signal) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot._move_periodic (cyclomatic 25) · ×1
  • CDsrRobot._move_periodic (cyclomatic 25) dsr_common2/imp/DSR_ROBOT2.py:8870 — CDsrRobot._move_periodic 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.set_analog_output (cyclomatic 24) · ×1
  • CDsrRobot.set_analog_output (cyclomatic 24) dsr_common2/imp/DSR_ROBOT2.py:11089 — CDsrRobot.set_analog_output has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (DSR_ROBOT2.set_analog_output) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.set_analog_output (cyclomatic 24) · ×1
  • DSR_ROBOT2.set_analog_output (cyclomatic 24) dsr_common2/imp/DSR_ROBOT2.py:5956 — DSR_ROBOT2.set_analog_output has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (CDsrRobot.set_analog_output) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.servoj_rt (cyclomatic 23) · ×1
  • DSR_ROBOT2.servoj_rt (cyclomatic 23) dsr_common2/imp/DSR_ROBOT2.py:1779 — DSR_ROBOT2.servoj_rt 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.check_force_condition (cyclomatic 23) · ×1
  • DSR_ROBOT2.check_force_condition (cyclomatic 23) dsr_common2/imp/DSR_ROBOT2.py:5517 — DSR_ROBOT2.check_force_condition 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.servol (cyclomatic 20) · ×1
  • DSR_ROBOT2.servol (cyclomatic 20) dsr_common2/imp/DSR_ROBOT2.py:1587 — DSR_ROBOT2.servol has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DR_tcp_client2.client_socket_read (cyclomatic 18) · ×1
  • DR_tcp_client2.client_socket_read (cyclomatic 18) dsr_common2/imp/DR_tcp_client2.py:239 — DR_tcp_client2.client_socket_read has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DR_tcp_server2.server_socket_read (cyclomatic 18) · ×1
  • DR_tcp_server2.server_socket_read (cyclomatic 18) dsr_common2/imp/DR_tcp_server2.py:262 — DR_tcp_server2.server_socket_read has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · DSR_ROBOT2.speedl (cyclomatic 18) · ×1
  • DSR_ROBOT2.speedl (cyclomatic 18) dsr_common2/imp/DSR_ROBOT2.py:1715 — DSR_ROBOT2.speedl has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.enable_alter_motion (cyclomatic 17) · ×1
  • CDsrRobot.enable_alter_motion (cyclomatic 17) dsr_common2/imp/DSR_ROBOT2.py:9061 — CDsrRobot.enable_alter_motion 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 (DSR_ROBOT2.enable_alter_motion) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · CDsrRobot.set_desired_force (cyclomatic 17) · ×1
  • CDsrRobot.set_desired_force (cyclomatic 17) dsr_common2/imp/DSR_ROBOT2.py:10474 — CDsrRobot.set_desired_force 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 (DSR_ROBOT2.set_desired_force) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.enable_alter_motion (cyclomatic 17) · ×1
  • DSR_ROBOT2.enable_alter_motion (cyclomatic 17) dsr_common2/imp/DSR_ROBOT2.py:3927 — DSR_ROBOT2.enable_alter_motion 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 (CDsrRobot.enable_alter_motion) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.set_desired_force (cyclomatic 17) · ×1
  • DSR_ROBOT2.set_desired_force (cyclomatic 17) dsr_common2/imp/DSR_ROBOT2.py:5340 — DSR_ROBOT2.set_desired_force 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 (CDsrRobot.set_desired_force) 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. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D1 · Cyclomatic Complexity · DSR_ROBOT2.servol_rt (cyclomatic 16) · ×1
  • DSR_ROBOT2.servol_rt (cyclomatic 16) dsr_common2/imp/DSR_ROBOT2.py:1847 — DSR_ROBOT2.servol_rt has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This file is where this pass's cyclomatic complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 45 of the 47 methods over the threshold — including the worst — and 1063 of the 1069 points over it (99%), 354.3× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 3). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.set_user_cart_coord (cognitive 144) · ×1
  • CDsrRobot.set_user_cart_coord (cognitive 144) dsr_common2/imp/DSR_ROBOT2.py:10085 — CDsrRobot.set_user_cart_coord has cognitive complexity 144 (threshold 15). Drivers by points: if/else 61 (115 pts), error handling 5 (15 pts), boolean chains 13, loops 1 (nesting depth added 64). To reduce it, split the body into named stages: move each independent 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 (DSR_ROBOT2.set_user_cart_coord) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.set_user_cart_coord (cognitive 144) · ×1
  • DSR_ROBOT2.set_user_cart_coord (cognitive 144) dsr_common2/imp/DSR_ROBOT2.py:4951 — DSR_ROBOT2.set_user_cart_coord has cognitive complexity 144 (threshold 15). Drivers by points: if/else 61 (115 pts), error handling 5 (15 pts), boolean chains 13, loops 1 (nesting depth added 64). To reduce it, split the body into named stages: move each independent 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 (CDsrRobot.set_user_cart_coord) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.align_axis (cognitive 130) · ×1
  • CDsrRobot.align_axis (cognitive 130) dsr_common2/imp/DSR_ROBOT2.py:9537 — CDsrRobot.align_axis has cognitive complexity 130 (threshold 15). Drivers by points: if/else 46 (91 pts), ternaries 4 (17 pts), error handling 4 (13 pts), boolean chains 8, loops 1 (nesting depth added 67). 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2.align_axis) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.align_axis (cognitive 130) · ×1
  • DSR_ROBOT2.align_axis (cognitive 130) dsr_common2/imp/DSR_ROBOT2.py:4403 — DSR_ROBOT2.align_axis has cognitive complexity 130 (threshold 15). Drivers by points: if/else 46 (91 pts), ternaries 4 (17 pts), error handling 4 (13 pts), boolean chains 8, loops 1 (nesting depth added 67). 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. This shape REPEATS in the file: one other method here (CDsrRobot.align_axis) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.parallel_axis (cognitive 125) · ×1
  • CDsrRobot.parallel_axis (cognitive 125) dsr_common2/imp/DSR_ROBOT2.py:9319 — CDsrRobot.parallel_axis has cognitive complexity 125 (threshold 15). Drivers by points: if/else 44 (86 pts), ternaries 4 (17 pts), error handling 4 (13 pts), boolean chains 8, loops 1 (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (DSR_ROBOT2.parallel_axis) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.parallel_axis (cognitive 125) · ×1
  • DSR_ROBOT2.parallel_axis (cognitive 125) dsr_common2/imp/DSR_ROBOT2.py:4185 — DSR_ROBOT2.parallel_axis has cognitive complexity 125 (threshold 15). Drivers by points: if/else 44 (86 pts), ternaries 4 (17 pts), error handling 4 (13 pts), boolean chains 8, loops 1 (nesting depth added 64). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function. This shape REPEATS in the file: one other method here (CDsrRobot.parallel_axis) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.check_orientation_condition (cognitive 97) · ×1
  • CDsrRobot.check_orientation_condition (cognitive 97) dsr_common2/imp/DSR_ROBOT2.py:10725 — CDsrRobot.check_orientation_condition has cognitive complexity 97 (threshold 15). Drivers by points: if/else 43 (74 pts), boolean chains 11, ternaries 2 (7 pts), error handling 2 (5 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2.check_orientation_condition) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.check_orientation_condition (cognitive 97) · ×1
  • DSR_ROBOT2.check_orientation_condition (cognitive 97) dsr_common2/imp/DSR_ROBOT2.py:5591 — DSR_ROBOT2.check_orientation_condition has cognitive complexity 97 (threshold 15). Drivers by points: if/else 43 (74 pts), boolean chains 11, ternaries 2 (7 pts), error handling 2 (5 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. This shape REPEATS in the file: one other method here (CDsrRobot.check_orientation_condition) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._movec (cognitive 64) · ×1
  • DSR_ROBOT2._movec (cognitive 64) dsr_common2/imp/DSR_ROBOT2.py:2997 — DSR_ROBOT2._movec has cognitive complexity 64 (threshold 15). Drivers by points: if/else 36 (41 pts), boolean chains 13, loops 4 (5 pts), ternaries 1 (3 pts), error handling 1 (2 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._movec (cognitive 62) · ×1
  • CDsrRobot._movec (cognitive 62) dsr_common2/imp/DSR_ROBOT2.py:8134 — CDsrRobot._movec has cognitive complexity 62 (threshold 15). Drivers by points: if/else 36 (41 pts), boolean chains 13, loops 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._moveb (cognitive 60) · ×1
  • CDsrRobot._moveb (cognitive 60) dsr_common2/imp/DSR_ROBOT2.py:8587 — CDsrRobot._moveb has cognitive complexity 60 (threshold 15). Drivers by points: if/else 28 (36 pts), loops 6 (11 pts), boolean chains 8, ternaries 1 (3 pts), 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2._moveb) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._moveb (cognitive 60) · ×1
  • DSR_ROBOT2._moveb (cognitive 60) dsr_common2/imp/DSR_ROBOT2.py:3448 — DSR_ROBOT2._moveb has cognitive complexity 60 (threshold 15). Drivers by points: if/else 28 (36 pts), loops 6 (11 pts), boolean chains 8, ternaries 1 (3 pts), 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. This shape REPEATS in the file: one other method here (CDsrRobot._moveb) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._movel (cognitive 55) · ×1
  • DSR_ROBOT2._movel (cognitive 55) dsr_common2/imp/DSR_ROBOT2.py:2831 — DSR_ROBOT2._movel has cognitive complexity 55 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 11, loops 3 (4 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._movejx (cognitive 54) · ×1
  • DSR_ROBOT2._movejx (cognitive 54) dsr_common2/imp/DSR_ROBOT2.py:2676 — DSR_ROBOT2._movejx has cognitive complexity 54 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 10, loops 3 (4 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._movel (cognitive 53) · ×1
  • CDsrRobot._movel (cognitive 53) dsr_common2/imp/DSR_ROBOT2.py:7975 — CDsrRobot._movel has cognitive complexity 53 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 11, ternaries 1 (3 pts), error handling 1 (2 pts), loops 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._movejx (cognitive 52) · ×1
  • CDsrRobot._movejx (cognitive 52) dsr_common2/imp/DSR_ROBOT2.py:7824 — CDsrRobot._movejx has cognitive complexity 52 (threshold 15). Drivers by points: if/else 31 (35 pts), boolean chains 10, ternaries 1 (3 pts), error handling 1 (2 pts), loops 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._movesx (cognitive 48) · ×1
  • CDsrRobot._movesx (cognitive 48) dsr_common2/imp/DSR_ROBOT2.py:8445 — CDsrRobot._movesx has cognitive complexity 48 (threshold 15). Drivers by points: if/else 26 (30 pts), boolean chains 10, loops 3, ternaries 1 (3 pts), error handling 1 (2 pts) (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. This shape REPEATS in the file: one other method here (DSR_ROBOT2._movesx) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._movesx (cognitive 48) · ×1
  • DSR_ROBOT2._movesx (cognitive 48) dsr_common2/imp/DSR_ROBOT2.py:3306 — DSR_ROBOT2._movesx has cognitive complexity 48 (threshold 15). Drivers by points: if/else 26 (30 pts), boolean chains 10, loops 3, ternaries 1 (3 pts), error handling 1 (2 pts) (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. This shape REPEATS in the file: one other method here (CDsrRobot._movesx) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._move_spiral (cognitive 48) · ×1
  • DSR_ROBOT2._move_spiral (cognitive 48) dsr_common2/imp/DSR_ROBOT2.py:3602 — DSR_ROBOT2._move_spiral has cognitive complexity 48 (threshold 15). Drivers by points: if/else 25 (28 pts), boolean chains 11, loops 3 (4 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._move_spiral (cognitive 46) · ×1
  • CDsrRobot._move_spiral (cognitive 46) dsr_common2/imp/DSR_ROBOT2.py:8741 — CDsrRobot._move_spiral has cognitive complexity 46 (threshold 15). Drivers by points: if/else 25 (28 pts), boolean chains 11, ternaries 1 (3 pts), error handling 1 (2 pts), loops 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._movej (cognitive 46) · ×1
  • DSR_ROBOT2._movej (cognitive 46) dsr_common2/imp/DSR_ROBOT2.py:2543 — DSR_ROBOT2._movej has cognitive complexity 46 (threshold 15). Drivers by points: if/else 25 (29 pts), boolean chains 8, loops 3 (4 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._movej (cognitive 44) · ×1
  • CDsrRobot._movej (cognitive 44) dsr_common2/imp/DSR_ROBOT2.py:7696 — CDsrRobot._movej has cognitive complexity 44 (threshold 15). Drivers by points: if/else 25 (29 pts), boolean chains 8, ternaries 1 (3 pts), error handling 1 (2 pts), loops 2 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._move_periodic (cognitive 43) · ×1
  • DSR_ROBOT2._move_periodic (cognitive 43) dsr_common2/imp/DSR_ROBOT2.py:3734 — DSR_ROBOT2._move_periodic has cognitive complexity 43 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 5, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._movesj (cognitive 42) · ×1
  • CDsrRobot._movesj (cognitive 42) dsr_common2/imp/DSR_ROBOT2.py:8323 — CDsrRobot._movesj has cognitive complexity 42 (threshold 15). Drivers by points: if/else 22 (28 pts), boolean chains 6, loops 3, ternaries 1 (3 pts), error handling 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot._move_periodic (cognitive 41) · ×1
  • CDsrRobot._move_periodic (cognitive 41) dsr_common2/imp/DSR_ROBOT2.py:8870 — CDsrRobot._move_periodic has cognitive complexity 41 (threshold 15). Drivers by points: if/else 23 (31 pts), boolean chains 5, ternaries 1 (3 pts), error handling 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.calc_coord (cognitive 40) · ×1
  • CDsrRobot.calc_coord (cognitive 40) dsr_common2/imp/DSR_ROBOT2.py:9928 — CDsrRobot.calc_coord has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 15, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (DSR_ROBOT2.calc_coord) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.calc_coord (cognitive 40) · ×1
  • DSR_ROBOT2.calc_coord (cognitive 40) dsr_common2/imp/DSR_ROBOT2.py:4794 — DSR_ROBOT2.calc_coord has cognitive complexity 40 (threshold 15). Drivers by points: if/else 18 (22 pts), boolean chains 15, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (CDsrRobot.calc_coord) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.set_analog_output (cognitive 38) · ×1
  • CDsrRobot.set_analog_output (cognitive 38) dsr_common2/imp/DSR_ROBOT2.py:11089 — CDsrRobot.set_analog_output has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 6, ternaries 1 (3 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2.set_analog_output) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2._movesj (cognitive 38) · ×1
  • DSR_ROBOT2._movesj (cognitive 38) dsr_common2/imp/DSR_ROBOT2.py:3190 — DSR_ROBOT2._movesj has cognitive complexity 38 (threshold 15). Drivers by points: if/else 20 (24 pts), boolean chains 6, loops 3, ternaries 1 (3 pts), error handling 1 (2 pts) (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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.set_analog_output (cognitive 38) · ×1
  • DSR_ROBOT2.set_analog_output (cognitive 38) dsr_common2/imp/DSR_ROBOT2.py:5956 — DSR_ROBOT2.set_analog_output has cognitive complexity 38 (threshold 15). Drivers by points: if/else 16 (27 pts), boolean chains 6, ternaries 1 (3 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. This shape REPEATS in the file: one other method here (CDsrRobot.set_analog_output) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.check_position_condition (cognitive 37) · ×1
  • CDsrRobot.check_position_condition (cognitive 37) dsr_common2/imp/DSR_ROBOT2.py:10565 — CDsrRobot.check_position_condition has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 8, ternaries 1 (3 pts), error handling 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2.check_position_condition) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.check_position_condition (cognitive 37) · ×1
  • DSR_ROBOT2.check_position_condition (cognitive 37) dsr_common2/imp/DSR_ROBOT2.py:5431 — DSR_ROBOT2.check_position_condition has cognitive complexity 37 (threshold 15). Drivers by points: if/else 21 (24 pts), boolean chains 8, ternaries 1 (3 pts), error handling 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. This shape REPEATS in the file: one other method here (CDsrRobot.check_position_condition) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.check_force_condition (cognitive 35) · ×1
  • CDsrRobot.check_force_condition (cognitive 35) dsr_common2/imp/DSR_ROBOT2.py:10651 — CDsrRobot.check_force_condition has cognitive complexity 35 (threshold 15). Drivers by points: if/else 19 (23 pts), boolean chains 7, ternaries 1 (3 pts), error handling 1 (2 pts) (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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DR_tcp_client2.client_socket_read (cognitive 34) · ×1
  • DR_tcp_client2.client_socket_read (cognitive 34) dsr_common2/imp/DR_tcp_client2.py:239 — DR_tcp_client2.client_socket_read has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (26 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · DR_tcp_server2.server_socket_read (cognitive 34) · ×1
  • DR_tcp_server2.server_socket_read (cognitive 34) dsr_common2/imp/DR_tcp_server2.py:262 — DR_tcp_server2.server_socket_read has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (26 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CDsrRobot.add_modbus_signal (cognitive 30) · ×1
  • CDsrRobot.add_modbus_signal (cognitive 30) dsr_common2/imp/DSR_ROBOT2.py:11292 — CDsrRobot.add_modbus_signal has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 7, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (DSR_ROBOT2.add_modbus_signal) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.add_modbus_signal (cognitive 30) · ×1
  • DSR_ROBOT2.add_modbus_signal (cognitive 30) dsr_common2/imp/DSR_ROBOT2.py:6159 — DSR_ROBOT2.add_modbus_signal has cognitive complexity 30 (threshold 15). Drivers by points: if/else 17 (18 pts), boolean chains 7, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (CDsrRobot.add_modbus_signal) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.check_force_condition (cognitive 29) · ×1
  • DSR_ROBOT2.check_force_condition (cognitive 29) dsr_common2/imp/DSR_ROBOT2.py:5517 — DSR_ROBOT2.check_force_condition has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 7, ternaries 1 (3 pts), error handling 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.servoj (cognitive 26) · ×1
  • DSR_ROBOT2.servoj (cognitive 26) dsr_common2/imp/DSR_ROBOT2.py:1509 — DSR_ROBOT2.servoj has cognitive complexity 26 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 7, 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.enable_alter_motion (cognitive 24) · ×1
  • CDsrRobot.enable_alter_motion (cognitive 24) dsr_common2/imp/DSR_ROBOT2.py:9061 — CDsrRobot.enable_alter_motion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (DSR_ROBOT2.enable_alter_motion) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.enable_alter_motion (cognitive 24) · ×1
  • DSR_ROBOT2.enable_alter_motion (cognitive 24) dsr_common2/imp/DSR_ROBOT2.py:3927 — DSR_ROBOT2.enable_alter_motion has cognitive complexity 24 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (CDsrRobot.enable_alter_motion) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.set_desired_force (cognitive 22) · ×1
  • CDsrRobot.set_desired_force (cognitive 22) dsr_common2/imp/DSR_ROBOT2.py:10474 — CDsrRobot.set_desired_force has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (DSR_ROBOT2.set_desired_force) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.servoj_rt (cognitive 22) · ×1
  • DSR_ROBOT2.servoj_rt (cognitive 22) dsr_common2/imp/DSR_ROBOT2.py:1779 — DSR_ROBOT2.servoj_rt has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.set_desired_force (cognitive 22) · ×1
  • DSR_ROBOT2.set_desired_force (cognitive 22) dsr_common2/imp/DSR_ROBOT2.py:5340 — DSR_ROBOT2.set_desired_force has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (CDsrRobot.set_desired_force) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · launch.prepare_mjcf_files_for_mujoco (cognitive 22) · ×1
  • launch.prepare_mjcf_files_for_mujoco (cognitive 22) dsr_mujoco/launch/dsr_mujoco.launch.py:35 — launch.prepare_mjcf_files_for_mujoco has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (20 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CDsrRobot.set_digital_output (cognitive 21) · ×1
  • CDsrRobot.set_digital_output (cognitive 21) dsr_common2/imp/DSR_ROBOT2.py:11018 — CDsrRobot.set_digital_output has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (3 pts), error handling 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. This shape REPEATS in the file: 3 other methods here (DSR_ROBOT2.set_digital_output, DSR_ROBOT2.set_tool_digital_output, CDsrRobot.set_tool_digital_output) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.set_tool_digital_output (cognitive 21) · ×1
  • CDsrRobot.set_tool_digital_output (cognitive 21) dsr_common2/imp/DSR_ROBOT2.py:11218 — CDsrRobot.set_tool_digital_output has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (3 pts), error handling 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. This shape REPEATS in the file: 3 other methods here (DSR_ROBOT2.set_digital_output, DSR_ROBOT2.set_tool_digital_output, CDsrRobot.set_digital_output) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.set_digital_output (cognitive 21) · ×1
  • DSR_ROBOT2.set_digital_output (cognitive 21) dsr_common2/imp/DSR_ROBOT2.py:5885 — DSR_ROBOT2.set_digital_output has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (3 pts), error handling 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. This shape REPEATS in the file: 3 other methods here (DSR_ROBOT2.set_tool_digital_output, CDsrRobot.set_digital_output, CDsrRobot.set_tool_digital_output) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.set_tool_digital_output (cognitive 21) · ×1
  • DSR_ROBOT2.set_tool_digital_output (cognitive 21) dsr_common2/imp/DSR_ROBOT2.py:6085 — DSR_ROBOT2.set_tool_digital_output has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 1 (3 pts), error handling 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. This shape REPEATS in the file: 3 other methods here (DSR_ROBOT2.set_digital_output, CDsrRobot.set_digital_output, CDsrRobot.set_tool_digital_output) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.servol (cognitive 19) · ×1
  • DSR_ROBOT2.servol (cognitive 19) dsr_common2/imp/DSR_ROBOT2.py:1587 — DSR_ROBOT2.servol has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (14 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.speedl_rt (cognitive 19) · ×1
  • DSR_ROBOT2.speedl_rt (cognitive 19) dsr_common2/imp/DSR_ROBOT2.py:1941 — DSR_ROBOT2.speedl_rt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (16 pts), loops 1 (2 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.write_data_rt (cognitive 19) · ×1
  • DSR_ROBOT2.write_data_rt (cognitive 19) dsr_common2/imp/DSR_ROBOT2.py:2498 — DSR_ROBOT2.write_data_rt has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.task_compliance_ctrl (cognitive 18) · ×1
  • CDsrRobot.task_compliance_ctrl (cognitive 18) dsr_common2/imp/DSR_ROBOT2.py:9841 — CDsrRobot.task_compliance_ctrl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 3 other methods here (DSR_ROBOT2.task_compliance_ctrl, DSR_ROBOT2.set_stiffnessx, CDsrRobot.set_stiffnessx) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.set_stiffnessx (cognitive 18) · ×1
  • CDsrRobot.set_stiffnessx (cognitive 18) dsr_common2/imp/DSR_ROBOT2.py:9885 — CDsrRobot.set_stiffnessx has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 3 other methods here (DSR_ROBOT2.task_compliance_ctrl, DSR_ROBOT2.set_stiffnessx, CDsrRobot.task_compliance_ctrl) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.speedl (cognitive 18) · ×1
  • DSR_ROBOT2.speedl (cognitive 18) dsr_common2/imp/DSR_ROBOT2.py:1715 — DSR_ROBOT2.speedl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (14 pts), boolean chains 3, 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.connect_rt_control (cognitive 18) · ×1
  • DSR_ROBOT2.connect_rt_control (cognitive 18) dsr_common2/imp/DSR_ROBOT2.py:2056 — DSR_ROBOT2.connect_rt_control has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (8 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.task_compliance_ctrl (cognitive 18) · ×1
  • DSR_ROBOT2.task_compliance_ctrl (cognitive 18) dsr_common2/imp/DSR_ROBOT2.py:4707 — DSR_ROBOT2.task_compliance_ctrl has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 3 other methods here (DSR_ROBOT2.set_stiffnessx, CDsrRobot.task_compliance_ctrl, CDsrRobot.set_stiffnessx) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.set_stiffnessx (cognitive 18) · ×1
  • DSR_ROBOT2.set_stiffnessx (cognitive 18) dsr_common2/imp/DSR_ROBOT2.py:4751 — DSR_ROBOT2.set_stiffnessx has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: 3 other methods here (DSR_ROBOT2.task_compliance_ctrl, CDsrRobot.task_compliance_ctrl, CDsrRobot.set_stiffnessx) have the same decision points, in the same order, at the same nesting depths — so this is one pattern written 4 times rather than 4 independent problems. Splitting this body alone leaves the other 3 exactly as they are. Where these are variations on one operation, the change that clears all 4 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.set_mode_analog_output (cognitive 17) · ×1
  • CDsrRobot.set_mode_analog_output (cognitive 17) dsr_common2/imp/DSR_ROBOT2.py:11143 — CDsrRobot.set_mode_analog_output has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (DSR_ROBOT2.set_mode_analog_output) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.set_mode_analog_output (cognitive 17) · ×1
  • DSR_ROBOT2.set_mode_analog_output (cognitive 17) dsr_common2/imp/DSR_ROBOT2.py:6010 — DSR_ROBOT2.set_mode_analog_output has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 1 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (CDsrRobot.set_mode_analog_output) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · posj.__init__ (cognitive 16) · ×1
  • posj.__init__ (cognitive 16) dsr_common2/imp/DR_common2.py:50 — posj.__init__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · CDsrRobot.trans (cognitive 16) · ×1
  • CDsrRobot.trans (cognitive 16) dsr_common2/imp/DSR_ROBOT2.py:7543 — CDsrRobot.trans has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (DSR_ROBOT2.trans) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · CDsrRobot.is_done_bolt_tightening (cognitive 16) · ×1
  • CDsrRobot.is_done_bolt_tightening (cognitive 16) dsr_common2/imp/DSR_ROBOT2.py:9785 — CDsrRobot.is_done_bolt_tightening has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 3, ternaries 1 (3 pts), error handling 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. This shape REPEATS in the file: one other method here (DSR_ROBOT2.is_done_bolt_tightening) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.trans (cognitive 16) · ×1
  • DSR_ROBOT2.trans (cognitive 16) dsr_common2/imp/DSR_ROBOT2.py:1349 — DSR_ROBOT2.trans has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (CDsrRobot.trans) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · DSR_ROBOT2.is_done_bolt_tightening (cognitive 16) · ×1
  • DSR_ROBOT2.is_done_bolt_tightening (cognitive 16) dsr_common2/imp/DSR_ROBOT2.py:4651 — DSR_ROBOT2.is_done_bolt_tightening has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 3, ternaries 1 (3 pts), error handling 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. This shape REPEATS in the file: one other method here (CDsrRobot.is_done_bolt_tightening) 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. This file is where this pass's cognitive complexity CONCENTRATES: dsr_common2/imp/DSR_ROBOT2.py holds 61 of the 66 methods over the threshold — including the worst — and 1822 of the 1869 points over it (97%), 95.9× the next-largest file (dsr_common2/imp/DR_tcp_client2.py at 19). No single row can show this, because each is measured only against the threshold: reducing this one file moves this dimension further than any other file in the repository.
D2 · Cognitive Complexity · dsr_build_scene.build_scene (cognitive 16) · ×1
  • dsr_build_scene.build_scene (cognitive 16) REDACTED:6 — dsr_build_scene.build_scene has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D3 · God Classes · TooManyMethods · ×1
  • TooManyMethods: CDsrRobot dsr_common2/imp/DSR_ROBOT2.py:6659 — TooManyMethods — 121 methods. The bar is 30 methods; this is 91 over it, 4.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.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Near-duplicate member family (16 members, 34 shared lines) · ×1
  • Near-duplicate member family (16 members, 34 shared lines) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:38 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:38-85 | dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:39-124 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:39-144 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:39-124 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:39-144 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:39-124 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:39-144 — These 16 members are variants of one another: a block of 34 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 16 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 16 times.
D4 · Code Duplication · Near-duplicate member family (10 members, 87 shared lines) · ×1
  • Near-duplicate member family (10 members, 87 shared lines) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:88 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:88-175 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:88-175 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:88-175 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:88-175 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:88-177 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:88-175 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:88-175 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:88-175 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:88-175 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:88-175 — These 10 members are variants of one another: a block of 87 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 10 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 10 times.
D4 · Code Duplication · Near-duplicate member family (10 members, 32 shared lines) · ×1
  • Near-duplicate member family (10 members, 32 shared lines) dsr_common2/imp/DSR_ROBOT2.py:1511 — dsr_common2/imp/DSR_ROBOT2.py:1511-1585 | dsr_common2/imp/DSR_ROBOT2.py:1781-1845 | dsr_common2/imp/DSR_ROBOT2.py:2545-2667 | dsr_common2/imp/DSR_ROBOT2.py:2678-2823 | dsr_common2/imp/DSR_ROBOT2.py:3192-3296 | dsr_common2/imp/DSR_ROBOT2.py:3604-3726 | dsr_common2/imp/DSR_ROBOT2.py:7698-7816 | dsr_common2/imp/DSR_ROBOT2.py:7826-7966 | dsr_common2/imp/DSR_ROBOT2.py:8325-8435 | dsr_common2/imp/DSR_ROBOT2.py:8743-8862 — These 10 members are variants of one another: a block of 32 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 10 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 10 times.
D4 · Code Duplication · Near-duplicate member family (6 members, 63 shared lines) · ×1
  • Near-duplicate member family (6 members, 63 shared lines) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:127 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:127-212 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:147-231 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:127-212 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:147-231 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:127-212 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:147-231 — These 6 members are variants of one another: a block of 63 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.
D4 · Code Duplication · Near-duplicate member family (6 members, 18 shared lines) · ×1
  • Near-duplicate member family (6 members, 18 shared lines) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:259 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:259-303 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:286-329 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:259-303 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:286-329 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:259-303 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:286-329 — These 6 members are variants of one another: a block of 18 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.
D4 · Code Duplication · Near-duplicate member family (4 members, 75 shared lines) · ×1
  • Near-duplicate member family (4 members, 75 shared lines) dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:33 — dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:33-308 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:35-335 | dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:37-626 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:23-417 — These 4 members are variants of one another: a block of 75 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 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Near-duplicate member family (3 members, 280 shared lines) · ×1
  • Near-duplicate member family (3 members, 280 shared lines) dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:332 — dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:332-779 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:332-779 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:332-779 — These 3 members are variants of one another: a block of 280 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
D4 · Code Duplication · Near-duplicate member family (3 members, 278 shared lines) · ×1
  • Near-duplicate member family (3 members, 278 shared lines) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:306 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:306-621 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:306-621 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:306-621 — These 3 members are variants of one another: a block of 278 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
D4 · Code Duplication · Near-duplicate member family (3 members, 89 shared lines) · ×1
  • Near-duplicate member family (3 members, 89 shared lines) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:44 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:44-251 | dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:43-254 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:47-254 — These 3 members are variants of one another: a block of 89 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 3 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 3 times.
D4 · Code Duplication · Edited copy of a member (172 corresponding lines) · ×1
  • Edited copy of a member (172 corresponding lines) dsr_bringup2/launch/dsr_mobile_manipulator_dual_moveit.launch.py:16 — dsr_bringup2/launch/dsr_mobile_manipulator_dual_moveit.launch.py:16-198 | dsr_bringup2/launch/dsr_mobile_manipulator_moveit.launch.py:16-187 — These two members are one piece of code written twice and then edited apart: 172 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport 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 (115 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (115 members, 50+ identical tokens) dsr_common2/imp/DSR_ROBOT2.py:622 — dsr_common2/imp/DSR_ROBOT2.py:622-647 | dsr_common2/imp/DSR_ROBOT2.py:733-753 | dsr_common2/imp/DSR_ROBOT2.py:775-795 | dsr_common2/imp/DSR_ROBOT2.py:859-881 | dsr_common2/imp/DSR_ROBOT2.py:1464-1494 | dsr_common2/imp/DSR_ROBOT2.py:2026-2054 | dsr_common2/imp/DSR_ROBOT2.py:2545-2667 | dsr_common2/imp/DSR_ROBOT2.py:2678-2823 | dsr_common2/imp/DSR_ROBOT2.py:2833-2987 | dsr_common2/imp/DSR_ROBOT2.py:3001-3181 | dsr_common2/imp/DSR_ROBOT2.py:3192-3296 | dsr_common2/imp/DSR_ROBOT2.py:3308-3440 | dsr_common2/imp/DSR_ROBOT2.py:3451-3593 | dsr_common2/imp/DSR_ROBOT2.py:3604-3726 | dsr_common2/imp/DSR_ROBOT2.py:3735-3827 | dsr_common2/imp/DSR_ROBOT2.py:3832-3853 | dsr_common2/imp/DSR_ROBOT2.py:3859-3881 | dsr_common2/imp/DSR_ROBOT2.py:3903-3925 | dsr_common2/imp/DSR_ROBOT2.py:3929-3983 | dsr_common2/imp/DSR_ROBOT2.py:3988-4009 | dsr_common2/imp/DSR_ROBOT2.py:4013-4028 | dsr_common2/imp/DSR_ROBOT2.py:4031-4053 | dsr_common2/imp/DSR_ROBOT2.py:4083-4110 | dsr_common2/imp/DSR_ROBOT2.py:4113-4139 | dsr_common2/imp/DSR_ROBOT2.py:4168-4183 | dsr_common2/imp/DSR_ROBOT2.py:4186-4401 | dsr_common2/imp/DSR_ROBOT2.py:4404-4649 | dsr_common2/imp/DSR_ROBOT2.py:4653-4685 | dsr_common2/imp/DSR_ROBOT2.py:4689-4705 | dsr_common2/imp/DSR_ROBOT2.py:4709-4748 | dsr_common2/imp/DSR_ROBOT2.py:4753-4792 | dsr_common2/imp/DSR_ROBOT2.py:4811-4949 | dsr_common2/imp/DSR_ROBOT2.py:4952-5266 | dsr_common2/imp/DSR_ROBOT2.py:5271-5313 | dsr_common2/imp/DSR_ROBOT2.py:5342-5395 | dsr_common2/imp/DSR_ROBOT2.py:5399-5427 | dsr_common2/imp/DSR_ROBOT2.py:5433-5513 | dsr_common2/imp/DSR_ROBOT2.py:5519-5588 | dsr_common2/imp/DSR_ROBOT2.py:5592-5765 | dsr_common2/imp/DSR_ROBOT2.py:5886-5927 | dsr_common2/imp/DSR_ROBOT2.py:5957-6008 | dsr_common2/imp/DSR_ROBOT2.py:6011-6049 | dsr_common2/imp/DSR_ROBOT2.py:6052-6082 | dsr_common2/imp/DSR_ROBOT2.py:6086-6127 | dsr_common2/imp/DSR_ROBOT2.py:6161-6239 | dsr_common2/imp/DSR_ROBOT2.py:6243-6264 | dsr_common2/imp/DSR_ROBOT2.py:6268-6296 | dsr_common2/imp/DSR_ROBOT2.py:6326-6351 | dsr_common2/imp/DSR_ROBOT2.py:6375-6400 | dsr_common2/imp/DSR_ROBOT2.py:6425-6445 | dsr_common2/imp/DSR_ROBOT2.py:6448-6470 | dsr_common2/imp/DSR_ROBOT2.py:6473-6494 | dsr_common2/imp/DSR_ROBOT2.py:6497-6521 | dsr_common2/imp/DSR_ROBOT2.py:6524-6545 | dsr_common2/imp/DSR_ROBOT2.py:6550-6571 | dsr_common2/imp/DSR_ROBOT2.py:6575-6595 | dsr_common2/imp/DSR_ROBOT2.py:6599-6614 | dsr_common2/imp/DSR_ROBOT2.py:6618-6633 | dsr_common2/imp/DSR_ROBOT2.py:6827-6850 | dsr_common2/imp/DSR_ROBOT2.py:6936-6956 | dsr_common2/imp/DSR_ROBOT2.py:6978-6998 | dsr_common2/imp/DSR_ROBOT2.py:7062-7084 | dsr_common2/imp/DSR_ROBOT2.py:7658-7688 | dsr_common2/imp/DSR_ROBOT2.py:7698-7816 | dsr_common2/imp/DSR_ROBOT2.py:7826-7966 | dsr_common2/imp/DSR_ROBOT2.py:7977-8126 | dsr_common2/imp/DSR_ROBOT2.py:8138-8314 | dsr_common2/imp/DSR_ROBOT2.py:8325-8435 | dsr_common2/imp/DSR_ROBOT2.py:8447-8579 | dsr_common2/imp/DSR_ROBOT2.py:8590-8732 | dsr_common2/imp/DSR_ROBOT2.py:8743-8862 | dsr_common2/imp/DSR_ROBOT2.py:8871-8960 | dsr_common2/imp/DSR_ROBOT2.py:8965-8986 | dsr_common2/imp/DSR_ROBOT2.py:8993-9015 | dsr_common2/imp/DSR_ROBOT2.py:9037-9059 | dsr_common2/imp/DSR_ROBOT2.py:9063-9117 | dsr_common2/imp/DSR_ROBOT2.py:9122-9143 | dsr_common2/imp/DSR_ROBOT2.py:9147-9162 | dsr_common2/imp/DSR_ROBOT2.py:9165-9187 | dsr_common2/imp/DSR_ROBOT2.py:9217-9244 | dsr_common2/imp/DSR_ROBOT2.py:9247-9274 | dsr_common2/imp/DSR_ROBOT2.py:9302-9317 | dsr_common2/imp/DSR_ROBOT2.py:9320-9535 | dsr_common2/imp/DSR_ROBOT2.py:9538-9783 | dsr_common2/imp/DSR_ROBOT2.py:9787-9819 | dsr_common2/imp/DSR_ROBOT2.py:9823-9839 | dsr_common2/imp/DSR_ROBOT2.py:9843-9882 | dsr_common2/imp/DSR_ROBOT2.py:9887-9926 | dsr_common2/imp/DSR_ROBOT2.py:9945-10083 | dsr_common2/imp/DSR_ROBOT2.py:10086-10400 | dsr_common2/imp/DSR_ROBOT2.py:10405-10447 | dsr_common2/imp/DSR_ROBOT2.py:10476-10529 | dsr_common2/imp/DSR_ROBOT2.py:10533-10561 | dsr_common2/imp/DSR_ROBOT2.py:10567-10647 | dsr_common2/imp/DSR_ROBOT2.py:10653-10722 | dsr_common2/imp/DSR_ROBOT2.py:10726-10899 | dsr_common2/imp/DSR_ROBOT2.py:11019-11060 | dsr_common2/imp/DSR_ROBOT2.py:11090-11141 | dsr_common2/imp/DSR_ROBOT2.py:11144-11182 | dsr_common2/imp/DSR_ROBOT2.py:11185-11215 | dsr_common2/imp/DSR_ROBOT2.py:11219-11260 | dsr_common2/imp/DSR_ROBOT2.py:11294-11372 | dsr_common2/imp/DSR_ROBOT2.py:11376-11397 | dsr_common2/imp/DSR_ROBOT2.py:11401-11430 | dsr_common2/imp/DSR_ROBOT2.py:11459-11484 | dsr_common2/imp/DSR_ROBOT2.py:11508-11533 | dsr_common2/imp/DSR_ROBOT2.py:11558-11578 | dsr_common2/imp/DSR_ROBOT2.py:11581-11603 | dsr_common2/imp/DSR_ROBOT2.py:11606-11627 | dsr_common2/imp/DSR_ROBOT2.py:11630-11654 | dsr_common2/imp/DSR_ROBOT2.py:11657-11678 | dsr_common2/imp/DSR_ROBOT2.py:11683-11704 | dsr_common2/imp/DSR_ROBOT2.py:11708-11728 | dsr_common2/imp/DSR_ROBOT2.py:11732-11747 | dsr_common2/imp/DSR_ROBOT2.py:11751-11766 — These 115 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 115 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 115 times.
D4 · Code Duplication · Members sharing a duplicated core (18 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (18 members, 50+ identical tokens) dsr_common2/imp/DSR_ROBOT2.py:971 — dsr_common2/imp/DSR_ROBOT2.py:971-987 | dsr_common2/imp/DSR_ROBOT2.py:990-1005 | dsr_common2/imp/DSR_ROBOT2.py:1108-1138 | dsr_common2/imp/DSR_ROBOT2.py:1142-1165 | dsr_common2/imp/DSR_ROBOT2.py:1215-1230 | dsr_common2/imp/DSR_ROBOT2.py:1233-1248 | dsr_common2/imp/DSR_ROBOT2.py:4811-4949 | dsr_common2/imp/DSR_ROBOT2.py:5770-5800 | dsr_common2/imp/DSR_ROBOT2.py:7143-7159 | dsr_common2/imp/DSR_ROBOT2.py:7162-7178 | dsr_common2/imp/DSR_ROBOT2.py:7181-7196 | dsr_common2/imp/DSR_ROBOT2.py:7300-7330 | dsr_common2/imp/DSR_ROBOT2.py:7334-7357 | dsr_common2/imp/DSR_ROBOT2.py:7407-7422 | dsr_common2/imp/DSR_ROBOT2.py:7425-7440 | dsr_common2/imp/DSR_ROBOT2.py:7445-7468 | dsr_common2/imp/DSR_ROBOT2.py:9945-10083 | dsr_common2/imp/DSR_ROBOT2.py:10904-10934 — These 18 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 18 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 18 times.
D4 · Code Duplication · Members sharing a duplicated core (16 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (16 members, 50+ identical tokens) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:179 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:181-196 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:179-194 | dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:216-241 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:235-267 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:216-241 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:235-267 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:216-241 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:235-267 — These 16 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 16 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 16 times.
D4 · Code Duplication · Members sharing a duplicated core (9 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (9 members, 50+ identical tokens) dsr_common2/imp/DSR_ROBOT2.py:2252 — dsr_common2/imp/DSR_ROBOT2.py:2252-2272 | dsr_common2/imp/DSR_ROBOT2.py:2275-2295 | dsr_common2/imp/DSR_ROBOT2.py:2298-2328 | dsr_common2/imp/DSR_ROBOT2.py:2331-2361 | dsr_common2/imp/DSR_ROBOT2.py:2364-2390 | dsr_common2/imp/DSR_ROBOT2.py:2393-2419 | dsr_common2/imp/DSR_ROBOT2.py:2422-2446 | dsr_common2/imp/DSR_ROBOT2.py:2449-2473 | dsr_common2/imp/DSR_ROBOT2.py:2499-2535 — These 9 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 9 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 9 times.
D4 · Code Duplication · Members sharing a duplicated core (8 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (8 members, 50+ identical tokens) dsr_moveit2/dsr_moveit_config_a0509/launch/demo.launch.py:35 — dsr_moveit2/dsr_moveit_config_a0509/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_a0912/launch/demo.launch.py:34-206 | dsr_moveit2/dsr_moveit_config_e0509/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_h2017/launch/demo.launch.py:34-206 | dsr_moveit2/dsr_moveit_config_h2515/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_m0609/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_m0617/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_m1509/launch/demo.launch.py:35-207 — 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.
D4 · Code Duplication · Edited copies of one member (3 members, 128+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 128+ corresponding lines) dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:52 — dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:52-179 | dsr_gazebo2/launch/dsr_gazebo.launch.py:54-221 | dsr_gazebo2/launch/dsr_spawn_on_gazebo.launch.py:54-223 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 128 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (184 corresponding lines) · ×1
  • Edited copy of a member (184 corresponding lines) dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:24 — dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:24-215 | dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:45-228 — These two members are one piece of code written twice and then edited apart: 184 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport 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 (74 corresponding lines) · ×1
  • Edited copy of a member (74 corresponding lines) dsr_common2/imp/DR_tcp_client2.py:240 — dsr_common2/imp/DR_tcp_client2.py:240-313 | dsr_common2/imp/DR_tcp_server2.py:263-336 — These two members are one piece of code written twice and then edited apart: 74 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport 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 (121 corresponding lines) · ×1
  • Edited copy of a member (121 corresponding lines) dsr_mujoco/launch/dsr_mujoco.launch.py:135 — dsr_mujoco/launch/dsr_mujoco.launch.py:135-268 | dsr_mujoco/launch/dsr_mujoco_default.launch.py:26-146 — These two members are one piece of code written twice and then edited apart: 121 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport 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 (30 corresponding lines) · ×1
  • Edited copy of a member (30 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:1300 — dsr_common2/imp/DSR_ROBOT2.py:1300-1329 | dsr_common2/imp/DSR_ROBOT2.py:7493-7522 — These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (45 corresponding lines) · ×1
  • Edited copy of a member (45 corresponding lines) dsr_common2/imp/DR_tcp_client2.py:50 — dsr_common2/imp/DR_tcp_client2.py:50-94 | dsr_common2/imp/DR_tcp_server2.py:52-101 — These two members are one piece of code written twice and then edited apart: 45 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 29+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 29+ corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:1392 — dsr_common2/imp/DSR_ROBOT2.py:1392-1420 | dsr_common2/imp/DSR_ROBOT2.py:1424-1460 | dsr_common2/imp/DSR_ROBOT2.py:7586-7614 | dsr_common2/imp/DSR_ROBOT2.py:7618-7654 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 29 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (26 corresponding lines) · ×1
  • Edited copy of a member (26 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:5806 — dsr_common2/imp/DSR_ROBOT2.py:5806-5831 | dsr_common2/imp/DSR_ROBOT2.py:10939-10964 — These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (4 members, 21+ corresponding lines) · ×1
  • Edited copies of one member (4 members, 21+ corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:2152 — dsr_common2/imp/DSR_ROBOT2.py:2152-2172 | dsr_common2/imp/DSR_ROBOT2.py:2175-2195 | dsr_common2/imp/DSR_ROBOT2.py:2198-2222 | dsr_common2/imp/DSR_ROBOT2.py:2225-2249 — These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 21 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (23 corresponding lines) · ×1
  • Edited copy of a member (23 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:921 — dsr_common2/imp/DSR_ROBOT2.py:921-943 | dsr_common2/imp/DSR_ROBOT2.py:946-968 — These two members are one piece of code written twice and then edited apart: 23 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (15 corresponding lines) · ×1
  • Edited copy of a member (15 corresponding lines) dsr_common2/imp/DSR_ROBOT2.py:1332 — dsr_common2/imp/DSR_ROBOT2.py:1332-1346 | dsr_common2/imp/DSR_ROBOT2.py:7525-7539 — These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×1
  • Edited copy of a member (11 corresponding lines) dsr_common2/imp/DR_tcp_client2.py:173 — dsr_common2/imp/DR_tcp_client2.py:173-183 | dsr_common2/imp/DR_tcp_server2.py:198-208 — 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 · Duplicated block (174–177 lines × 6) · ×1
  • Duplicated block (174–177 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:377 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:377-550 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:462-638 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:377-550 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:462-638 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:377-550 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:462-638 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:462` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (173 lines × 8) · ×1
  • Duplicated block (173 lines × 8) dsr_moveit2/dsr_moveit_config_a0509/launch/demo.launch.py:35 — dsr_moveit2/dsr_moveit_config_a0509/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_a0912/launch/demo.launch.py:34-206 | dsr_moveit2/dsr_moveit_config_e0509/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_h2017/launch/demo.launch.py:34-206 | dsr_moveit2/dsr_moveit_config_h2515/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_m0609/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_m0617/launch/demo.launch.py:35-207 | dsr_moveit2/dsr_moveit_config_m1509/launch/demo.launch.py:35-207 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/demo.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/demo.launch.py` as WHOLE FILES: 95% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (153 lines × 10) · ×1
  • Duplicated block (153 lines × 10) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:212 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:214-366 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:212-364 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:212-364 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (148 lines × 2) · ×1
  • Duplicated block (148 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4404 — dsr_common2/imp/DSR_ROBOT2.py:4404-4551 | dsr_common2/imp/DSR_ROBOT2.py:9538-9685 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (189 lines × 2) · ×1
  • Duplicated block (189 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4952 — dsr_common2/imp/DSR_ROBOT2.py:4952-5140 | dsr_common2/imp/DSR_ROBOT2.py:10086-10274 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (119 lines × 2) · ×1
  • Duplicated block (119 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4193 — dsr_common2/imp/DSR_ROBOT2.py:4193-4311 | dsr_common2/imp/DSR_ROBOT2.py:9327-9445 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (58–110 lines × 4) · ×1
  • Duplicated block (58–110 lines × 4) dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:97 — dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:97-200 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:100-209 | dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:168-271 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:118-175 — before extracting anything, compare `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py` and `dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 379 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:97` 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.
D4 · Code Duplication · Duplicated block (107 lines × 2) · ×1
  • Duplicated block (107 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4818 — dsr_common2/imp/DSR_ROBOT2.py:4818-4924 | dsr_common2/imp/DSR_ROBOT2.py:9952-10058 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (131 lines × 2) · ×1
  • Duplicated block (131 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5592 — dsr_common2/imp/DSR_ROBOT2.py:5592-5722 | dsr_common2/imp/DSR_ROBOT2.py:10726-10856 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (70–73 lines × 6) · ×1
  • Duplicated block (70–73 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:549 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:549-621 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:686-755 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:549-621 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:686-755 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:549-621 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:686-755 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:549` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (72–73 lines × 4) · ×1
  • Duplicated block (72–73 lines × 4) dsr_bringup2/launch/dsr_mobile_manipulator_dual_moveit.launch.py:101 — dsr_bringup2/launch/dsr_mobile_manipulator_dual_moveit.launch.py:101-172 | dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:497-569 | dsr_bringup2/launch/dsr_mobile_manipulator_moveit.launch.py:90-161 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:305-376 — before extracting anything, compare `dsr_bringup2/launch/dsr_mobile_manipulator_dual_moveit.launch.py` and `dsr_bringup2/launch/dsr_mobile_manipulator_moveit.launch.py` as WHOLE FILES: 93% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_mobile_manipulator_dual_moveit.launch.py:101` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (64–65 lines × 2) · ×1
  • Duplicated block (64–65 lines × 2) dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:60 — dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:60-123 | dsr_gazebo2/launch/dsr_spawn_on_gazebo.launch.py:62-126 — before extracting anything, compare `dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py` and `dsr_gazebo2/launch/dsr_spawn_on_gazebo.launch.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 170 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:60` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (63–64 lines × 2) · ×1
  • Duplicated block (63–64 lines × 2) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:172 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:172-234 | dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:173-236 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:172` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:172` calls `PathJoinSubstitution`, `FindPackageShare` and `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:171` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (47–64 lines × 2) · ×1
  • Duplicated block (47–64 lines × 2) dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:262 — dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:262-308 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:272-335 — before extracting anything, compare `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py` and `dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 379 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:262` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (62 lines × 2) · ×1
  • Duplicated block (62 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3735 — dsr_common2/imp/DSR_ROBOT2.py:3735-3796 | dsr_common2/imp/DSR_ROBOT2.py:8871-8932 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (61 lines × 3) · ×1
  • Duplicated block (61 lines × 3) dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:52 — dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:52-112 | dsr_gazebo2/launch/dsr_gazebo.launch.py:54-114 | dsr_gazebo2/launch/dsr_spawn_on_gazebo.launch.py:54-114 — before extracting anything, compare `dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py` and `dsr_gazebo2/launch/dsr_gazebo.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (56 lines × 2) · ×1
  • Duplicated block (56 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:6161 — dsr_common2/imp/DSR_ROBOT2.py:6161-6216 | dsr_common2/imp/DSR_ROBOT2.py:11294-11349 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (53–54 lines × 3) · ×1
  • Duplicated block (53–54 lines × 3) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:73 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:73-125 | dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:47-100 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:71-124 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:73` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:71` calls `show_git_info` and `dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:69` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (47–54 lines × 2) · ×1
  • Duplicated block (47–54 lines × 2) dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:310 — dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:310-356 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:184-237 — before extracting anything, compare `dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py` and `dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:310` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (51–52 lines × 6) · ×1
  • Duplicated block (51–52 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:149 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:149-200 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:169-219 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:149-200 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:169-219 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:149-200 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:169-219 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:149` 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.
D4 · Code Duplication · Duplicated block (52 lines × 2) · ×1
  • Duplicated block (52 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3092 — dsr_common2/imp/DSR_ROBOT2.py:3092-3143 | dsr_common2/imp/DSR_ROBOT2.py:8227-8278 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (50–51 lines × 2) · ×1
  • Duplicated block (50–51 lines × 2) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:44 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:44-93 | dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:43-93 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:44` 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.
D4 · Code Duplication · Duplicated block (49 lines × 10) · ×1
  • Duplicated block (49 lines × 10) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:127 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:127-175 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:127-175 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:127-175 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:127-175 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:129-177 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:127-175 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:127-175 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:127-175 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:127-175 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:127-175 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:127` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (45–49 lines × 3) · ×1
  • Duplicated block (45–49 lines × 3) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:205 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:205-251 | dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:206-254 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:210-254 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:205` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (49 lines × 2) · ×1
  • Duplicated block (49 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:3362 — dsr_common2/imp/DSR_ROBOT2.py:3362-3410 | dsr_common2/imp/DSR_ROBOT2.py:8501-8549 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (44–47 lines × 2) · ×1
  • Duplicated block (44–47 lines × 2) dsr_mujoco/launch/dsr_mujoco.launch.py:171 — dsr_mujoco/launch/dsr_mujoco.launch.py:171-214 | dsr_mujoco/launch/dsr_mujoco_default.launch.py:67-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. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_mujoco/launch/dsr_mujoco_default.launch.py:67` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_mujoco/launch/dsr_mujoco.launch.py:166` calls `ParameterValue`, `LaunchConfiguration`, `Node` and `dsr_mujoco/launch/dsr_mujoco_default.launch.py:67` 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.
D4 · Code Duplication · Duplicated block (44 lines × 3) · ×1
  • Duplicated block (44 lines × 3) dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:286 — dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:286-329 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:286-329 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:286-329 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 576 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (39–42 lines × 2) · ×1
  • Duplicated block (39–42 lines × 2) dsr_example2/dsr_visualservoing/launch/camera_calibration.launch.py:33 — dsr_example2/dsr_visualservoing/launch/camera_calibration.launch.py:33-71 | dsr_example2/dsr_visualservoing/launch/rgbd_camera.launch.py:51-92 — before extracting anything, compare `dsr_example2/dsr_visualservoing/launch/camera_calibration.launch.py` and `dsr_example2/dsr_visualservoing/launch/rgbd_camera.launch.py` as WHOLE FILES: 96% of the shorter file's lines also appear in the other, so this reads as one file having been copied from the other rather than as a helper waiting to be extracted. The 1 duplicated block(s) this scan matched between them are fragments of that copy, not the extent of it — treat the file pair as the unit. 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.
D4 · Code Duplication · Duplicated block (36–41 lines × 2) · ×1
  • Duplicated block (36–41 lines × 2) dsr_controller2/launch/dsr_controller2.launch.py:118 — dsr_controller2/launch/dsr_controller2.launch.py:118-158 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:176-211 — before extracting anything, compare `dsr_controller2/launch/dsr_controller2.launch.py` and `dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py` as WHOLE FILES: this scan already matched 5 separate duplicated blocks between them, totalling at least 130 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_controller2/launch/dsr_controller2.launch.py:118` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:172` calls `IfCondition` and `dsr_controller2/launch/dsr_controller2.launch.py:114` 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.
D4 · Code Duplication · Duplicated block (38–40 lines × 10) · ×1
  • Duplicated block (38–40 lines × 10) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:88 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:88-125 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:88-125 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:88-125 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:88-125 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:88-127 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:88-125 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:88-125 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:88-125 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:88-125 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:88-125 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:88` 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.
D4 · Code Duplication · Duplicated block (40 lines × 3) · ×1
  • Duplicated block (40 lines × 3) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:264 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:264-303 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:264-303 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:264-303 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py` as WHOLE FILES: this scan already matched 14 separate duplicated blocks between them, totalling at least 541 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (37 lines × 2) · ×1
  • Duplicated block (37 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5456 — dsr_common2/imp/DSR_ROBOT2.py:5456-5492 | dsr_common2/imp/DSR_ROBOT2.py:10590-10626 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (33–34 lines × 6) · ×1
  • Duplicated block (33–34 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:344 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:344-377 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:398-430 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:344-377 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:398-430 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:344-377 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:398-430 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:344` 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 before the matched lines, `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:397` calls `IfCondition`, `PythonExpression`, `LaunchConfiguration` and `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:343` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (34 lines × 2) · ×1
  • Duplicated block (34 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5957 — dsr_common2/imp/DSR_ROBOT2.py:5957-5990 | dsr_common2/imp/DSR_ROBOT2.py:11090-11123 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (31–33 lines × 4) · ×1
  • Duplicated block (31–33 lines × 4) dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:170 — dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:170-200 | dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:232-263 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:242-273 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:217-249 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_rviz.launch.py` and `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 91 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:170` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (30–32 lines × 3) · ×1
  • Duplicated block (30–32 lines × 3) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:104 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:104-134 | dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:101-130 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:102-133 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_rviz.launch.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:104` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (31–32 lines × 3) · ×1
  • Duplicated block (31–32 lines × 3) dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:125 — dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:125-155 | dsr_gazebo2/launch/dsr_gazebo.launch.py:127-158 | dsr_gazebo2/launch/dsr_spawn_on_gazebo.launch.py:144-175 — before extracting anything, compare `dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py` and `dsr_gazebo2/launch/dsr_gazebo.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:125` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (22–31 lines × 4) · ×1
  • Duplicated block (22–31 lines × 4) dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:257 — dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:257-279 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:267-297 | dsr_controller2/launch/dsr_controller2.launch.py:129-155 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:187-208 — before extracting anything, compare `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py` and `dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 379 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:257` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (28–31 lines × 2) · ×1
  • Duplicated block (28–31 lines × 2) dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:414 — dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:414-444 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:271-298 — before extracting anything, compare `dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py` and `dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:414` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (22–31 lines × 2) · ×1
  • Duplicated block (22–31 lines × 2) dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:284 — dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:284-305 | dsr_controller2/launch/dsr_controller2.launch.py:136-166 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:284` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (20–30 lines × 5) · ×1
  • Duplicated block (20–30 lines × 5) dsr_common2/imp/DSR_ROBOT2.py:5444 — dsr_common2/imp/DSR_ROBOT2.py:5444-5463 | dsr_common2/imp/DSR_ROBOT2.py:5531-5560 | dsr_common2/imp/DSR_ROBOT2.py:5675-5694 | dsr_common2/imp/DSR_ROBOT2.py:10578-10597 | dsr_common2/imp/DSR_ROBOT2.py:10809-10828 — 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.
D4 · Code Duplication · Duplicated block (20–29 lines × 6) · ×1
  • Duplicated block (20–29 lines × 6) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:168 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:168-187 | dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:191-217 | dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:253-273 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:263-291 | dsr_controller2/launch/dsr_controller2.launch.py:125-150 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:183-203 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_rviz.launch.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 90 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:168` 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, `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:189` calls `GroupAction` and `dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:219` 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.
D4 · Code Duplication · Duplicated block (29 lines × 5) · ×1
  • Duplicated block (29 lines × 5) dsr_common2/imp/DSR_ROBOT2.py:1514 — dsr_common2/imp/DSR_ROBOT2.py:1514-1542 | dsr_common2/imp/DSR_ROBOT2.py:1784-1812 | dsr_common2/imp/DSR_ROBOT2.py:2548-2576 | dsr_common2/imp/DSR_ROBOT2.py:2681-2709 | dsr_common2/imp/DSR_ROBOT2.py:3200-3228 — 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.
D4 · Code Duplication · Duplicated block (29 lines × 3) · ×1
  • Duplicated block (29 lines × 3) dsr_common2/imp/DSR_ROBOT2.py:7701 — dsr_common2/imp/DSR_ROBOT2.py:7701-7729 | dsr_common2/imp/DSR_ROBOT2.py:7829-7857 | dsr_common2/imp/DSR_ROBOT2.py:8333-8361 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (20–29 lines × 2) · ×1
  • Duplicated block (20–29 lines × 2) dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:370 — dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:370-398 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:244-263 — before extracting anything, compare `dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py` and `dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:370` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (28 lines × 16) · ×1
  • Duplicated block (28 lines × 16) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:58 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:58-85 | dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:97-124 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:117-144 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:97-124 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:117-144 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:97-124 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:117-144 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 310 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. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (28 lines × 2) · ×1
  • Duplicated block (28 lines × 2) dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:70 — dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:70-97 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:50-77 — before extracting anything, compare `dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py` and `dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 351 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:70` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (26–27 lines × 3) · ×1
  • Duplicated block (26–27 lines × 3) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:127 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:127-153 | dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:127-152 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:126-151 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:127` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (27 lines × 3) · ×1
  • Duplicated block (27 lines × 3) dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:265 — dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:265-294 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:275-312 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:265-291 — before extracting anything, compare `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py` and `dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 379 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:265` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (15–27 lines × 2) · ×1
  • Duplicated block (15–27 lines × 2) dsr_bringup2/dsr_bringup2/run_emulator.py:29 — dsr_bringup2/dsr_bringup2/run_emulator.py:29-43 | dsr_bringup2/dsr_bringup2/set_config.py:29-55 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (10–26 lines × 4) · ×1
  • Duplicated block (10–26 lines × 4) dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:202 — dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:202-226 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:211-236 | dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:274-283 | dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:178-194 — before extracting anything, compare `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py` and `dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 379 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:202` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (26 lines × 2) · ×1
  • Duplicated block (26 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:7884 — dsr_common2/imp/DSR_ROBOT2.py:7884-7909 | dsr_common2/imp/DSR_ROBOT2.py:8047-8072 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (23–25 lines × 8) · ×1
  • Duplicated block (23–25 lines × 8) dsr_common2/imp/DSR_ROBOT2.py:2864 — dsr_common2/imp/DSR_ROBOT2.py:2864-2888 | dsr_common2/imp/DSR_ROBOT2.py:3034-3056 | dsr_common2/imp/DSR_ROBOT2.py:3342-3364 | dsr_common2/imp/DSR_ROBOT2.py:3510-3532 | dsr_common2/imp/DSR_ROBOT2.py:8008-8032 | dsr_common2/imp/DSR_ROBOT2.py:8171-8193 | dsr_common2/imp/DSR_ROBOT2.py:8481-8503 | dsr_common2/imp/DSR_ROBOT2.py:8649-8671 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_common2/imp/DSR_ROBOT2.py:2864` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (25 lines × 3) · ×1
  • Duplicated block (25 lines × 3) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:179 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:179-205 | dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:180-206 | dsr_gazebo2/launch/dsr_gazebo.launch.py:150-174 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:179` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (25 lines × 2) · ×1
  • Duplicated block (25 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:2764 — dsr_common2/imp/DSR_ROBOT2.py:2764-2788 | dsr_common2/imp/DSR_ROBOT2.py:7910-7934 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (24 lines × 4) · ×1
  • Duplicated block (24 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:2740 — dsr_common2/imp/DSR_ROBOT2.py:2740-2763 | dsr_common2/imp/DSR_ROBOT2.py:2907-2930 | dsr_common2/imp/DSR_ROBOT2.py:3075-3098 | dsr_common2/imp/DSR_ROBOT2.py:8210-8233 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_common2/imp/DSR_ROBOT2.py:2740` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (22–24 lines × 2) · ×1
  • Duplicated block (22–24 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:7741 — dsr_common2/imp/DSR_ROBOT2.py:7741-7764 | dsr_common2/imp/DSR_ROBOT2.py:7869-7890 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×1
  • Duplicated block (23 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:5174 — dsr_common2/imp/DSR_ROBOT2.py:5174-5196 | dsr_common2/imp/DSR_ROBOT2.py:10308-10330 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) dsr_common2/imp/DR_tcp_client2.py:240 — dsr_common2/imp/DR_tcp_client2.py:240-261 | dsr_common2/imp/DR_tcp_server2.py:263-284 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (21 lines × 4) · ×1
  • Duplicated block (21 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:2934 — dsr_common2/imp/DSR_ROBOT2.py:2934-2954 | dsr_common2/imp/DSR_ROBOT2.py:3121-3141 | dsr_common2/imp/DSR_ROBOT2.py:8076-8096 | dsr_common2/imp/DSR_ROBOT2.py:8256-8276 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (20 lines × 6) · ×1
  • Duplicated block (20 lines × 6) dsr_common2/imp/DSR_ROBOT2.py:4709 — dsr_common2/imp/DSR_ROBOT2.py:4709-4728 | dsr_common2/imp/DSR_ROBOT2.py:4753-4772 | dsr_common2/imp/DSR_ROBOT2.py:5349-5368 | dsr_common2/imp/DSR_ROBOT2.py:9843-9862 | dsr_common2/imp/DSR_ROBOT2.py:9887-9906 | dsr_common2/imp/DSR_ROBOT2.py:10483-10502 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `dsr_common2/imp/DSR_ROBOT2.py:5372` calls `DR_Error` and `dsr_common2/imp/DSR_ROBOT2.py:4730` 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.
D4 · Code Duplication · Duplicated block (18–19 lines × 6) · ×1
  • Duplicated block (18–19 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:259 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:259-277 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:287-304 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:259-277 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:287-304 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:259-277 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:287-304 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:259` 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:286` calls `LaunchConfiguration`, `perform` and `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:258` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (16–19 lines × 4) · ×1
  • Duplicated block (16–19 lines × 4) dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:115 — dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:115-133 | dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:195-210 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:204-219 | dsr_tests/launch/dsr_bringup_without_spawner_test.launch.py:101-116 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 4 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 4 times. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:115` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (18 lines × 10) · ×1
  • Duplicated block (18 lines × 10) dsr_common2/imp/DSR_ROBOT2.py:1540 — dsr_common2/imp/DSR_ROBOT2.py:1540-1557 | dsr_common2/imp/DSR_ROBOT2.py:1810-1827 | dsr_common2/imp/DSR_ROBOT2.py:2574-2591 | dsr_common2/imp/DSR_ROBOT2.py:2707-2724 | dsr_common2/imp/DSR_ROBOT2.py:3226-3243 | dsr_common2/imp/DSR_ROBOT2.py:3648-3665 | dsr_common2/imp/DSR_ROBOT2.py:7727-7744 | dsr_common2/imp/DSR_ROBOT2.py:7855-7872 | dsr_common2/imp/DSR_ROBOT2.py:8359-8376 | dsr_common2/imp/DSR_ROBOT2.py:8787-8804 — all 10 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (17–18 lines × 4) · ×1
  • Duplicated block (17–18 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4286 — dsr_common2/imp/DSR_ROBOT2.py:4286-4302 | dsr_common2/imp/DSR_ROBOT2.py:4524-4541 | dsr_common2/imp/DSR_ROBOT2.py:9420-9436 | dsr_common2/imp/DSR_ROBOT2.py:9658-9675 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (15–18 lines × 3) · ×1
  • Duplicated block (15–18 lines × 3) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:155 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:155-171 | dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:157-171 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:162-179 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 236 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:155` 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, `dsr_bringup2/launch/dsr_bringup2_spawn_on_gazebo.launch.py:172` calls `PathJoinSubstitution`, `FindPackageShare` and `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:172` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (18 lines × 3) · ×1
  • Duplicated block (18 lines × 3) dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:250 — dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:250-267 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:250-267 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:250-267 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 16 separate duplicated blocks between them, totalling at least 576 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. 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.
D4 · Code Duplication · Duplicated block (15–17 lines × 16) · ×1
  • Duplicated block (15–17 lines × 16) dsr_common2/imp/DSR_ROBOT2.py:2846 — dsr_common2/imp/DSR_ROBOT2.py:2846-2862 | dsr_common2/imp/DSR_ROBOT2.py:2871-2887 | dsr_common2/imp/DSR_ROBOT2.py:3018-3032 | dsr_common2/imp/DSR_ROBOT2.py:3041-3055 | dsr_common2/imp/DSR_ROBOT2.py:3326-3340 | dsr_common2/imp/DSR_ROBOT2.py:3349-3363 | dsr_common2/imp/DSR_ROBOT2.py:3494-3508 | dsr_common2/imp/DSR_ROBOT2.py:3517-3531 | dsr_common2/imp/DSR_ROBOT2.py:7990-8006 | dsr_common2/imp/DSR_ROBOT2.py:8015-8031 | dsr_common2/imp/DSR_ROBOT2.py:8155-8169 | dsr_common2/imp/DSR_ROBOT2.py:8178-8192 | dsr_common2/imp/DSR_ROBOT2.py:8465-8479 | dsr_common2/imp/DSR_ROBOT2.py:8488-8502 | dsr_common2/imp/DSR_ROBOT2.py:8633-8647 | dsr_common2/imp/DSR_ROBOT2.py:8656-8670 — all 16 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, `dsr_common2/imp/DSR_ROBOT2.py:3536` calls `_check_valid_vel_acc_task` and `dsr_common2/imp/DSR_ROBOT2.py:2863` 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.
D4 · Code Duplication · Duplicated block (17 lines × 3) · ×1
  • Duplicated block (17 lines × 3) dsr_common2/imp/DSR_ROBOT2.py:3374 — dsr_common2/imp/DSR_ROBOT2.py:3374-3390 | dsr_common2/imp/DSR_ROBOT2.py:3536-3552 | dsr_common2/imp/DSR_ROBOT2.py:8513-8529 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (16 lines × 10) · ×1
  • Duplicated block (16 lines × 10) dsr_common2/imp/DSR_ROBOT2.py:2752 — dsr_common2/imp/DSR_ROBOT2.py:2752-2767 | dsr_common2/imp/DSR_ROBOT2.py:2919-2934 | dsr_common2/imp/DSR_ROBOT2.py:3087-3102 | dsr_common2/imp/DSR_ROBOT2.py:3379-3394 | dsr_common2/imp/DSR_ROBOT2.py:3541-3556 | dsr_common2/imp/DSR_ROBOT2.py:7898-7913 | dsr_common2/imp/DSR_ROBOT2.py:8061-8076 | dsr_common2/imp/DSR_ROBOT2.py:8222-8237 | dsr_common2/imp/DSR_ROBOT2.py:8518-8533 | dsr_common2/imp/DSR_ROBOT2.py:8680-8695 — all 10 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 `dsr_common2/imp/DSR_ROBOT2.py:2752` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_common2/imp/DSR_ROBOT2.py:3374` calls `_check_valid_vel_acc_task` and `dsr_common2/imp/DSR_ROBOT2.py:2747` 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.
D4 · Code Duplication · Duplicated block (16 lines × 6) · ×1
  • Duplicated block (16 lines × 6) dsr_common2/imp/DSR_ROBOT2.py:5451 — dsr_common2/imp/DSR_ROBOT2.py:5451-5466 | dsr_common2/imp/DSR_ROBOT2.py:5548-5563 | dsr_common2/imp/DSR_ROBOT2.py:5682-5697 | dsr_common2/imp/DSR_ROBOT2.py:10585-10600 | dsr_common2/imp/DSR_ROBOT2.py:10682-10697 | dsr_common2/imp/DSR_ROBOT2.py:10816-10831 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (14–16 lines × 4) · ×1
  • Duplicated block (14–16 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4324 — dsr_common2/imp/DSR_ROBOT2.py:4324-4337 | dsr_common2/imp/DSR_ROBOT2.py:4566-4581 | dsr_common2/imp/DSR_ROBOT2.py:9458-9471 | dsr_common2/imp/DSR_ROBOT2.py:9700-9715 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (15–16 lines × 3) · ×1
  • Duplicated block (15–16 lines × 3) dsr_common2/imp/DSR_ROBOT2.py:1626 — dsr_common2/imp/DSR_ROBOT2.py:1626-1641 | dsr_common2/imp/DSR_ROBOT2.py:1747-1762 | dsr_common2/imp/DSR_ROBOT2.py:1910-1924 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (15 lines × 6) · ×1
  • Duplicated block (15 lines × 6) dsr_common2/imp/DSR_ROBOT2.py:2614 — dsr_common2/imp/DSR_ROBOT2.py:2614-2628 | dsr_common2/imp/DSR_ROBOT2.py:2760-2774 | dsr_common2/imp/DSR_ROBOT2.py:2927-2941 | dsr_common2/imp/DSR_ROBOT2.py:7767-7781 | dsr_common2/imp/DSR_ROBOT2.py:7906-7920 | dsr_common2/imp/DSR_ROBOT2.py:8069-8083 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (15 lines × 3) · ×1
  • Duplicated block (15 lines × 3) dsr_common2/imp/DSR_ROBOT2.py:1634 — dsr_common2/imp/DSR_ROBOT2.py:1634-1648 | dsr_common2/imp/DSR_ROBOT2.py:1755-1769 | dsr_common2/imp/DSR_ROBOT2.py:1970-1984 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (14 lines × 20) · ×1
  • Duplicated block (14 lines × 20) dsr_common2/imp/DSR_ROBOT2.py:1521 — dsr_common2/imp/DSR_ROBOT2.py:1521-1534 | dsr_common2/imp/DSR_ROBOT2.py:1540-1553 | dsr_common2/imp/DSR_ROBOT2.py:1791-1804 | dsr_common2/imp/DSR_ROBOT2.py:1810-1823 | dsr_common2/imp/DSR_ROBOT2.py:2555-2568 | dsr_common2/imp/DSR_ROBOT2.py:2574-2587 | dsr_common2/imp/DSR_ROBOT2.py:2688-2701 | dsr_common2/imp/DSR_ROBOT2.py:2707-2720 | dsr_common2/imp/DSR_ROBOT2.py:3207-3220 | dsr_common2/imp/DSR_ROBOT2.py:3226-3239 | dsr_common2/imp/DSR_ROBOT2.py:3629-3642 | dsr_common2/imp/DSR_ROBOT2.py:3648-3661 | dsr_common2/imp/DSR_ROBOT2.py:7708-7721 | dsr_common2/imp/DSR_ROBOT2.py:7727-7740 | dsr_common2/imp/DSR_ROBOT2.py:7836-7849 | dsr_common2/imp/DSR_ROBOT2.py:7855-7868 | dsr_common2/imp/DSR_ROBOT2.py:8340-8353 | dsr_common2/imp/DSR_ROBOT2.py:8359-8372 | dsr_common2/imp/DSR_ROBOT2.py:8768-8781 | dsr_common2/imp/DSR_ROBOT2.py:8787-8800 — all 20 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (14 lines × 7) · ×1
  • Duplicated block (14 lines × 7) dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:165 — dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:165-178 | dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:150-164 | dsr_bringup2/launch/dsr_bringup2_rviz.launch.py:188-201 | dsr_bringup2/launch/dsr_dual_arm_rviz.launch.py:250-264 | dsr_bringup2/launch/dsr_dual_mobile_manipulator_rviz.launch.py:260-274 | dsr_controller2/launch/dsr_controller2.launch.py:115-128 | dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:173-186 — before extracting anything, compare `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py` and `dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 83 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:165` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_bringup2/launch/dsr_bringup2_mujoco.launch.py:149` calls `LaunchConfiguration` and `dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:164` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (14 lines × 6) · ×1
  • Duplicated block (14 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:217 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:217-230 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:238-251 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:217-230 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:238-251 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:217-230 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:238-251 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:236` calls `LaunchConfiguration`, `perform` and `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:216` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (14 lines × 4) · ×1
  • Duplicated block (14 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:2601 — dsr_common2/imp/DSR_ROBOT2.py:2601-2614 | dsr_common2/imp/DSR_ROBOT2.py:2734-2747 | dsr_common2/imp/DSR_ROBOT2.py:2901-2914 | dsr_common2/imp/DSR_ROBOT2.py:3069-3082 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (13–14 lines × 4) · ×1
  • Duplicated block (13–14 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:4347 — dsr_common2/imp/DSR_ROBOT2.py:4347-4359 | dsr_common2/imp/DSR_ROBOT2.py:4592-4605 | dsr_common2/imp/DSR_ROBOT2.py:9481-9493 | dsr_common2/imp/DSR_ROBOT2.py:9726-9739 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (12–14 lines × 4) · ×1
  • Duplicated block (12–14 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:7754 — dsr_common2/imp/DSR_ROBOT2.py:7754-7767 | dsr_common2/imp/DSR_ROBOT2.py:7882-7893 | dsr_common2/imp/DSR_ROBOT2.py:8045-8056 | dsr_common2/imp/DSR_ROBOT2.py:8206-8217 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (11–14 lines × 2) · ×1
  • Duplicated block (11–14 lines × 2) dsr_controller2/launch/dsr_moveit2.launch.py:117 — dsr_controller2/launch/dsr_moveit2.launch.py:117-130 | dsr_description2/launch/dsr_description.launch.py:78-88 — before extracting anything, compare `dsr_controller2/launch/dsr_moveit2.launch.py` and `dsr_description2/launch/dsr_description.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 30 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_controller2/launch/dsr_moveit2.launch.py:117` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (13 lines × 16) · ×1
  • Duplicated block (13 lines × 16) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:179 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:181-193 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:179-191 | dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:226-238 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:247-259 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:226-238 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:247-259 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:226-238 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:247-259 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:179` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (11–13 lines × 13) · ×1
  • Duplicated block (11–13 lines × 13) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:92 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:92-102 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:155-167 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:155-167 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:155-167 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:92` 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.
D4 · Code Duplication · Duplicated block (13 lines × 10) · ×1
  • Duplicated block (13 lines × 10) dsr_common2/imp/DSR_ROBOT2.py:5845 — dsr_common2/imp/DSR_ROBOT2.py:5845-5857 | dsr_common2/imp/DSR_ROBOT2.py:5871-5883 | dsr_common2/imp/DSR_ROBOT2.py:5941-5953 | dsr_common2/imp/DSR_ROBOT2.py:6142-6154 | dsr_common2/imp/DSR_ROBOT2.py:6309-6321 | dsr_common2/imp/DSR_ROBOT2.py:10978-10990 | dsr_common2/imp/DSR_ROBOT2.py:11004-11016 | dsr_common2/imp/DSR_ROBOT2.py:11074-11086 | dsr_common2/imp/DSR_ROBOT2.py:11275-11287 | dsr_common2/imp/DSR_ROBOT2.py:11442-11454 — all 10 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 `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.
D4 · Code Duplication · Duplicated block (11–13 lines × 6) · ×1
  • Duplicated block (11–13 lines × 6) dsr_common2/imp/DSR_ROBOT2.py:4370 — dsr_common2/imp/DSR_ROBOT2.py:4370-4382 | dsr_common2/imp/DSR_ROBOT2.py:4617-4629 | dsr_common2/imp/DSR_ROBOT2.py:5733-5743 | dsr_common2/imp/DSR_ROBOT2.py:9504-9516 | dsr_common2/imp/DSR_ROBOT2.py:9751-9763 | dsr_common2/imp/DSR_ROBOT2.py:10867-10877 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (13 lines × 4) · ×1
  • Duplicated block (13 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:6359 — dsr_common2/imp/DSR_ROBOT2.py:6359-6371 | dsr_common2/imp/DSR_ROBOT2.py:6409-6421 | dsr_common2/imp/DSR_ROBOT2.py:11492-11504 | dsr_common2/imp/DSR_ROBOT2.py:11542-11554 — 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. 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.
D4 · Code Duplication · Duplicated block (11–12 lines × 6) · ×1
  • Duplicated block (11–12 lines × 6) dsr_common2/imp/DSR_ROBOT2.py:4262 — dsr_common2/imp/DSR_ROBOT2.py:4262-4273 | dsr_common2/imp/DSR_ROBOT2.py:4279-4289 | dsr_common2/imp/DSR_ROBOT2.py:4487-4498 | dsr_common2/imp/DSR_ROBOT2.py:9396-9407 | dsr_common2/imp/DSR_ROBOT2.py:9413-9423 | dsr_common2/imp/DSR_ROBOT2.py:9621-9632 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (12 lines × 3) · ×1
  • Duplicated block (12 lines × 3) dsr_common2/imp/DSR_ROBOT2.py:2086 — dsr_common2/imp/DSR_ROBOT2.py:2086-2097 | dsr_common2/imp/DSR_ROBOT2.py:2109-2120 | dsr_common2/imp/DSR_ROBOT2.py:2138-2149 — 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 `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.
D4 · Code Duplication · Duplicated block (11–12 lines × 3) · ×1
  • Duplicated block (11–12 lines × 3) dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:115 — dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py:115-125 | dsr_gazebo2/launch/dsr_gazebo.launch.py:117-127 | dsr_gazebo2/launch/dsr_spawn_on_gazebo.launch.py:117-128 — before extracting anything, compare `dsr_example2/dsr_visualservoing/launch/dsr_gazebo_visual_servoing.launch.py` and `dsr_gazebo2/launch/dsr_gazebo.launch.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 105 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (10–11 lines × 123) · ×1
  • Duplicated block (10–11 lines × 123) dsr_common2/imp/DSR_ROBOT2.py:636 — dsr_common2/imp/DSR_ROBOT2.py:636-646 | dsr_common2/imp/DSR_ROBOT2.py:742-752 | dsr_common2/imp/DSR_ROBOT2.py:784-794 | dsr_common2/imp/DSR_ROBOT2.py:870-880 | dsr_common2/imp/DSR_ROBOT2.py:1476-1486 | dsr_common2/imp/DSR_ROBOT2.py:2043-2053 | dsr_common2/imp/DSR_ROBOT2.py:2654-2664 | dsr_common2/imp/DSR_ROBOT2.py:2808-2818 | dsr_common2/imp/DSR_ROBOT2.py:2972-2982 | dsr_common2/imp/DSR_ROBOT2.py:3166-3176 | dsr_common2/imp/DSR_ROBOT2.py:3281-3291 | dsr_common2/imp/DSR_ROBOT2.py:3425-3435 | dsr_common2/imp/DSR_ROBOT2.py:3578-3588 | dsr_common2/imp/DSR_ROBOT2.py:3711-3721 | dsr_common2/imp/DSR_ROBOT2.py:3811-3821 | dsr_common2/imp/DSR_ROBOT2.py:3842-3852 | dsr_common2/imp/DSR_ROBOT2.py:3870-3880 | dsr_common2/imp/DSR_ROBOT2.py:3914-3924 | dsr_common2/imp/DSR_ROBOT2.py:3972-3982 | dsr_common2/imp/DSR_ROBOT2.py:3998-4008 | dsr_common2/imp/DSR_ROBOT2.py:4017-4027 | dsr_common2/imp/DSR_ROBOT2.py:4042-4052 | dsr_common2/imp/DSR_ROBOT2.py:4099-4109 | dsr_common2/imp/DSR_ROBOT2.py:4128-4138 | dsr_common2/imp/DSR_ROBOT2.py:4172-4182 | dsr_common2/imp/DSR_ROBOT2.py:4322-4332 | dsr_common2/imp/DSR_ROBOT2.py:4344-4354 | dsr_common2/imp/DSR_ROBOT2.py:4368-4378 | dsr_common2/imp/DSR_ROBOT2.py:4389-4399 | dsr_common2/imp/DSR_ROBOT2.py:4564-4574 | dsr_common2/imp/DSR_ROBOT2.py:4589-4599 | dsr_common2/imp/DSR_ROBOT2.py:4615-4625 | dsr_common2/imp/DSR_ROBOT2.py:4637-4647 | dsr_common2/imp/DSR_ROBOT2.py:4674-4683 | dsr_common2/imp/DSR_ROBOT2.py:4693-4703 | dsr_common2/imp/DSR_ROBOT2.py:4737-4747 | dsr_common2/imp/DSR_ROBOT2.py:4781-4791 | dsr_common2/imp/DSR_ROBOT2.py:5384-5394 | dsr_common2/imp/DSR_ROBOT2.py:5415-5425 | dsr_common2/imp/DSR_ROBOT2.py:5502-5512 | dsr_common2/imp/DSR_ROBOT2.py:5577-5587 | dsr_common2/imp/DSR_ROBOT2.py:5731-5741 | dsr_common2/imp/DSR_ROBOT2.py:5753-5763 | dsr_common2/imp/DSR_ROBOT2.py:5915-5925 | dsr_common2/imp/DSR_ROBOT2.py:5996-6006 | dsr_common2/imp/DSR_ROBOT2.py:6037-6047 | dsr_common2/imp/DSR_ROBOT2.py:6070-6080 | dsr_common2/imp/DSR_ROBOT2.py:6115-6125 | dsr_common2/imp/DSR_ROBOT2.py:6227-6237 | dsr_common2/imp/DSR_ROBOT2.py:6252-6262 | dsr_common2/imp/DSR_ROBOT2.py:6284-6294 | dsr_common2/imp/DSR_ROBOT2.py:6339-6349 | dsr_common2/imp/DSR_ROBOT2.py:6388-6398 | dsr_common2/imp/DSR_ROBOT2.py:6433-6443 | dsr_common2/imp/DSR_ROBOT2.py:6458-6468 | dsr_common2/imp/DSR_ROBOT2.py:6482-6492 | dsr_common2/imp/DSR_ROBOT2.py:6509-6519 | dsr_common2/imp/DSR_ROBOT2.py:6533-6543 | dsr_common2/imp/DSR_ROBOT2.py:6560-6570 | dsr_common2/imp/DSR_ROBOT2.py:6584-6594 | dsr_common2/imp/DSR_ROBOT2.py:6603-6613 | dsr_common2/imp/DSR_ROBOT2.py:6622-6632 | dsr_common2/imp/DSR_ROBOT2.py:6839-6849 | dsr_common2/imp/DSR_ROBOT2.py:6945-6955 | dsr_common2/imp/DSR_ROBOT2.py:6987-6997 | dsr_common2/imp/DSR_ROBOT2.py:7073-7083 | dsr_common2/imp/DSR_ROBOT2.py:7670-7680 | dsr_common2/imp/DSR_ROBOT2.py:7803-7813 | dsr_common2/imp/DSR_ROBOT2.py:7951-7961 | dsr_common2/imp/DSR_ROBOT2.py:8111-8121 | dsr_common2/imp/DSR_ROBOT2.py:8299-8309 | dsr_common2/imp/DSR_ROBOT2.py:8420-8430 | dsr_common2/imp/DSR_ROBOT2.py:8564-8574 | dsr_common2/imp/DSR_ROBOT2.py:8717-8727 | dsr_common2/imp/DSR_ROBOT2.py:8847-8857 | dsr_common2/imp/DSR_ROBOT2.py:8944-8954 | dsr_common2/imp/DSR_ROBOT2.py:8975-8985 | dsr_common2/imp/DSR_ROBOT2.py:9004-9014 | dsr_common2/imp/DSR_ROBOT2.py:9048-9058 | dsr_common2/imp/DSR_ROBOT2.py:9106-9116 | dsr_common2/imp/DSR_ROBOT2.py:9132-9142 | dsr_common2/imp/DSR_ROBOT2.py:9151-9161 | dsr_common2/imp/DSR_ROBOT2.py:9176-9186 | dsr_common2/imp/DSR_ROBOT2.py:9233-9243 | dsr_common2/imp/DSR_ROBOT2.py:9263-9273 | dsr_common2/imp/DSR_ROBOT2.py:9306-9316 | dsr_common2/imp/DSR_ROBOT2.py:9456-9466 | dsr_common2/imp/DSR_ROBOT2.py:9478-9488 | dsr_common2/imp/DSR_ROBOT2.py:9502-9512 | dsr_common2/imp/DSR_ROBOT2.py:9523-9533 | dsr_common2/imp/DSR_ROBOT2.py:9698-9708 | dsr_common2/imp/DSR_ROBOT2.py:9723-9733 | dsr_common2/imp/DSR_ROBOT2.py:9749-9759 | dsr_common2/imp/DSR_ROBOT2.py:9771-9781 | dsr_common2/imp/DSR_ROBOT2.py:9808-9817 | dsr_common2/imp/DSR_ROBOT2.py:9827-9837 | dsr_common2/imp/DSR_ROBOT2.py:9871-9881 | dsr_common2/imp/DSR_ROBOT2.py:9915-9925 | dsr_common2/imp/DSR_ROBOT2.py:10518-10528 | dsr_common2/imp/DSR_ROBOT2.py:10549-10559 | dsr_common2/imp/DSR_ROBOT2.py:10636-10646 | dsr_common2/imp/DSR_ROBOT2.py:10711-10721 | dsr_common2/imp/DSR_ROBOT2.py:10865-10875 | dsr_common2/imp/DSR_ROBOT2.py:10887-10897 | dsr_common2/imp/DSR_ROBOT2.py:11048-11058 | dsr_common2/imp/DSR_ROBOT2.py:11129-11139 | dsr_common2/imp/DSR_ROBOT2.py:11170-11180 | dsr_common2/imp/DSR_ROBOT2.py:11203-11213 | dsr_common2/imp/DSR_ROBOT2.py:11248-11258 | dsr_common2/imp/DSR_ROBOT2.py:11360-11370 | dsr_common2/imp/DSR_ROBOT2.py:11385-11395 | dsr_common2/imp/DSR_ROBOT2.py:11418-11428 | dsr_common2/imp/DSR_ROBOT2.py:11472-11482 | dsr_common2/imp/DSR_ROBOT2.py:11521-11531 | dsr_common2/imp/DSR_ROBOT2.py:11566-11576 | dsr_common2/imp/DSR_ROBOT2.py:11591-11601 | dsr_common2/imp/DSR_ROBOT2.py:11615-11625 | dsr_common2/imp/DSR_ROBOT2.py:11642-11652 | dsr_common2/imp/DSR_ROBOT2.py:11666-11676 | dsr_common2/imp/DSR_ROBOT2.py:11693-11703 | dsr_common2/imp/DSR_ROBOT2.py:11717-11727 | dsr_common2/imp/DSR_ROBOT2.py:11736-11746 | dsr_common2/imp/DSR_ROBOT2.py:11755-11765 — all 123 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, `dsr_common2/imp/DSR_ROBOT2.py:632` calls `wait_for_service`, `get_logger`, `info` and `dsr_common2/imp/DSR_ROBOT2.py:739` 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.
D4 · Code Duplication · Duplicated block (11 lines × 12) · ×1
  • Duplicated block (11 lines × 12) dsr_common2/imp/DSR_ROBOT2.py:5149 — dsr_common2/imp/DSR_ROBOT2.py:5149-5159 | dsr_common2/imp/DSR_ROBOT2.py:5172-5182 | dsr_common2/imp/DSR_ROBOT2.py:5205-5215 | dsr_common2/imp/DSR_ROBOT2.py:5229-5239 | dsr_common2/imp/DSR_ROBOT2.py:5251-5261 | dsr_common2/imp/DSR_ROBOT2.py:5301-5311 | dsr_common2/imp/DSR_ROBOT2.py:10283-10293 | dsr_common2/imp/DSR_ROBOT2.py:10306-10316 | dsr_common2/imp/DSR_ROBOT2.py:10339-10349 | dsr_common2/imp/DSR_ROBOT2.py:10363-10373 | dsr_common2/imp/DSR_ROBOT2.py:10385-10395 | dsr_common2/imp/DSR_ROBOT2.py:10435-10445 — all 12 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (9–11 lines × 6) · ×1
  • Duplicated block (9–11 lines × 6) dsr_common2/imp/DSR_ROBOT2.py:1108 — dsr_common2/imp/DSR_ROBOT2.py:1108-1118 | dsr_common2/imp/DSR_ROBOT2.py:1354-1362 | dsr_common2/imp/DSR_ROBOT2.py:3941-3951 | dsr_common2/imp/DSR_ROBOT2.py:7300-7310 | dsr_common2/imp/DSR_ROBOT2.py:7548-7556 | dsr_common2/imp/DSR_ROBOT2.py:9075-9085 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (10 lines × 18) · ×1
  • Duplicated block (10 lines × 18) dsr_common2/imp/DSR_ROBOT2.py:975 — dsr_common2/imp/DSR_ROBOT2.py:975-984 | dsr_common2/imp/DSR_ROBOT2.py:994-1003 | dsr_common2/imp/DSR_ROBOT2.py:1125-1134 | dsr_common2/imp/DSR_ROBOT2.py:1154-1163 | dsr_common2/imp/DSR_ROBOT2.py:1219-1228 | dsr_common2/imp/DSR_ROBOT2.py:1237-1246 | dsr_common2/imp/DSR_ROBOT2.py:4935-4944 | dsr_common2/imp/DSR_ROBOT2.py:5787-5796 | dsr_common2/imp/DSR_ROBOT2.py:7147-7156 | dsr_common2/imp/DSR_ROBOT2.py:7166-7175 | dsr_common2/imp/DSR_ROBOT2.py:7185-7194 | dsr_common2/imp/DSR_ROBOT2.py:7317-7326 | dsr_common2/imp/DSR_ROBOT2.py:7346-7355 | dsr_common2/imp/DSR_ROBOT2.py:7411-7420 | dsr_common2/imp/DSR_ROBOT2.py:7429-7438 | dsr_common2/imp/DSR_ROBOT2.py:7457-7466 | dsr_common2/imp/DSR_ROBOT2.py:10069-10078 | dsr_common2/imp/DSR_ROBOT2.py:10921-10930 — all 18 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (9 lines × 9) · ×1
  • Duplicated block (9 lines × 9) dsr_common2/imp/DSR_ROBOT2.py:2261 — dsr_common2/imp/DSR_ROBOT2.py:2261-2269 | dsr_common2/imp/DSR_ROBOT2.py:2284-2292 | dsr_common2/imp/DSR_ROBOT2.py:2317-2325 | dsr_common2/imp/DSR_ROBOT2.py:2350-2358 | dsr_common2/imp/DSR_ROBOT2.py:2381-2389 | dsr_common2/imp/DSR_ROBOT2.py:2410-2418 | dsr_common2/imp/DSR_ROBOT2.py:2437-2445 | dsr_common2/imp/DSR_ROBOT2.py:2464-2472 | dsr_common2/imp/DSR_ROBOT2.py:2524-2532 — all 9 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (9 lines × 8) · ×1
  • Duplicated block (9 lines × 8) dsr_common2/imp/DSR_ROBOT2.py:4193 — dsr_common2/imp/DSR_ROBOT2.py:4193-4201 | dsr_common2/imp/DSR_ROBOT2.py:4411-4419 | dsr_common2/imp/DSR_ROBOT2.py:4818-4826 | dsr_common2/imp/DSR_ROBOT2.py:4959-4967 | dsr_common2/imp/DSR_ROBOT2.py:9327-9335 | dsr_common2/imp/DSR_ROBOT2.py:9545-9553 | dsr_common2/imp/DSR_ROBOT2.py:9952-9960 | dsr_common2/imp/DSR_ROBOT2.py:10093-10101 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `dsr_common2/imp/DSR_ROBOT2.py:4420` calls `get_kargs` and `dsr_common2/imp/DSR_ROBOT2.py:4204` 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.
D4 · Code Duplication · Duplicated block (9 lines × 6) · ×1
  • Duplicated block (9 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:43 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:43-51 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:47-55 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:43-51 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:47-55 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:43-51 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:47-55 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:43` 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.
D4 · Code Duplication · Duplicated block (9 lines × 4) · ×1
  • Duplicated block (9 lines × 4) dsr_common2/imp/DSR_ROBOT2.py:1600 — dsr_common2/imp/DSR_ROBOT2.py:1600-1608 | dsr_common2/imp/DSR_ROBOT2.py:1619-1627 | dsr_common2/imp/DSR_ROBOT2.py:1725-1733 | dsr_common2/imp/DSR_ROBOT2.py:1740-1748 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `dsr_common2/imp/DSR_ROBOT2.py:1612` calls `DR_Error` and `dsr_common2/imp/DSR_ROBOT2.py:1736` 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.
D4 · Code Duplication · Duplicated block (8 lines × 10) · ×1
  • Duplicated block (8 lines × 10) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:44 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:44-51 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:44-51 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 310 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (4–6 lines × 29) · ×1
  • Duplicated block (4–6 lines × 29) dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:38 — dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:38-41 | dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:43-48 | dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:42-47 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:39-42 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:46-51 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:42-47 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:39-42 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:46-51 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:42-47 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:39-42 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:46-51 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 310 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. 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, `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:40` calls `LaunchConfiguration`, `perform` and `dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:38` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (5 lines × 6) · ×1
  • Duplicated block (5 lines × 6) dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:78 — dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:78-82 | dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:98-102 | dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:78-82 | dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:98-102 | dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:78-82 | dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:98-102 — before extracting anything, compare `dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py` and `dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 442 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×1
  • Duplicated block (7 lines × 2) dsr_common2/imp/DSR_ROBOT2.py:4926 — dsr_common2/imp/DSR_ROBOT2.py:4926-4932 | dsr_common2/imp/DSR_ROBOT2.py:10060-10066 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (12–13 lines × 2) · ×1
  • Duplicated block (12–13 lines × 2) dsr_example2/dsr_example/dsr_example/demo/slope_demo.py:32 — dsr_example2/dsr_example/dsr_example/demo/slope_demo.py:32-43 | dsr_example2/dsr_example/dsr_example/simple/single_robot_simple.py:42-54 — 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.
D6 · Cohesion (LCOM4) · Low cohesion · ×1
  • Low cohesion: CDsrRobot (LCOM4 93) dsr_common2/imp/DSR_ROBOT2.py:6659 — CDsrRobot's methods fall into 93 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 93 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.
P2 · Observability · No structured logging · ×1
  • No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×1
  • Swallowed exception (caught, then discarded) dsr_bringup2/dsr_bringup2/utils.py:120 — `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.
Minor — 64 finding(s)
D34 · Knowledge Freshness · Orphaned file · ×48
  • Orphaned file dsr_moveit2/dsr_moveit_config_r100_m1509_dual/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_r100_m1509/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_r100_m1013/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_r100_a0509/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_bringup2/launch/dsr_mobile_manipulator_dual_rviz.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_bringup2/launch/dsr_mobile_manipulator_rviz.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_p3020/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_m1509/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_m0617/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_m0609/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_h2017/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_e0509/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_a0912/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_a0509/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_h2515/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_moveit2/dsr_moveit_config_m1013/launch/start.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_common2/imp/DR_common2.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_common2/imp/DR_tcp_server2.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_common2/imp/DR_tcp_client2.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_bringup2/launch/dsr_bringup2_gazebo.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_example2/dsr_visualservoing/launch/dsr_bringup2_visual_servoing_gazebo.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_bringup2/launch/dsr_mobile_manipulator_dual_moveit.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_controller2/launch/dsr_moveit2.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_example2/dsr_visualservoing/dsr_visualservoing/detect_marker_gz.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • Orphaned file dsr_gazebo2/launch/dsr_gazebo.launch.py:1 — No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
  • + 23 more in this group — see findings.md.
D31 · IaC & Container Security · Low IaC · ×6
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Most significant orphaned file · ×3
  • Most significant orphaned file dsr_common2/imp/DRFC.py:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file dsr_moveit2/dsr_moveit_config_r100_a0509_dual/launch/start.launch.py:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
  • Most significant orphaned file dsr_moveit2/dsr_moveit_config_r100_m1013_dual/launch/start.launch.py:1 — One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
D20 · ADR Quality · No ADRs found · ×1
  • No ADRs found dsr_tests/setup.py:25 — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`. ADRs are expected here because `dsr_tests/setup.py` makes this repository a deployable product (line 25).
D34 · Knowledge Freshness · Concentrated knowledge decay · ×1
  • Concentrated knowledge decay — 51 of 63 significant files have no living knowledge, while the repository is still being changed at a low rate (6 commit(s) in the last 90 days) — so this is one repo-wide knowledge-decay state, not 51 separate risks. Counted over 63 of the 85 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. The code moved on without the people who understood these files: document them or schedule a read-through before the next change lands in them.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:7 — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
X10 · Duplicated predicate · Duplicated predicate · ×1
  • Duplicated predicate dsr_common2/imp/DR_tcp_client2.py:257 — `type(timeout) != int and type(timeout) != float` appears character-identically in 3 files — dsr_common2/imp/DR_tcp_client2.py, dsr_common2/imp/DR_tcp_server2.py, dsr_common2/imp/DSR_ROBOT2.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
X7 · Silent fallback defaults · Silent fallback default in catch · ×1
  • Silent fallback default in catch dsr_bringup2/dsr_bringup2/utils.py:120 — `run` (in `show_git_info`) 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.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-705c2056ea9e4dcda6d03d706a337421/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=166" --report-format json --report-path /tmp/watchdog-gitleaks-705c2056ea9e4dcda6d03d706a337421/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-705c2056ea9e4dcda6d03d706a337421/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .15artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesnone (no readable dependency manifest)—none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).0—
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .6artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D37 · Vulnerability-disclosure Policydisclosure—disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesnone (no readable dependency manifest)—none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).0—

Run 01a1e95d-202e-779f-b432-daa2b18571f0 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.

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