Public report of OthmanAdi/planning-with-files, published 4 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.2). 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, 4 November 2026, 07:14 UTC · Survey ID cd_dd3ae2b9bea24a8da9a2d6588f0f7994

OthmanAdi/planning-with-files

Measured 4 November 2026, 07:14 UTC, at code version 0fa6c79

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

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 72out of 100 At risk Up 11 since the last survey

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

A small codebase: 17,597 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 0.4 person-years · Weakest lens: Production Readiness, 67

Findings by how serious they are

33 critical 702 serious 79 minor

21 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
4 November 2026, 07:14 UTC

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

A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.

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

51of 51 dimensions measured by tools.
808of 814 findings point to an exact file and line, so you can open each one in the code. The other 6 concern the repository as a whole, such as missing documentation.
51dimensions across 6 lenses, read from 17,597 lines of product code in 2 projects.
Chapters

Executive summary

OthmanAdi/planning-with-files is rated At risk because critical security findings are open, most of them in the packages it uses. Its score is held back because we found no automated security scanning of the code, its secrets or its dependencies. It scores 72 out of 100, which the At risk rating leaves unchanged.

Production Readiness, at 67, is the weakest lens and counts most in the score. The best first step for the work it takes is fixing the part of the code only one person knows, worth about 3 points. Adding automated security scanning would lift Production Readiness itself, worth about 5 points. Raising Production Readiness to 70 would lift the score to about 74.

Twenty-one known security holes in the packages the code depends on can be used by attackers. Ten pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with, and one pipeline step installs packages that can change without warning. Updating the vulnerable packages, pinning each tool to an exact version and pinning what the pipeline installs would close these risks. The place where the code runs text as code or as a command needs a direct call instead.

The product code is 17,597 lines, about €58,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 67 · counts for 46%Code Health 70 · counts for 25%Maturity 74 · counts for 14%Security and Compliance 90 · counts for 8%Architecture 93 · counts for 4%Performance 100 · counts for 2%

If Production Readiness rose from 67 to 70, the lowest score rated Strong, the score would rise from 72 to about 74.

Code composition: what the lines of code are
Product code 43%Tests 57%
New since the last survey: 72 findings

These 72 critical or serious findings weren't in the previous survey, on 20 October 2026.

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

Fixed since the last survey: 20 findings

These 20 critical or serious findings were in the previous survey, on 20 October 2026, and are gone from this one.

  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Code Duplication · Duplicated block (28 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py
  • Churn × Complexity Hotspots · Repeated repair: .codex/hooks/post_tool_use.py .codex/hooks/post_tool_use.py
  • Churn × Complexity Hotspots · Repeated repair: .codex/hooks/pre_tool_use.py .codex/hooks/pre_tool_use.py
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Rebuild cost: about €58,000 · Estimate
Cost to rebuild€19,000 to €96,000, for 319 to 1,012 hours of work, about 0.4 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×1.1 at a score of 72. 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.
SizeSmall: 17,597 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 1 Off-boarding risk finding(s) in Bus Factor.
Raises the score by about 3 points · Low effort · Bus Factor
2
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.
Raises the score by about 5 points · Medium effort · Security & performance tooling
3
Resolve the 16 FileTooLong finding(s) in God Classes — start with inject-plan.py (15), session-catchup.py.
Raises the score by about 2 points · High effort · God Classes

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.

If you do one thing first · First action
Resolve the 1 Off-boarding risk finding(s) in Bus Factor. Of all the actions in this report, it raises the score most for the work it takes: about 3 points for low effort, because it clears the 1 Bus Factor findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 5.2 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 7% to 16% on every change. The history of the code shows how much it changes: about 142,581 lines over the last 90 days, which is about 578,245 lines a year. At that pace, the extra work comes to an estimated 102.2 to 613.5 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: which parts of the code depend on which

The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.

40 modules, with 1 dependency between them. Every module uses only modules listed above it, so there are no loops.

Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
uses →1 .agents.skills.planning-with-files.scripts2 .agents.skills.planning-with-files.scripts.inject-plan3 .codebuddy.skills.planning-with-files.scripts4 .codebuddy.skills.planning-with-files.scripts.inject-plan5 .codex.hooks6 .codex.skills.planning-with-files.scripts7 .codex.skills.planning-with-files.scripts.inject-plan8 .continue.skills.planning-with-files.scripts9 .cursor.skills.planning-with-files.scripts10 .cursor.skills.planning-with-files.scripts.inject-plan11 .factory.skills.planning-with-files.scripts12 .factory.skills.planning-with-files.scripts.inject-plan13 .gemini.skills.planning-with-files.scripts14 .hermes.plugins15 .hermes.plugins.planning-with-files.session_binding16 .hermes.skills.planning-with-files.scripts17 .kiro.skills.planning-with-files.assets.scripts18 .mastracode.skills.planning-with-files.scripts19 .mastracode.skills.planning-with-files.scripts.inject-plan20 .opencode.skills.planning-with-files.scripts21 .opencode.skills.planning-with-files.scripts.inject-plan22 .pi.skills.planning-with-files.scripts23 .pi.skills.planning-with-files.scripts.inject-plan24 .qoder-plugin25 scripts26 scripts.build-clawhub-upload27 scripts.inject-plan28 skills.i18n.planning-with-files-ar.scripts29 skills.i18n.planning-with-files-ar.scripts.inject-plan30 skills.i18n.planning-with-files-de.scripts31 skills.i18n.planning-with-files-de.scripts.inject-plan32 skills.i18n.planning-with-files-es.scripts33 skills.i18n.planning-with-files-es.scripts.inject-plan34 skills.i18n.planning-with-files-zh.scripts35 skills.i18n.planning-with-files-zh.scripts.inject-plan36 skills.i18n.planning-with-files-zht.scripts37 skills.i18n.planning-with-files-zht.scripts.inject-plan38 skills.planning-with-files.scripts39 skills.planning-with-files.scripts.inject-plan40 .hermes.plugins.planning-with-files
1 .agents.skills.planning-with-files.scripts
2 .agents.skills.planning-with-files.scripts.inject-plan
3 .codebuddy.skills.planning-with-files.scripts
4 .codebuddy.skills.planning-with-files.scripts.inject-plan
5 .codex.hooks
6 .codex.skills.planning-with-files.scripts
7 .codex.skills.planning-with-files.scripts.inject-plan
8 .continue.skills.planning-with-files.scripts
9 .cursor.skills.planning-with-files.scripts
10 .cursor.skills.planning-with-files.scripts.inject-plan
11 .factory.skills.planning-with-files.scripts
12 .factory.skills.planning-with-files.scripts.inject-plan
13 .gemini.skills.planning-with-files.scripts
14 .hermes.plugins
15 .hermes.plugins.planning-with-files.session_binding
16 .hermes.skills.planning-with-files.scripts
17 .kiro.skills.planning-with-files.assets.scripts
18 .mastracode.skills.planning-with-files.scripts
19 .mastracode.skills.planning-with-files.scripts.inject-plan
20 .opencode.skills.planning-with-files.scripts
21 .opencode.skills.planning-with-files.scripts.inject-plan
22 .pi.skills.planning-with-files.scripts
23 .pi.skills.planning-with-files.scripts.inject-plan
24 .qoder-plugin
25 scripts
26 scripts.build-clawhub-upload
27 scripts.inject-plan
28 skills.i18n.planning-with-files-ar.scripts
29 skills.i18n.planning-with-files-ar.scripts.inject-plan
30 skills.i18n.planning-with-files-de.scripts
31 skills.i18n.planning-with-files-de.scripts.inject-plan
32 skills.i18n.planning-with-files-es.scripts
33 skills.i18n.planning-with-files-es.scripts.inject-plan
34 skills.i18n.planning-with-files-zh.scripts
35 skills.i18n.planning-with-files-zh.scripts.inject-plan
36 skills.i18n.planning-with-files-zht.scripts
37 skills.i18n.planning-with-files-zht.scripts.inject-plan
38 skills.planning-with-files.scripts
39 skills.planning-with-files.scripts.inject-plan
40 .hermes.plugins.planning-with-files1
Uses a module listed above itPart of a loopThe module itself
1 .agents.skills.planning-with-files.scripts2 .agents.skills.planning-with-files.scripts.inject-plan3 .codebuddy.skills.planning-with-files.scripts4 .codebuddy.skills.planning-with-files.scripts.inject-plan5 .codex.hooks6 .codex.skills.planning-with-files.scripts7 .codex.skills.planning-with-files.scripts.inject-plan8 .continue.skills.planning-with-files.scripts9 .cursor.skills.planning-with-files.scripts10 .cursor.skills.planning-with-files.scripts.inject-plan11 .factory.skills.planning-with-files.scripts12 .factory.skills.planning-with-files.scripts.inject-plan13 .gemini.skills.planning-with-files.scripts14 .hermes.plugins15 .hermes.plugins.planning-with-files.session_binding16 .hermes.skills.planning-with-files.scripts17 .kiro.skills.planning-with-files.assets.scripts18 .mastracode.skills.planning-with-files.scripts19 .mastracode.skills.planning-with-files.scripts.inject-plan20 .opencode.skills.planning-with-files.scripts21 .opencode.skills.planning-with-files.scripts.inject-plan22 .pi.skills.planning-with-files.scripts23 .pi.skills.planning-with-files.scripts.inject-plan24 .qoder-plugin25 scripts26 scripts.build-clawhub-upload27 scripts.inject-plan28 skills.i18n.planning-with-files-ar.scripts29 skills.i18n.planning-with-files-ar.scripts.inject-plan30 skills.i18n.planning-with-files-de.scripts31 skills.i18n.planning-with-files-de.scripts.inject-plan32 skills.i18n.planning-with-files-es.scripts33 skills.i18n.planning-with-files-es.scripts.inject-plan34 skills.i18n.planning-with-files-zh.scripts35 skills.i18n.planning-with-files-zh.scripts.inject-plan36 skills.i18n.planning-with-files-zht.scripts37 skills.i18n.planning-with-files-zht.scripts.inject-plan38 skills.planning-with-files.scripts39 skills.planning-with-files.scripts.inject-plan40 .hermes.plugins.planning-with-files.agents.skills.planning-with-files.scripts1.agents.skills.planning-with-files.scripts.inject-plan2.codebuddy.skills.planning-with-files.scripts3.codebuddy.skills.planning-with-files.scripts.inject-plan4.codex.hooks5.codex.skills.planning-with-files.scripts6.codex.skills.planning-with-files.scripts.inject-plan7.continue.skills.planning-with-files.scripts8.cursor.skills.planning-with-files.scripts9.cursor.skills.planning-with-files.scripts.inject-plan10.factory.skills.planning-with-files.scripts11.factory.skills.planning-with-files.scripts.inject-plan12.gemini.skills.planning-with-files.scripts13.hermes.plugins14.hermes.plugins.planning-with-files.session_binding15.hermes.skills.planning-with-files.scripts16.kiro.skills.planning-with-files.assets.scripts17.mastracode.skills.planning-with-files.scripts18.mastracode.skills.planning-with-files.scripts.inject-plan19.opencode.skills.planning-with-files.scripts20.opencode.skills.planning-with-files.scripts.inject-plan21.pi.skills.planning-with-files.scripts22.pi.skills.planning-with-files.scripts.inject-plan23.qoder-plugin24scripts25scripts.build-clawhub-upload26scripts.inject-plan27skills.i18n.planning-with-files-ar.scripts28skills.i18n.planning-with-files-ar.scripts.inject-plan29skills.i18n.planning-with-files-de.scripts30skills.i18n.planning-with-files-de.scripts.inject-plan31skills.i18n.planning-with-files-es.scripts32skills.i18n.planning-with-files-es.scripts.inject-plan33skills.i18n.planning-with-files-zh.scripts34skills.i18n.planning-with-files-zh.scripts.inject-plan35skills.i18n.planning-with-files-zht.scripts36skills.i18n.planning-with-files-zht.scripts.inject-plan37skills.planning-with-files.scripts38skills.planning-with-files.scripts.inject-plan39.hermes.plugins.planning-with-files401

At a glance — Code Health · 70% · Adequate · gated by D1, D2 ·

At a glance — Architecture · 93% · Adequate · gated by D26 ·

At a glance — Maturity · 74% · Adequate · gated by D16 ·

At a glance — Readiness · 67% · Adequate · gated by P3 ·

At a glance — Security · 90% · Exemplary ·

At a glance — Performance · 100% · Exemplary ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A03:2025 — Software Supply Chain Failures35High / Critical
A05:2025 — Injection12High / Critical

Roadmap

Top priorities: 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; Resolve the 1 Off-boarding risk finding(s) in Bus Factor; Resolve the 16 FileTooLong finding(s) in God Classes — start with inject-plan.py (15), session-catchup.py.

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

Do thisHelpsEffortDimension
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.+2.5 ptsLowBus Factor
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.+5.0 ptsMediumSecurity & performance tooling
Resolve the 16 FileTooLong finding(s) in God Classes — start with inject-plan.py (15), session-catchup.py.+1.9 ptsHighGod Classes
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.+1.8 ptsMediumArchitecture documentation
Swallowed exception (caught, then discarded)+1.7 ptsMediumException handling
Bring the 15 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with Injector._run (cyclomatic 120), Injector._run (cyclomatic 120), Injector._run (cyclomatic 120).+0.7 ptsHighCyclomatic Complexity
Bring the 33 bodies over 60 down to 60 or less in Cognitive Complexity — start with Injector._run (cognitive 205), Injector._run (cognitive 205), Injector._run (cognitive 205).+0.7 ptsHighCognitive Complexity
Resolve the 28 Members sharing a duplicated core (15 members, 50+ identical tokens) finding(s) in Code Duplication — start with inject-plan.py (21), session-catchup.py (7).+0.3 ptsMediumCode Duplication

File quality

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

FileScoreBandWorst signal
REDACTED0.3SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED0.3SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED1.6SlopDependency Vulnerabilities: Critical CVE: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED5.0MixedStatic Analysis (SAST): High: REDACTED
.agents/skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
.codebuddy/skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
.codex/skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
.cursor/skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
.factory/skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
.mastracode/skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
.opencode/skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
.pi/skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
skills/i18n/planning-with-files-ar/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
skills/i18n/planning-with-files-de/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
skills/i18n/planning-with-files-es/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
skills/i18n/planning-with-files-zh/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
skills/i18n/planning-with-files-zht/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)
skills/planning-with-files/scripts/inject-plan.py7.0MixedCyclomatic Complexity: Injector._run (cyclomatic 120)

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

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

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

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

Could not be resolved — 21

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 51 evaluated dimensions are computed by tools and static analysis; no language model sets or judges any of them. Overall confidence is 0.8, the weighted average across measured dimensions.

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

What we checked — 51 dimensions across the health lenses
D1D2D3D4D5D6D9D11D13D15D16D17D19D26D27D28D29D30D34D35D37D43AX10AX3AX4AX8M1M2M3M4P1P3P6PF3X1X12X13X14X15X17X19X21X22X23X24X25X26X27X28X3X30

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, 808 of 814 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
  2. Is there a tool behind the number? Every score below names the method that produced it: Roslyn, git or a scanner, not a narrative.
  3. Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1a568-59a3-7207-899a-0cdbe984d9f8.

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.

  • 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. No dependency manifest this pass reads for hygiene (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)) was found in this repository, so no package was assessed. Zero packages read is NOT a clean dependency tree, so this is NOT SCORED — a gap in the analyzer, not a verdict about this repository. This row is about dependency HYGIENE — outdated, deprecated or unmaintained direct dependencies; known CVEs in the same dependency graph are a separate question, reported under D30 wherever the manifest is OSV-readable.
  • D14 License Compliance — 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 — no dependency manifest this pass reads for licence data (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)) was found in this repository, so it declares no third-party dependency closure to grade. A gap in the analyzer, NOT a finding that this repository's licences are compliant: a manifest in an ecosystem outside that list, or third-party code copied into the tree, is not read — so this dimension asserts nothing about this repository's licensing in either direction.
  • 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. D21's deterministic naming rules are gated on C# first (docs/plans/deterministic-engine.md, P5): each other language is switched on only after its own concept suite and A/B gate pass. Until then its declarations carry no naming verdict this run — this says nothing about whether its names are consistent.
  • D22 Internal API Consistency — not measured this run — 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 an ADMISSION gap, not an environment fault: it declares a published package (.opencode/packages/opencode-planning-with-files/package.json), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict.
  • 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.
  • D32 Data Compliance (PII/GDPR) — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. `.opencode/packages/opencode-planning-with-files/src/index.ts`, `.pi/skills/planning-with-files/extensions/planning-with-files/plan.ts` produced a parse error, so every rule in this engine's `gdpr.yml` was absent there. That absence is NOT a clean result: these rules detect personal data crossing a boundary into a log sink, a URL or browser storage, and a file that was never parsed cannot report any of the three. The rest of the tree analysed normally and its rows above stand; only these files are unaccounted for. You can widen what we reach: fix the syntax error (or exclude the file deliberately) and re-scan to cover it.
  • D44 Platform End-of-Life — 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 dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
  • AX6 Interface segregation — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing 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.
  • 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.
  • C3 Audit Trail — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'sqlite3' is imported (skills/planning-with-files/scripts/session-catchup.py:538), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • C4 Data Retention — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'sqlite3' is imported (skills/planning-with-files/scripts/session-catchup.py:538), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • C5 Data-Subject Rights — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. 'sqlite3' is imported (skills/planning-with-files/scripts/session-catchup.py:538), but no entity, schema, table or model declaration this check reads was found beside it, so whether personal data is stored could not be decided.
  • 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 and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's 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.
  • 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 and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's 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.
  • 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.
  • 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 and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, 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.
  • 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 and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP 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 and Kotlin 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.
  • 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 and Rust source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP make no call through a named logger, 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, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's 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.
  • X7 Silent fallback defaults — 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. 54 further occurrence(s) are not listed individually; the score already reflects all 94.

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.
  • D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
  • D11 Test Reliability: Flakiness is inferred from history/markers — we run the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
  • 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").
  • 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.
  • 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.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • 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.
  • 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

175 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was Injector._run at 120.

Injector._run (cyclomatic 120) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:948
inject-plan.smart_plan_extract (cyclomatic 37) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:653
inject-plan.secure_progress_marker (cyclomatic 32) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:524
inject-plan.resolve_plan_dir (cyclomatic 28) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:1492
inject-plan.pretool_cache (cyclomatic 27) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:808

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

What to do

  1. Bring the 15 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with Injector._run (cyclomatic 120), Injector._run (cyclomatic 120), Injector._run (cyclomatic 120). — 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 15 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.
  2. Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D2 · Cognitive 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

274 method(s) exceeded the cognitive complexity threshold of 15; the worst was Injector._run at 205.

Injector._run (cognitive 205) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:948
inject-plan.smart_plan_extract (cognitive 59) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:653
inject-plan.resolve_plan_dir (cognitive 54) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:1492
inject-plan.secure_progress_marker (cognitive 44) · ×15.agents/skills/planning-with-files/scripts/inject-plan.py:524
session-catchup.find_last_planning_update (cognitive 43) · ×15.agents/skills/planning-with-files/scripts/session-catchup.py:733

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

What to do

  1. Bring the 33 bodies over 60 down to 60 or less in Cognitive Complexity — start with Injector._run (cognitive 205), Injector._run (cognitive 205), Injector._run (cognitive 205). — 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 33 together lifts Cognitive 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.
  2. Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D3 · God Classes5.9 / 10Adequate✓ 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 5.9 / 10 · rule-coverage 100% · ceiling Prevented

16 over-large unit(s) detected — types, modules or files that carry too much.

FileTooLong: scripts/inject-plan.py · ×16.agents/skills/planning-with-files/scripts/inject-plan.py

What to do

  1. Resolve the 16 FileTooLong finding(s) in God Classes — start with inject-plan.py (15), session-catchup.py. — One of this dimension's main actionable groups (16 warning-level).
  2. Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.

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

D4 · Code Duplication6.7 / 10Adequate✓ Tool-verified

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

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

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

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

Members sharing a duplicated core (15 members, 50+ identical tokens) · ×28.agents/skills/planning-with-files/scripts/inject-plan.py:184
Duplicated block (15 lines × 15) · ×7.agents/skills/planning-with-files/scripts/inject-plan.py:907
Duplicated block (7 lines × 15) · ×5.agents/skills/planning-with-files/scripts/session-catchup.py:787
Duplicated block (5 lines × 15) · ×5.agents/skills/planning-with-files/scripts/inject-plan.py:214
Members sharing a duplicated core (18 members, 50+ identical tokens) · ×4.agents/skills/planning-with-files/scripts/session-catchup.py:148

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

What to do

  1. Resolve the 28 Members sharing a duplicated core (15 members, 50+ identical tokens) finding(s) in Code Duplication — start with inject-plan.py (21), session-catchup.py (7). — One of this dimension's main actionable groups (28 warning-level).
  2. Resolve the 7 Duplicated block (15 lines × 15) finding(s) in Code Duplication — start with inject-plan.py (5), session-catchup.py (2). — One of this dimension's main actionable groups (7 warning-level).
  3. Resolve the 5 Duplicated block (7 lines × 15) finding(s) in Code Duplication — start with inject-plan.py (3), session-catchup.py (2). — One of this dimension's main actionable groups (5 warning-level).
  4. Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.

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

D5 · 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

2 production modules (source-import), 0 dependency cycle(s), 0 unstable depended-on module(s). No manifest declares this repository's modules, so the modules are its top-level source directories and the edges the imports between them; 0 module(s) off the main sequence.

✓ On the Gold path — maintain.

Detailed fixes: d5_recommendation.md.

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

0 of 30 classes have LCOM4 above 3.

✓ On the Gold path — maintain.

Detailed fixes: d6_recommendation.md.

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

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

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

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

1147 test methods: 1129 unit, 18 integration, 0 BDD, 0 e2e. The Python suite contributes 1147 test function(s) across 103 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.

✓ On the Gold path — maintain.

Detailed fixes: d9_recommendation.md.

D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified

What it measures: Whether the tests pass reliably, with no flakiness.

Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.

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

0 flaky across 2 measured tier(s). JavaScript/TypeScript (vitest via `npm ci --ignore-scripts` in .dsh/packages/dsh-planning-with-files/ (50 tests); vitest via `npm ci --ignore-scripts` in .opencode/packages/opencode-planning-with-files/ (63 tests); vitest via `npm ci --ignore-scripts` in .pi/skills/planning-with-files/extensions/planning-with-files/ (95 tests)): measured (0 flaky); Python (repository root, 103 test files): measured (0 flaky).

✓ On the Gold path — maintain.

Detailed fixes: d11_recommendation.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.

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

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

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

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

Top hotspots: .agents/skills/planning-with-files/scripts/inject-plan.py (6×120=720); .codebuddy/skills/planning-with-files/scripts/inject-plan.py (6×120=720); .codex/skills/planning-with-files/scripts/inject-plan.py (6×120=720) Repeated repair below the complexity floor: .dsh/packages/dsh-planning-with-files/src/index.ts (4 of 4 changes were fixes); .opencode/packages/opencode-planning-with-files/src/index.ts (4 of 4 changes were fixes); .codex/hooks/run_sh.py (3 of 3 changes were fixes)

Hotspot: .agents/skills/planning-with-files/scripts/inject-plan.py · ×23.agents/skills/planning-with-files/scripts/inject-plan.py:948
Repeated repair: .dsh/packages/dsh-planning-with-files/src/index.ts · ×3.dsh/packages/dsh-planning-with-files/src/index.ts:221

What to do

  1. Resolve the 23 Hotspot finding(s) in Churn × Complexity Hotspots — start with inject-plan.py (15), session-catchup.py (3), paths.py. — One of this dimension's main actionable groups (23 warning-level).
  2. Resolve the 3 Repeated repair finding(s) in Churn × Complexity Hotspots — start with index.ts (2), run_sh.py. — One of this dimension's main actionable groups (3 warning-level).

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

D16 · Bus Factor3.9 / 10Weak✓ 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 3.9 / 10 · rule-coverage 100% · ceiling Documented

11 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is skills/planning-with-files/scripts/inject-plan.py.

Off-boarding risk: anonymized user #1

What to do

  1. Resolve the 1 Off-boarding risk finding(s) in Bus Factor. — One of this dimension's main actionable groups (1 recommendation-level).

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d17_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D26 · Project Cohesion0.0 / 10Critical✓ 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 0.0 / 10 · rule-coverage 100% · ceiling Documented

1 of 1 build units (checkout) flagged as possibly oversized/incoherent.

Projects may be oversized for their cohesion

What to do

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

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

D27 · Navigability10.0 / 10Exemplary✓ Tool-verified

What it measures: How far you must trace to follow a call — low indirection and co-located slices read easier.

Method: Call indirection (interface hops, cross-namespace calls, slice-locality scaled) over a sampled set of method invocations, size-aware baseline. Sampled; confidence discounted by symbol-resolution gaps. C# also names each pass-through layer (a class whose every public method only forwards its own parameters to one collaborator) as a located finding; the score is not affected.

Coverage: Slice locality from the first namespace segments, SAMPLED (≤400 methods) — not exhaustive.

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

79 % of calls cross a namespace and 0 % go through an interface, but 100 % of collaborators are co-located — so a call's collaborators sit together and tracing stays easy. Baseline: small — navigation cost is tolerated.

✓ On the Gold path — maintain.

Detailed fixes: d27_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)7.1 / 10Adequategated by 12 critical findings✓ 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 7.1 / 10 · rule-coverage 100% · ceiling Documented

12 finding(s): 0 critical, 12 high, 0 medium, 0 low. 10 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 102 file(s) — `.agents/skills/planning-with-files/scripts/attest-plan.sh` (line 56), `.agents/skills/planning-with-files/scripts/inject-plan.sh`, `.agents/skills/planning-with-files/scripts/plan-doctor.sh` (line 179), `.agents/skills/planning-with-files/scripts/resolve-plan-dir.sh` (line 43, line 125), `.agents/skills/planning-with-files/scripts/set-active-plan.sh` (lines 9–759), … (+97 more) — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.

REDACTED
REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  2. Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
  3. No action in Static Analysis (SAST) — all 10 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 (10 issue-level, 0 of them charged here).

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

D30 · Dependency Vulnerabilities0.0 / 10Critical✓ Tool-verified

What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.

Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05. Advisory since rubric-2026.11.2 (CAI decision 0006): every row is a match against a vulnerability database that changes daily, so the reading is shown and never moves a scored dimension, lens or the headline.

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

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

REDACTED
REDACTED
REDACTED
REDACTED

What to do

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

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

D34 · Knowledge Freshness10.0 / 10Exemplary✓ Tool-verified

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

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

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

Every significant source file has living knowledge — recently and meaningfully worked.

✓ On the Gold path — maintain.

Detailed fixes: d34_recommendation.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.

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

What it measures: Whether the repository publishes a coordinated-vulnerability-disclosure policy (SECURITY.md or security.txt) with a reporting contact, so finders know how to report a vulnerability. Presence of a policy file with a contact, not whether the policy is adequate or honoured.

Method: Vulnerability-disclosure policy read deterministically from the repo: a SECURITY.md (root/.github/docs) or .well-known/security.txt / security.txt, regex-checked for a reporting contact (email / URL / mailto). Present + contact → 10; present without a contact → 4; NotApplicable when no policy file exists (it may live off-repo). Detects the policy file's presence + contact, not its adequacy.

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

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

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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.

What to do

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

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

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

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

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

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

AX8 · Test isolation10.0 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether production projects stay free of references to test projects — tests may depend on production, never the reverse.

Method: Csproj graph: each production project checked for references to test projects (identified by test-framework presence, not name). Zero violations is clean. Deterministic.

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

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

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

What to do

  • Add a README to the 1 of 5 project(s) that lack one — worth up to 0.4 pts.
M2 · Architecture documentation5.0 / 10Adequate✓ 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 structure8.0 / 10Strong✓ Tool-verified

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

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

  • Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.

What to do

  • Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
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.

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 5315 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:8
  • `.dsh/packages/dsh-planning-with-files/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — .dsh/packages/dsh-planning-with-files/package.json:62

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.
  • Enable Dependabot/Renovate or a dependency-review gate.
  • Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
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.

PF3 · Async & latency hygiene10.0 / 10Exemplary✓ Tool-verified

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

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

X1 · Async correctness10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.

Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.

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

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

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

X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.

Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.

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

Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.

Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.

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

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

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

X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged

Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.

Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.

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

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

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

X21 · Side-effecting pattern guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.

Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.

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

Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back. Also whether a `finally` that gives the primitive back unconditionally can run in a state where the method does not hold it: after a timed wait whose result was discarded, after an acquire inside the `try` that can fail, after the body already released it, or never, because a `return` left between the acquire and the `try`.

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

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

Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.

Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.

X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged

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

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

X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.

Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.

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

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

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

X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.

Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.

X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.

Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.

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

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

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

  • `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. (×7) — skills/planning-with-files/scripts/inject-plan.py:1771, skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1771, skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1771, …
  • An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×10) — skills/planning-with-files/scripts/inject-plan.py:1776, skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1776, skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1776, …
  • `except` 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. — scripts/session-catchup.py:319

What to do

  • Swallowed exception (caught, then discarded)
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.

Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.

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 Health70%Adequate — gated by D1, D2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture93%Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity74%Adequate — gated by D16Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness67%Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security90%ExemplarySolid.
Performance100%ExemplaryStrongest area.
Unscored — 4 check(s) recorded observations but carry no score

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

  • SC1 Supply-chain hygiene — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X6 Hand-rolled structured-format parsing — 7 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 40 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 5 control(s) we could not find positive evidence for

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

  • C3 Audit Trail — Not assessed: this repository stores data through 'sqlite3' (skills/planning-with-files/scripts/session-catchup.py:538) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and MongoEngine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether its changes need an audit trail could not be established, and the trail's absence is not scored.
  • C4 Data Retention — Not assessed: this repository stores data through 'sqlite3' (skills/planning-with-files/scripts/session-catchup.py:538) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, SQL schemas). Personal data may be written through raw SQL or a hosted backend, so whether a retention limit applies here could not be established, and its absence is not scored.
  • C5 Data-Subject Rights — Not assessed: this repository stores data through 'sqlite3' (skills/planning-with-files/scripts/session-catchup.py:538) but declares no persisted model this check reads (Django, SQLAlchemy, SQLModel, Peewee, Tortoise and mongoengine model fields, Alembic and Django migration columns, CREATE TABLE and ALTER TABLE … ADD columns in SQL files). Personal data may be written through raw SQL or a hosted backend, so whether data-subject rights apply here could not be established, and their absence is not scored.
  • P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
  • P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 60 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.
  • AC7 A11y enforcement — 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 — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • 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.
  • D10 Test Quality — ~23771 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 — Dependency hygiene not measured — no supported dependency manifest was read
  • D14 License Compliance — No dependency manifest found — no declared dependency closure to grade for licences
  • 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.
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D21 Naming Consistency — Naming consistency is measured on C# and TypeScript only; Python, html not measured.
  • 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
  • D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
  • D32 Data Compliance (PII/GDPR) — 2 file(s) were not parsed by semgrep — the PII/GDPR ruleset never ran over them
  • D36 Supply-chain Provenance & Signing — The CI pipeline builds and tests but publishes no released artifact — no package publish, container push, GitHub release or deployment step. Supply-chain provenance, signing and SBOM attest RELEASED artifacts, so there is nothing to attest here. Add them to the release pipeline when this repo starts shipping artifacts (a published package, a container image, a deployed service or a tagged release). 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.
  • D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
  • D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
  • D8 Code Coverage — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — .dsh/packages/dsh-planning-with-files/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (1 value object(s))
  • 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 and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
  • P2 Observability — Observability was not assessed: this check reads a source model that does not carry this repository's product — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of a logging idiom this check recognises is NOT evidence that this repo lacks structured logging (it may log through its own ecosystem's logger). This is a gap in the analyzer, not a finding about this repository.
  • 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 — no coverage report found on disk — produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
  • 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 applicable: Python runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
  • 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.
  • 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
  • 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
  • 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.
  • 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
  • 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
  • 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 — 33 finding(s)
D30 · Dependency Vulnerabilities · High CVE · ×15
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · Critical CVE · ×6
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
Serious — 702 finding(s)
D4 · Code Duplication · Members sharing a duplicated core (15 members, 50+ identical tokens) · ×28
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:184 — .agents/skills/planning-with-files/scripts/inject-plan.py:184-202 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:184-202 | .codex/skills/planning-with-files/scripts/inject-plan.py:184-202 | .cursor/skills/planning-with-files/scripts/inject-plan.py:184-202 | .factory/skills/planning-with-files/scripts/inject-plan.py:184-202 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:184-202 | .opencode/skills/planning-with-files/scripts/inject-plan.py:184-202 | .pi/skills/planning-with-files/scripts/inject-plan.py:184-202 | scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:184-202 | skills/planning-with-files/scripts/inject-plan.py:184-202 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:265 — .agents/skills/planning-with-files/scripts/inject-plan.py:265-274 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:265-274 | .codex/skills/planning-with-files/scripts/inject-plan.py:265-274 | .cursor/skills/planning-with-files/scripts/inject-plan.py:265-274 | .factory/skills/planning-with-files/scripts/inject-plan.py:265-274 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:265-274 | .opencode/skills/planning-with-files/scripts/inject-plan.py:265-274 | .pi/skills/planning-with-files/scripts/inject-plan.py:265-274 | scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:265-274 | skills/planning-with-files/scripts/inject-plan.py:265-274 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:278 — .agents/skills/planning-with-files/scripts/inject-plan.py:278-297 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:278-297 | .codex/skills/planning-with-files/scripts/inject-plan.py:278-297 | .cursor/skills/planning-with-files/scripts/inject-plan.py:278-297 | .factory/skills/planning-with-files/scripts/inject-plan.py:278-297 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:278-297 | .opencode/skills/planning-with-files/scripts/inject-plan.py:278-297 | .pi/skills/planning-with-files/scripts/inject-plan.py:278-297 | scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:278-297 | skills/planning-with-files/scripts/inject-plan.py:278-297 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:324 — .agents/skills/planning-with-files/scripts/inject-plan.py:324-333 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:324-333 | .codex/skills/planning-with-files/scripts/inject-plan.py:324-333 | .cursor/skills/planning-with-files/scripts/inject-plan.py:324-333 | .factory/skills/planning-with-files/scripts/inject-plan.py:324-333 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:324-333 | .opencode/skills/planning-with-files/scripts/inject-plan.py:324-333 | .pi/skills/planning-with-files/scripts/inject-plan.py:324-333 | scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:324-333 | skills/planning-with-files/scripts/inject-plan.py:324-333 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:434 — .agents/skills/planning-with-files/scripts/inject-plan.py:434-521 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:434-521 | .codex/skills/planning-with-files/scripts/inject-plan.py:434-521 | .cursor/skills/planning-with-files/scripts/inject-plan.py:434-521 | .factory/skills/planning-with-files/scripts/inject-plan.py:434-521 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:434-521 | .opencode/skills/planning-with-files/scripts/inject-plan.py:434-521 | .pi/skills/planning-with-files/scripts/inject-plan.py:434-521 | scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:434-521 | skills/planning-with-files/scripts/inject-plan.py:434-521 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:525 — .agents/skills/planning-with-files/scripts/inject-plan.py:525-646 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:525-646 | .codex/skills/planning-with-files/scripts/inject-plan.py:525-646 | .cursor/skills/planning-with-files/scripts/inject-plan.py:525-646 | .factory/skills/planning-with-files/scripts/inject-plan.py:525-646 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:525-646 | .opencode/skills/planning-with-files/scripts/inject-plan.py:525-646 | .pi/skills/planning-with-files/scripts/inject-plan.py:525-646 | scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:525-646 | skills/planning-with-files/scripts/inject-plan.py:525-646 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:654 — .agents/skills/planning-with-files/scripts/inject-plan.py:654-752 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:654-752 | .codex/skills/planning-with-files/scripts/inject-plan.py:654-752 | .cursor/skills/planning-with-files/scripts/inject-plan.py:654-752 | .factory/skills/planning-with-files/scripts/inject-plan.py:654-752 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:654-752 | .opencode/skills/planning-with-files/scripts/inject-plan.py:654-752 | .pi/skills/planning-with-files/scripts/inject-plan.py:654-752 | scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:654-752 | skills/planning-with-files/scripts/inject-plan.py:654-752 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:778 — .agents/skills/planning-with-files/scripts/inject-plan.py:778-805 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:778-805 | .codex/skills/planning-with-files/scripts/inject-plan.py:778-805 | .cursor/skills/planning-with-files/scripts/inject-plan.py:778-805 | .factory/skills/planning-with-files/scripts/inject-plan.py:778-805 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:778-805 | .opencode/skills/planning-with-files/scripts/inject-plan.py:778-805 | .pi/skills/planning-with-files/scripts/inject-plan.py:778-805 | scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:778-805 | skills/planning-with-files/scripts/inject-plan.py:778-805 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:907 — .agents/skills/planning-with-files/scripts/inject-plan.py:907-921 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:907-921 | .codex/skills/planning-with-files/scripts/inject-plan.py:907-921 | .cursor/skills/planning-with-files/scripts/inject-plan.py:907-921 | .factory/skills/planning-with-files/scripts/inject-plan.py:907-921 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:907-921 | .opencode/skills/planning-with-files/scripts/inject-plan.py:907-921 | .pi/skills/planning-with-files/scripts/inject-plan.py:907-921 | scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:907-921 | skills/planning-with-files/scripts/inject-plan.py:907-921 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:928 — .agents/skills/planning-with-files/scripts/inject-plan.py:928-939 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:928-939 | .codex/skills/planning-with-files/scripts/inject-plan.py:928-939 | .cursor/skills/planning-with-files/scripts/inject-plan.py:928-939 | .factory/skills/planning-with-files/scripts/inject-plan.py:928-939 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:928-939 | .opencode/skills/planning-with-files/scripts/inject-plan.py:928-939 | .pi/skills/planning-with-files/scripts/inject-plan.py:928-939 | scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:928-939 | skills/planning-with-files/scripts/inject-plan.py:928-939 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:949 — .agents/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .codex/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .cursor/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .factory/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .opencode/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .pi/skills/planning-with-files/scripts/inject-plan.py:949-1366 | scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:949-1366 | skills/planning-with-files/scripts/inject-plan.py:949-1366 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1378 — .agents/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .codex/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .factory/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .pi/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1378-1425 | skills/planning-with-files/scripts/inject-plan.py:1378-1425 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1445 — .agents/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .codex/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .factory/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .pi/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1445-1459 | skills/planning-with-files/scripts/inject-plan.py:1445-1459 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1471 — .agents/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .codex/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .factory/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .pi/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1471-1489 | skills/planning-with-files/scripts/inject-plan.py:1471-1489 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1493 — .agents/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .codex/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .factory/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .pi/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1493-1570 | skills/planning-with-files/scripts/inject-plan.py:1493-1570 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1606 — .agents/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .codex/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .factory/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .pi/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1606-1616 | skills/planning-with-files/scripts/inject-plan.py:1606-1616 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1619 — .agents/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .codex/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .factory/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .pi/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1619-1630 | skills/planning-with-files/scripts/inject-plan.py:1619-1630 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1656 — .agents/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .codex/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .factory/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .pi/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1656-1670 | skills/planning-with-files/scripts/inject-plan.py:1656-1670 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1673 — .agents/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .codex/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .factory/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .pi/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1673-1700 | skills/planning-with-files/scripts/inject-plan.py:1673-1700 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1703 — .agents/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .codex/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .factory/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .pi/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1703-1723 | skills/planning-with-files/scripts/inject-plan.py:1703-1723 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/inject-plan.py:1742 — .agents/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .codex/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .factory/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .pi/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1742-1778 | skills/planning-with-files/scripts/inject-plan.py:1742-1778 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:76 — .agents/skills/planning-with-files/scripts/session-catchup.py:76-98 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:76-98 | .codex/skills/planning-with-files/scripts/session-catchup.py:76-98 | .continue/skills/planning-with-files/scripts/session-catchup.py:76-98 | .cursor/skills/planning-with-files/scripts/session-catchup.py:76-98 | .factory/skills/planning-with-files/scripts/session-catchup.py:76-98 | .gemini/skills/planning-with-files/scripts/session-catchup.py:76-98 | .opencode/skills/planning-with-files/scripts/session-catchup.py:52-74 | .pi/skills/planning-with-files/scripts/session-catchup.py:76-98 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:73-95 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:74-96 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:77-99 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:75-97 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:74-96 | skills/planning-with-files/scripts/session-catchup.py:76-98 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:122 — .agents/skills/planning-with-files/scripts/session-catchup.py:122-144 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:122-144 | .codex/skills/planning-with-files/scripts/session-catchup.py:122-144 | .continue/skills/planning-with-files/scripts/session-catchup.py:122-144 | .cursor/skills/planning-with-files/scripts/session-catchup.py:122-144 | .factory/skills/planning-with-files/scripts/session-catchup.py:122-144 | .gemini/skills/planning-with-files/scripts/session-catchup.py:122-144 | .opencode/skills/planning-with-files/scripts/session-catchup.py:98-120 | .pi/skills/planning-with-files/scripts/session-catchup.py:122-144 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:119-141 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:120-142 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:123-145 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:121-143 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:120-142 | skills/planning-with-files/scripts/session-catchup.py:122-144 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:194 — .agents/skills/planning-with-files/scripts/session-catchup.py:194-208 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:194-208 | .codex/skills/planning-with-files/scripts/session-catchup.py:194-208 | .continue/skills/planning-with-files/scripts/session-catchup.py:194-208 | .cursor/skills/planning-with-files/scripts/session-catchup.py:194-208 | .factory/skills/planning-with-files/scripts/session-catchup.py:194-208 | .gemini/skills/planning-with-files/scripts/session-catchup.py:194-208 | .opencode/skills/planning-with-files/scripts/session-catchup.py:170-184 | .pi/skills/planning-with-files/scripts/session-catchup.py:194-208 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:191-205 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:192-206 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:195-209 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:193-207 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:192-206 | skills/planning-with-files/scripts/session-catchup.py:194-208 — These 15 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 15 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 15 times.
  • Members sharing a duplicated core (15 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:327 — .agents/skills/planning-with-files/scripts/session-catchup.py:327-338 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:327-338 | .codex/skills/planning-with-files/scripts/session-catchup.py:327-338 | .continue/skills/planning-with-files/scripts/session-catchup.py:327-338 | .cursor/skills/planning-with-files/scripts/session-catchup.py:327-338 | .factory/skills/planning-with-files/scripts/session-catchup.py:327-338 | .gemini/skills/planning-with-files/scripts/session-catchup.py:327-338 | .opencode/skills/planning-with-files/scripts/session-catchup.py:303-314 | .pi/skills/planning-with-files/scripts/session-catchup.py:327-338 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:323-334 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:325-336 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:328-339 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:324-335 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:323-334 | skills/planning-with-files/scripts/session-catchup.py:327-338 — These 15 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 15 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 15 times.
  • + 3 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Hotspot · ×23
  • Hotspot: .agents/skills/planning-with-files/scripts/inject-plan.py .agents/skills/planning-with-files/scripts/inject-plan.py:948 — .agents/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .agents/skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .codebuddy/skills/planning-with-files/scripts/inject-plan.py .codebuddy/skills/planning-with-files/scripts/inject-plan.py:948 — .codebuddy/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .codebuddy/skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .codex/skills/planning-with-files/scripts/inject-plan.py .codex/skills/planning-with-files/scripts/inject-plan.py:948 — .codex/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .codex/skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .cursor/skills/planning-with-files/scripts/inject-plan.py .cursor/skills/planning-with-files/scripts/inject-plan.py:948 — .cursor/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .cursor/skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .factory/skills/planning-with-files/scripts/inject-plan.py .factory/skills/planning-with-files/scripts/inject-plan.py:948 — .factory/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .factory/skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .mastracode/skills/planning-with-files/scripts/inject-plan.py .mastracode/skills/planning-with-files/scripts/inject-plan.py:948 — .mastracode/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .mastracode/skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .opencode/skills/planning-with-files/scripts/inject-plan.py .opencode/skills/planning-with-files/scripts/inject-plan.py:948 — .opencode/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .opencode/skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .pi/skills/planning-with-files/scripts/inject-plan.py .pi/skills/planning-with-files/scripts/inject-plan.py:948 — .pi/skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .pi/skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: scripts/inject-plan.py scripts/inject-plan.py:948 — scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: skills/i18n/planning-with-files-ar/scripts/inject-plan.py skills/i18n/planning-with-files-ar/scripts/inject-plan.py:948 — skills/i18n/planning-with-files-ar/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. 5 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- skills/i18n/planning-with-files-ar/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: skills/i18n/planning-with-files-de/scripts/inject-plan.py skills/i18n/planning-with-files-de/scripts/inject-plan.py:948 — skills/i18n/planning-with-files-de/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- skills/i18n/planning-with-files-de/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: skills/i18n/planning-with-files-es/scripts/inject-plan.py skills/i18n/planning-with-files-es/scripts/inject-plan.py:948 — skills/i18n/planning-with-files-es/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- skills/i18n/planning-with-files-es/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: skills/i18n/planning-with-files-zh/scripts/inject-plan.py skills/i18n/planning-with-files-zh/scripts/inject-plan.py:948 — skills/i18n/planning-with-files-zh/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- skills/i18n/planning-with-files-zh/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: skills/i18n/planning-with-files-zht/scripts/inject-plan.py skills/i18n/planning-with-files-zht/scripts/inject-plan.py:948 — skills/i18n/planning-with-files-zht/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- skills/i18n/planning-with-files-zht/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: skills/planning-with-files/scripts/inject-plan.py skills/planning-with-files/scripts/inject-plan.py:948 — skills/planning-with-files/scripts/inject-plan.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 120 in Injector._run at line 948. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- skills/planning-with-files/scripts/inject-plan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .hermes/plugins/planning-with-files/paths.py .hermes/plugins/planning-with-files/paths.py:300 — .hermes/plugins/planning-with-files/paths.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in paths.resolve_plan at line 300. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .hermes/plugins/planning-with-files/paths.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: scripts/session-catchup.py scripts/session-catchup.py:541 — scripts/session-catchup.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 30 in session-catchup.opencode_catchup at line 541. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- scripts/session-catchup.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .opencode/packages/opencode-planning-with-files/src/core.ts .opencode/packages/opencode-planning-with-files/src/core.ts:256 — .opencode/packages/opencode-planning-with-files/src/core.ts changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in resolvePlan at line 256. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .opencode/packages/opencode-planning-with-files/src/core.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .pi/skills/planning-with-files/extensions/planning-with-files/runtime.ts .pi/skills/planning-with-files/extensions/planning-with-files/runtime.ts:669 — .pi/skills/planning-with-files/extensions/planning-with-files/runtime.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in (anonymous) at line 669. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .pi/skills/planning-with-files/extensions/planning-with-files/runtime.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .hermes/skills/planning-with-files/scripts/session-catchup.py .hermes/skills/planning-with-files/scripts/session-catchup.py:476 — .hermes/skills/planning-with-files/scripts/session-catchup.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in session-catchup.main at line 476. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .hermes/skills/planning-with-files/scripts/session-catchup.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .hermes/plugins/planning-with-files/__init__.py .hermes/plugins/planning-with-files/__init__.py:78 — .hermes/plugins/planning-with-files/__init__.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in planning-with-files.pwf_command at line 78. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .hermes/plugins/planning-with-files/__init__.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .mastracode/skills/planning-with-files/scripts/session-catchup.py .mastracode/skills/planning-with-files/scripts/session-catchup.py:386 — .mastracode/skills/planning-with-files/scripts/session-catchup.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in session-catchup.main at line 386. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .mastracode/skills/planning-with-files/scripts/session-catchup.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: .pi/skills/planning-with-files/extensions/planning-with-files/plan.ts .pi/skills/planning-with-files/extensions/planning-with-files/plan.ts:176 — .pi/skills/planning-with-files/extensions/planning-with-files/plan.ts changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in resolvePlanPaths at line 176. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .pi/skills/planning-with-files/extensions/planning-with-files/plan.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D3 · God Classes · FileTooLong · ×16
  • FileTooLong: scripts/inject-plan.py .agents/skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py .codebuddy/skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py .codex/skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py .cursor/skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py .factory/skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py .mastracode/skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py .opencode/skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py .pi/skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py skills/i18n/planning-with-files-ar/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py skills/i18n/planning-with-files-de/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py skills/i18n/planning-with-files-es/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py skills/i18n/planning-with-files-zh/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py skills/i18n/planning-with-files-zht/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/inject-plan.py skills/planning-with-files/scripts/inject-plan.py — FileTooLong — 1400 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 900 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: scripts/session-catchup.py scripts/session-catchup.py — FileTooLong — 532 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 32 over it, 1.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D1 · Cyclomatic Complexity · Injector._run (cyclomatic 120) · ×15
  • Injector._run (cyclomatic 120) .agents/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) .codex/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) .cursor/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) .factory/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) .mastracode/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) .opencode/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) .pi/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) skills/i18n/planning-with-files-de/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) skills/i18n/planning-with-files-es/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector._run (cyclomatic 120) skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cyclomatic complexity 120 (threshold 15). To reduce it, separate the cases: extract each independent 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 · inject-plan.smart_plan_extract (cyclomatic 37) · ×15
  • inject-plan.smart_plan_extract (cyclomatic 37) .agents/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) .codex/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) .cursor/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) .factory/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) .mastracode/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) .opencode/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) .pi/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) skills/i18n/planning-with-files-de/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) skills/i18n/planning-with-files-es/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.smart_plan_extract (cyclomatic 37) skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cyclomatic complexity 37 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · inject-plan.secure_progress_marker (cyclomatic 32) · ×15
  • inject-plan.secure_progress_marker (cyclomatic 32) .agents/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) .codex/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) .cursor/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) .factory/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) .mastracode/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) .opencode/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) .pi/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) skills/i18n/planning-with-files-de/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) skills/i18n/planning-with-files-es/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.secure_progress_marker (cyclomatic 32) skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · inject-plan.resolve_plan_dir (cyclomatic 28) · ×15
  • inject-plan.resolve_plan_dir (cyclomatic 28) .agents/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) .codex/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) .cursor/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) .factory/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) .mastracode/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) .opencode/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) .pi/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) skills/i18n/planning-with-files-de/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) skills/i18n/planning-with-files-es/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.resolve_plan_dir (cyclomatic 28) skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · inject-plan.pretool_cache (cyclomatic 27) · ×15
  • inject-plan.pretool_cache (cyclomatic 27) .agents/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) .codex/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) .cursor/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) .factory/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) .mastracode/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) .opencode/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) .pi/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) skills/i18n/planning-with-files-de/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) skills/i18n/planning-with-files-es/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:808 — inject-plan.pretool_cache 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.
  • inject-plan.pretool_cache (cyclomatic 27) skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · inject-plan.safe_snapshot (cyclomatic 23) · ×15
  • inject-plan.safe_snapshot (cyclomatic 23) .agents/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) .codex/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) .cursor/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) .factory/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) .mastracode/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) .opencode/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) .pi/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) skills/i18n/planning-with-files-de/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) skills/i18n/planning-with-files-es/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.safe_snapshot (cyclomatic 23) skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Injector.prepare_ledger_snapshot (cyclomatic 16) · ×15
  • Injector.prepare_ledger_snapshot (cyclomatic 16) .agents/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) .codex/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) .cursor/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) .factory/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) .mastracode/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) .opencode/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) .pi/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) skills/i18n/planning-with-files-de/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) skills/i18n/planning-with-files-es/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • Injector.prepare_ledger_snapshot (cyclomatic 16) skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · inject-plan.main (cyclomatic 16) · ×15
  • inject-plan.main (cyclomatic 16) .agents/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) .codex/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) .cursor/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) .factory/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) .mastracode/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) .opencode/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) .pi/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) skills/i18n/planning-with-files-de/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) skills/i18n/planning-with-files-es/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • inject-plan.main (cyclomatic 16) skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D2 · Cognitive Complexity · Injector._run (cognitive 205) · ×15
  • Injector._run (cognitive 205) .agents/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) .codex/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) .cursor/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) .factory/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) .mastracode/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) .opencode/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) .pi/skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) skills/i18n/planning-with-files-de/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) skills/i18n/planning-with-files-es/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector._run (cognitive 205) skills/planning-with-files/scripts/inject-plan.py:948 — Injector._run has cognitive complexity 205 (threshold 15). Drivers by points: if/else 90 (154 pts), boolean chains 15, ternaries 7 (14 pts), error handling 8 (13 pts), loops 4 (9 pts) (nesting depth added 81). To reduce it, split the body into named stages: move each independent 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 · inject-plan.smart_plan_extract (cognitive 59) · ×15
  • inject-plan.smart_plan_extract (cognitive 59) .agents/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) .codex/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) .cursor/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) .factory/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) .mastracode/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) .opencode/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) .pi/skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) skills/i18n/planning-with-files-de/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) skills/i18n/planning-with-files-es/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.smart_plan_extract (cognitive 59) skills/planning-with-files/scripts/inject-plan.py:653 — inject-plan.smart_plan_extract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 23 (45 pts), boolean chains 10, loops 2 (3 pts), ternaries 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · inject-plan.resolve_plan_dir (cognitive 54) · ×15
  • inject-plan.resolve_plan_dir (cognitive 54) .agents/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) .codex/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) .cursor/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) .factory/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) .mastracode/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) .opencode/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) .pi/skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) skills/i18n/planning-with-files-de/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) skills/i18n/planning-with-files-es/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.resolve_plan_dir (cognitive 54) skills/planning-with-files/scripts/inject-plan.py:1492 — inject-plan.resolve_plan_dir has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (43 pts), error handling 2 (4 pts), boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · inject-plan.secure_progress_marker (cognitive 44) · ×15
  • inject-plan.secure_progress_marker (cognitive 44) .agents/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) .codex/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) .cursor/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) .factory/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) .mastracode/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) .opencode/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) .pi/skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) skills/i18n/planning-with-files-de/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) skills/i18n/planning-with-files-es/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.secure_progress_marker (cognitive 44) skills/planning-with-files/scripts/inject-plan.py:524 — inject-plan.secure_progress_marker has cognitive complexity 44 (threshold 15). Drivers by points: if/else 20 (28 pts), error handling 4 (7 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup.find_last_planning_update (cognitive 43) · ×15
  • session-catchup.find_last_planning_update (cognitive 43) .agents/skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) .codex/skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) .continue/skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) .cursor/skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) .factory/skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) .gemini/skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) .opencode/skills/planning-with-files/scripts/session-catchup.py:658 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) .pi/skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) skills/i18n/planning-with-files-ar/scripts/session-catchup.py:444 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) skills/i18n/planning-with-files-de/scripts/session-catchup.py:446 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) skills/i18n/planning-with-files-es/scripts/session-catchup.py:449 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:714 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) skills/i18n/planning-with-files-zht/scripts/session-catchup.py:444 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.find_last_planning_update (cognitive 43) skills/planning-with-files/scripts/session-catchup.py:733 — session-catchup.find_last_planning_update has cognitive complexity 43 (threshold 15). Drivers by points: if/else 9 (38 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · inject-plan.safe_snapshot (cognitive 34) · ×15
  • inject-plan.safe_snapshot (cognitive 34) .agents/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) .codex/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) .cursor/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) .factory/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) .mastracode/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) .opencode/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) .pi/skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) skills/i18n/planning-with-files-de/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) skills/i18n/planning-with-files-es/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.safe_snapshot (cognitive 34) skills/planning-with-files/scripts/inject-plan.py:349 — inject-plan.safe_snapshot has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · inject-plan.pretool_cache (cognitive 31) · ×15
  • inject-plan.pretool_cache (cognitive 31) .agents/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) .codex/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) .cursor/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) .factory/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) .mastracode/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) .opencode/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) .pi/skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) skills/i18n/planning-with-files-de/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) skills/i18n/planning-with-files-es/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
  • inject-plan.pretool_cache (cognitive 31) skills/planning-with-files/scripts/inject-plan.py:808 — inject-plan.pretool_cache has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (18 pts), boolean chains 8, error handling 2 (3 pts), loops 1, ternaries 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.
D2 · Cognitive Complexity · Injector.prepare_ledger_snapshot (cognitive 23) · ×15
  • Injector.prepare_ledger_snapshot (cognitive 23) .agents/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) .codex/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) .cursor/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) .factory/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) .mastracode/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) .opencode/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) .pi/skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) skills/i18n/planning-with-files-de/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) skills/i18n/planning-with-files-es/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • Injector.prepare_ledger_snapshot (cognitive 23) skills/planning-with-files/scripts/inject-plan.py:1377 — Injector.prepare_ledger_snapshot has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (17 pts), error handling 3, boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · inject-plan.main (cognitive 22) · ×15
  • inject-plan.main (cognitive 22) .agents/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) .codex/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) .cursor/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) .factory/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) .mastracode/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) .opencode/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) .pi/skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) skills/i18n/planning-with-files-de/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) skills/i18n/planning-with-files-es/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.main (cognitive 22) skills/planning-with-files/scripts/inject-plan.py:1741 — inject-plan.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 5, error handling 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup.get_claude_project_dir (cognitive 18) · ×15
  • session-catchup.get_claude_project_dir (cognitive 18) .agents/skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) .codex/skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) .continue/skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) .cursor/skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) .factory/skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) .gemini/skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) .opencode/skills/planning-with-files/scripts/session-catchup.py:123 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) .pi/skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) skills/i18n/planning-with-files-ar/scripts/session-catchup.py:144 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) skills/i18n/planning-with-files-de/scripts/session-catchup.py:145 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) skills/i18n/planning-with-files-es/scripts/session-catchup.py:148 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:146 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) skills/i18n/planning-with-files-zht/scripts/session-catchup.py:145 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.get_claude_project_dir (cognitive 18) skills/planning-with-files/scripts/session-catchup.py:147 — session-catchup.get_claude_project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 4 (5 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · inject-plan.session_attached (cognitive 17) · ×15
  • inject-plan.session_attached (cognitive 17) .agents/skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) .codebuddy/skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) .codex/skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) .cursor/skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) .factory/skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) .mastracode/skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) .opencode/skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) .pi/skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) skills/i18n/planning-with-files-de/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) skills/i18n/planning-with-files-es/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • inject-plan.session_attached (cognitive 17) skills/planning-with-files/scripts/inject-plan.py:433 — inject-plan.session_attached has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 4, loops 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup._newest_session_cwd_matches (cognitive 17) · ×15
  • session-catchup._newest_session_cwd_matches (cognitive 17) .agents/skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) .codex/skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) .continue/skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) .cursor/skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) .factory/skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) .gemini/skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) .opencode/skills/planning-with-files/scripts/session-catchup.py:97 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) .pi/skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) skills/i18n/planning-with-files-ar/scripts/session-catchup.py:118 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) skills/i18n/planning-with-files-de/scripts/session-catchup.py:119 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) skills/i18n/planning-with-files-es/scripts/session-catchup.py:122 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:120 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) skills/i18n/planning-with-files-zht/scripts/session-catchup.py:119 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup._newest_session_cwd_matches (cognitive 17) skills/planning-with-files/scripts/session-catchup.py:121 — session-catchup._newest_session_cwd_matches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 2 (5 pts), loops 2 (3 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D1 · Cyclomatic Complexity · session-catchup.opencode_catchup (cyclomatic 29) · ×11
  • session-catchup.opencode_catchup (cyclomatic 29) .agents/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) .codex/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) .continue/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) .cursor/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) .factory/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) .gemini/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) .opencode/skills/planning-with-files/scripts/session-catchup.py:453 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) .pi/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:519 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.opencode_catchup (cyclomatic 29) skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · session-catchup.main (cyclomatic 16) · ×11
  • session-catchup.main (cyclomatic 16) .agents/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) .codex/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) .continue/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) .cursor/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) .factory/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) .gemini/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) .opencode/skills/planning-with-files/scripts/session-catchup.py:815 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) .pi/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:898 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 16) skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D2 · Cognitive Complexity · session-catchup.opencode_catchup (cognitive 47) · ×11
  • session-catchup.opencode_catchup (cognitive 47) .agents/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) .codex/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) .continue/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) .cursor/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) .factory/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) .gemini/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) .opencode/skills/planning-with-files/scripts/session-catchup.py:453 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) .pi/skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:519 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.opencode_catchup (cognitive 47) skills/planning-with-files/scripts/session-catchup.py:528 — session-catchup.opencode_catchup has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (25 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup.main (cognitive 22) · ×11
  • session-catchup.main (cognitive 22) .agents/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) .codex/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) .continue/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) .cursor/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) .factory/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) .gemini/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) .opencode/skills/planning-with-files/scripts/session-catchup.py:815 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) .pi/skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:898 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 22) skills/planning-with-files/scripts/session-catchup.py:924 — session-catchup.main has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (18 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup._format_opencode_part (cognitive 21) · ×11
  • session-catchup._format_opencode_part (cognitive 21) .agents/skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) .codex/skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) .continue/skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) .cursor/skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) .factory/skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) .gemini/skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) .pi/skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) scripts/session-catchup.py:483 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:460 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
  • session-catchup._format_opencode_part (cognitive 21) skills/planning-with-files/scripts/session-catchup.py:469 — session-catchup._format_opencode_part has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 4 (8 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.
D30 · Dependency Vulnerabilities · Medium CVE · ×11
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D1 · Cyclomatic Complexity · session-catchup.extract_messages_after (cyclomatic 31) · ×10
  • session-catchup.extract_messages_after (cyclomatic 31) .agents/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) .codex/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) .continue/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) .cursor/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) .factory/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) .gemini/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) .pi/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:810 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 31) skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cyclomatic complexity 31 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D2 · Cognitive Complexity · session-catchup.extract_messages_after (cognitive 82) · ×10
  • session-catchup.extract_messages_after (cognitive 82) .agents/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) .codex/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) .continue/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) .cursor/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) .factory/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) .gemini/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) .pi/skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:810 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
  • session-catchup.extract_messages_after (cognitive 82) skills/planning-with-files/scripts/session-catchup.py:834 — session-catchup.extract_messages_after has cognitive complexity 82 (threshold 15). Drivers by points: if/else 17 (63 pts), ternaries 2 (10 pts), loops 2 (5 pts), boolean chains 4 (nesting depth added 57). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · session-catchup.collect_claude_tool_results (cognitive 17) · ×10
  • session-catchup.collect_claude_tool_results (cognitive 17) .agents/skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) .codebuddy/skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) .codex/skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) .continue/skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) .cursor/skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) .factory/skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) .gemini/skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) .pi/skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) skills/i18n/planning-with-files-zh/scripts/session-catchup.py:787 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.collect_claude_tool_results (cognitive 17) skills/planning-with-files/scripts/session-catchup.py:806 — session-catchup.collect_claude_tool_results has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
X3 · Exception handling · Swallowed exception (empty catch) · ×10
  • Swallowed exception (empty catch) skills/planning-with-files/scripts/inject-plan.py:1776 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1776 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1776 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) skills/i18n/planning-with-files-es/scripts/inject-plan.py:1776 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) skills/i18n/planning-with-files-de/scripts/inject-plan.py:1776 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1776 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) scripts/inject-plan.py:1776 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) scripts/session-catchup.py:321 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) scripts/session-catchup.py:363 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
  • Swallowed exception (empty catch) scripts/session-catchup.py:447 — An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×8
  • Swallowed exception (caught, then discarded) skills/planning-with-files/scripts/inject-plan.py:1771 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1771 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1771 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) skills/i18n/planning-with-files-es/scripts/inject-plan.py:1771 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) skills/i18n/planning-with-files-de/scripts/inject-plan.py:1771 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1771 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) scripts/inject-plan.py:1771 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) scripts/session-catchup.py:319 — `except` 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.
D4 · Code Duplication · Duplicated block (15 lines × 15) · ×7
  • Duplicated block (15 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:907 — .agents/skills/planning-with-files/scripts/inject-plan.py:907-921 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:907-921 | .codex/skills/planning-with-files/scripts/inject-plan.py:907-921 | .cursor/skills/planning-with-files/scripts/inject-plan.py:907-921 | .factory/skills/planning-with-files/scripts/inject-plan.py:907-921 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:907-921 | .opencode/skills/planning-with-files/scripts/inject-plan.py:907-921 | .pi/skills/planning-with-files/scripts/inject-plan.py:907-921 | scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:907-921 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:907-921 | skills/planning-with-files/scripts/inject-plan.py:907-921 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (15 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1445 — .agents/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .codex/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .factory/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | .pi/skills/planning-with-files/scripts/inject-plan.py:1445-1459 | scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1445-1459 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1445-1459 | skills/planning-with-files/scripts/inject-plan.py:1445-1459 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (15 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1656 — .agents/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .codex/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .factory/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | .pi/skills/planning-with-files/scripts/inject-plan.py:1656-1670 | scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1656-1670 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1656-1670 | skills/planning-with-files/scripts/inject-plan.py:1656-1670 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (15 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:194 — .agents/skills/planning-with-files/scripts/session-catchup.py:194-208 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:194-208 | .codex/skills/planning-with-files/scripts/session-catchup.py:194-208 | .continue/skills/planning-with-files/scripts/session-catchup.py:194-208 | .cursor/skills/planning-with-files/scripts/session-catchup.py:194-208 | .factory/skills/planning-with-files/scripts/session-catchup.py:194-208 | .gemini/skills/planning-with-files/scripts/session-catchup.py:194-208 | .opencode/skills/planning-with-files/scripts/session-catchup.py:170-184 | .pi/skills/planning-with-files/scripts/session-catchup.py:194-208 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:191-205 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:192-206 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:195-209 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:193-207 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:192-206 | skills/planning-with-files/scripts/session-catchup.py:194-208 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (15 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:372 — .agents/skills/planning-with-files/scripts/session-catchup.py:372-386 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:372-386 | .codex/skills/planning-with-files/scripts/session-catchup.py:372-386 | .continue/skills/planning-with-files/scripts/session-catchup.py:372-386 | .cursor/skills/planning-with-files/scripts/session-catchup.py:372-386 | .factory/skills/planning-with-files/scripts/session-catchup.py:372-386 | .gemini/skills/planning-with-files/scripts/session-catchup.py:372-386 | .opencode/skills/planning-with-files/scripts/session-catchup.py:348-362 | .pi/skills/planning-with-files/scripts/session-catchup.py:372-386 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:368-382 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:370-384 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:373-387 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:369-383 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:368-382 | skills/planning-with-files/scripts/session-catchup.py:372-386 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (15 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:133 — .agents/skills/planning-with-files/scripts/inject-plan.py:133-147 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:133-147 | .codex/skills/planning-with-files/scripts/inject-plan.py:133-147 | .cursor/skills/planning-with-files/scripts/inject-plan.py:133-147 | .factory/skills/planning-with-files/scripts/inject-plan.py:133-147 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:133-147 | .opencode/skills/planning-with-files/scripts/inject-plan.py:133-147 | .pi/skills/planning-with-files/scripts/inject-plan.py:133-147 | scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:133-147 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:133-147 | skills/planning-with-files/scripts/inject-plan.py:133-147 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (15 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:760 — .agents/skills/planning-with-files/scripts/inject-plan.py:760-774 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:760-774 | .codex/skills/planning-with-files/scripts/inject-plan.py:760-774 | .cursor/skills/planning-with-files/scripts/inject-plan.py:760-774 | .factory/skills/planning-with-files/scripts/inject-plan.py:760-774 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:760-774 | .opencode/skills/planning-with-files/scripts/inject-plan.py:760-774 | .pi/skills/planning-with-files/scripts/inject-plan.py:760-774 | scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:760-774 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:760-774 | skills/planning-with-files/scripts/inject-plan.py:760-774 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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.
D1 · Cyclomatic Complexity · session-catchup.extract_messages_after (cyclomatic 30) · ×5
  • session-catchup.extract_messages_after (cyclomatic 30) .opencode/skills/planning-with-files/scripts/session-catchup.py:731 — session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 30) skills/i18n/planning-with-files-ar/scripts/session-catchup.py:517 — session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 30) skills/i18n/planning-with-files-de/scripts/session-catchup.py:548 — session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 30) skills/i18n/planning-with-files-es/scripts/session-catchup.py:522 — session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_after (cyclomatic 30) skills/i18n/planning-with-files-zht/scripts/session-catchup.py:546 — session-catchup.extract_messages_after has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D2 · Cognitive Complexity · session-catchup.extract_messages_after (cognitive 76) · ×5
  • session-catchup.extract_messages_after (cognitive 76) .opencode/skills/planning-with-files/scripts/session-catchup.py:731 — session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). 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.
  • session-catchup.extract_messages_after (cognitive 76) skills/i18n/planning-with-files-ar/scripts/session-catchup.py:517 — session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). 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.
  • session-catchup.extract_messages_after (cognitive 76) skills/i18n/planning-with-files-de/scripts/session-catchup.py:548 — session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). 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.
  • session-catchup.extract_messages_after (cognitive 76) skills/i18n/planning-with-files-es/scripts/session-catchup.py:522 — session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). 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.
  • session-catchup.extract_messages_after (cognitive 76) skills/i18n/planning-with-files-zht/scripts/session-catchup.py:546 — session-catchup.extract_messages_after has cognitive complexity 76 (threshold 15). Drivers by points: if/else 17 (63 pts), loops 2 (5 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 52). 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.
D4 · Code Duplication · Duplicated block (7 lines × 15) · ×5
  • Duplicated block (7 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:787 — .agents/skills/planning-with-files/scripts/session-catchup.py:787-793 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:787-793 | .codex/skills/planning-with-files/scripts/session-catchup.py:787-793 | .continue/skills/planning-with-files/scripts/session-catchup.py:787-793 | .cursor/skills/planning-with-files/scripts/session-catchup.py:787-793 | .factory/skills/planning-with-files/scripts/session-catchup.py:787-793 | .gemini/skills/planning-with-files/scripts/session-catchup.py:787-793 | .opencode/skills/planning-with-files/scripts/session-catchup.py:712-718 | .pi/skills/planning-with-files/scripts/session-catchup.py:787-793 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:498-504 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:500-506 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:503-509 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:768-774 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:498-504 | skills/planning-with-files/scripts/session-catchup.py:787-793 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (7 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:301 — .agents/skills/planning-with-files/scripts/inject-plan.py:301-307 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:301-307 | .codex/skills/planning-with-files/scripts/inject-plan.py:301-307 | .cursor/skills/planning-with-files/scripts/inject-plan.py:301-307 | .factory/skills/planning-with-files/scripts/inject-plan.py:301-307 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:301-307 | .opencode/skills/planning-with-files/scripts/inject-plan.py:301-307 | .pi/skills/planning-with-files/scripts/inject-plan.py:301-307 | scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:301-307 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:301-307 | skills/planning-with-files/scripts/inject-plan.py:301-307 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (7 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1369 — .agents/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .codex/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .factory/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | .pi/skills/planning-with-files/scripts/inject-plan.py:1369-1375 | scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1369-1375 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1369-1375 | skills/planning-with-files/scripts/inject-plan.py:1369-1375 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (7 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1578 — .agents/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .codex/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .factory/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | .pi/skills/planning-with-files/scripts/inject-plan.py:1578-1584 | scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1578-1584 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1578-1584 | skills/planning-with-files/scripts/inject-plan.py:1578-1584 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (7 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:797 — .agents/skills/planning-with-files/scripts/session-catchup.py:797-803 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:797-803 | .codex/skills/planning-with-files/scripts/session-catchup.py:797-803 | .continue/skills/planning-with-files/scripts/session-catchup.py:797-803 | .cursor/skills/planning-with-files/scripts/session-catchup.py:797-803 | .factory/skills/planning-with-files/scripts/session-catchup.py:797-803 | .gemini/skills/planning-with-files/scripts/session-catchup.py:797-803 | .opencode/skills/planning-with-files/scripts/session-catchup.py:722-728 | .pi/skills/planning-with-files/scripts/session-catchup.py:797-803 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:508-514 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:510-516 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:513-519 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:778-784 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:508-514 | skills/planning-with-files/scripts/session-catchup.py:797-803 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (5 lines × 15) · ×5
  • Duplicated block (5 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:214 — .agents/skills/planning-with-files/scripts/inject-plan.py:214-218 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:214-218 | .codex/skills/planning-with-files/scripts/inject-plan.py:214-218 | .cursor/skills/planning-with-files/scripts/inject-plan.py:214-218 | .factory/skills/planning-with-files/scripts/inject-plan.py:214-218 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:214-218 | .opencode/skills/planning-with-files/scripts/inject-plan.py:214-218 | .pi/skills/planning-with-files/scripts/inject-plan.py:214-218 | scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:214-218 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:214-218 | skills/planning-with-files/scripts/inject-plan.py:214-218 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (5 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:68 — .agents/skills/planning-with-files/scripts/session-catchup.py:68-72 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:68-72 | .codex/skills/planning-with-files/scripts/session-catchup.py:68-72 | .continue/skills/planning-with-files/scripts/session-catchup.py:68-72 | .cursor/skills/planning-with-files/scripts/session-catchup.py:68-72 | .factory/skills/planning-with-files/scripts/session-catchup.py:68-72 | .gemini/skills/planning-with-files/scripts/session-catchup.py:68-72 | .opencode/skills/planning-with-files/scripts/session-catchup.py:44-48 | .pi/skills/planning-with-files/scripts/session-catchup.py:68-72 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:65-69 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:66-70 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:69-73 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:67-71 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:66-70 | skills/planning-with-files/scripts/session-catchup.py:68-72 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (5 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:212 — .agents/skills/planning-with-files/scripts/session-catchup.py:212-216 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:212-216 | .codex/skills/planning-with-files/scripts/session-catchup.py:212-216 | .continue/skills/planning-with-files/scripts/session-catchup.py:212-216 | .cursor/skills/planning-with-files/scripts/session-catchup.py:212-216 | .factory/skills/planning-with-files/scripts/session-catchup.py:212-216 | .gemini/skills/planning-with-files/scripts/session-catchup.py:212-216 | .opencode/skills/planning-with-files/scripts/session-catchup.py:188-192 | .pi/skills/planning-with-files/scripts/session-catchup.py:212-216 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:209-213 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:210-214 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:213-217 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:211-215 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:210-214 | skills/planning-with-files/scripts/session-catchup.py:212-216 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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.
  • Duplicated block (5 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:718 — .agents/skills/planning-with-files/scripts/session-catchup.py:718-722 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:718-722 | .codex/skills/planning-with-files/scripts/session-catchup.py:718-722 | .continue/skills/planning-with-files/scripts/session-catchup.py:718-722 | .cursor/skills/planning-with-files/scripts/session-catchup.py:718-722 | .factory/skills/planning-with-files/scripts/session-catchup.py:718-722 | .gemini/skills/planning-with-files/scripts/session-catchup.py:718-722 | .opencode/skills/planning-with-files/scripts/session-catchup.py:643-647 | .pi/skills/planning-with-files/scripts/session-catchup.py:718-722 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:429-433 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:431-435 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:434-438 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:699-703 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:429-433 | skills/planning-with-files/scripts/session-catchup.py:718-722 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (5 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:726 — .agents/skills/planning-with-files/scripts/session-catchup.py:726-730 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:726-730 | .codex/skills/planning-with-files/scripts/session-catchup.py:726-730 | .continue/skills/planning-with-files/scripts/session-catchup.py:726-730 | .cursor/skills/planning-with-files/scripts/session-catchup.py:726-730 | .factory/skills/planning-with-files/scripts/session-catchup.py:726-730 | .gemini/skills/planning-with-files/scripts/session-catchup.py:726-730 | .opencode/skills/planning-with-files/scripts/session-catchup.py:651-655 | .pi/skills/planning-with-files/scripts/session-catchup.py:726-730 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:437-441 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:439-443 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:442-446 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:707-711 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:437-441 | skills/planning-with-files/scripts/session-catchup.py:726-730 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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.
D2 · Cognitive Complexity · session-catchup.main (cognitive 21) · ×4
  • session-catchup.main (cognitive 21) skills/i18n/planning-with-files-ar/scripts/session-catchup.py:630 — session-catchup.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 21) skills/i18n/planning-with-files-de/scripts/session-catchup.py:632 — session-catchup.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 21) skills/i18n/planning-with-files-es/scripts/session-catchup.py:638 — session-catchup.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 21) skills/i18n/planning-with-files-zht/scripts/session-catchup.py:630 — session-catchup.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2, boolean chains 1, ternaries 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication · Members sharing a duplicated core (18 members, 50+ identical tokens) · ×4
  • Members sharing a duplicated core (18 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:148 — .agents/skills/planning-with-files/scripts/session-catchup.py:148-183 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:148-183 | .codex/skills/planning-with-files/scripts/session-catchup.py:148-183 | .continue/skills/planning-with-files/scripts/session-catchup.py:148-183 | .cursor/skills/planning-with-files/scripts/session-catchup.py:148-183 | .factory/skills/planning-with-files/scripts/session-catchup.py:148-183 | .gemini/skills/planning-with-files/scripts/session-catchup.py:148-183 | .hermes/skills/planning-with-files/scripts/session-catchup.py:93-110 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:66-83 | .opencode/skills/planning-with-files/scripts/session-catchup.py:124-159 | .pi/skills/planning-with-files/scripts/session-catchup.py:148-183 | scripts/session-catchup.py:99-116 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:145-180 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:146-181 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:149-184 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:147-182 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:146-181 | skills/planning-with-files/scripts/session-catchup.py:148-183 — 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.
  • Members sharing a duplicated core (18 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:220 — .agents/skills/planning-with-files/scripts/session-catchup.py:220-238 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:220-238 | .codex/skills/planning-with-files/scripts/session-catchup.py:220-238 | .continue/skills/planning-with-files/scripts/session-catchup.py:220-238 | .cursor/skills/planning-with-files/scripts/session-catchup.py:220-238 | .factory/skills/planning-with-files/scripts/session-catchup.py:220-238 | .gemini/skills/planning-with-files/scripts/session-catchup.py:220-238 | .hermes/skills/planning-with-files/scripts/session-catchup.py:193-211 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:161-179 | .opencode/skills/planning-with-files/scripts/session-catchup.py:196-214 | .pi/skills/planning-with-files/scripts/session-catchup.py:220-238 | scripts/session-catchup.py:199-217 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:217-235 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:218-236 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:221-239 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:219-237 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:218-236 | skills/planning-with-files/scripts/session-catchup.py:220-238 — 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.
  • Members sharing a duplicated core (18 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:242 — .agents/skills/planning-with-files/scripts/session-catchup.py:242-247 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:242-247 | .codex/skills/planning-with-files/scripts/session-catchup.py:242-247 | .continue/skills/planning-with-files/scripts/session-catchup.py:242-247 | .cursor/skills/planning-with-files/scripts/session-catchup.py:242-247 | .factory/skills/planning-with-files/scripts/session-catchup.py:242-247 | .gemini/skills/planning-with-files/scripts/session-catchup.py:242-247 | .hermes/skills/planning-with-files/scripts/session-catchup.py:215-220 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:183-188 | .opencode/skills/planning-with-files/scripts/session-catchup.py:218-223 | .pi/skills/planning-with-files/scripts/session-catchup.py:242-247 | scripts/session-catchup.py:221-226 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:239-244 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:240-245 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:243-248 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:241-246 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:240-245 | skills/planning-with-files/scripts/session-catchup.py:242-247 — 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.
  • Members sharing a duplicated core (18 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:509 — .agents/skills/planning-with-files/scripts/session-catchup.py:509-525 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:509-525 | .codex/skills/planning-with-files/scripts/session-catchup.py:509-525 | .continue/skills/planning-with-files/scripts/session-catchup.py:509-525 | .cursor/skills/planning-with-files/scripts/session-catchup.py:509-525 | .factory/skills/planning-with-files/scripts/session-catchup.py:509-525 | .gemini/skills/planning-with-files/scripts/session-catchup.py:509-525 | .hermes/skills/planning-with-files/scripts/session-catchup.py:243-259 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:211-227 | .opencode/skills/planning-with-files/scripts/session-catchup.py:434-450 | .pi/skills/planning-with-files/scripts/session-catchup.py:509-525 | scripts/session-catchup.py:522-538 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:611-627 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:529-545 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:619-635 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:500-516 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:527-543 | skills/planning-with-files/scripts/session-catchup.py:509-525 — 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 · Duplicated block (10 lines × 15) · ×4
  • Duplicated block (10 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:265 — .agents/skills/planning-with-files/scripts/inject-plan.py:265-274 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:265-274 | .codex/skills/planning-with-files/scripts/inject-plan.py:265-274 | .cursor/skills/planning-with-files/scripts/inject-plan.py:265-274 | .factory/skills/planning-with-files/scripts/inject-plan.py:265-274 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:265-274 | .opencode/skills/planning-with-files/scripts/inject-plan.py:265-274 | .pi/skills/planning-with-files/scripts/inject-plan.py:265-274 | scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:265-274 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:265-274 | skills/planning-with-files/scripts/inject-plan.py:265-274 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (10 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:324 — .agents/skills/planning-with-files/scripts/inject-plan.py:324-333 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:324-333 | .codex/skills/planning-with-files/scripts/inject-plan.py:324-333 | .cursor/skills/planning-with-files/scripts/inject-plan.py:324-333 | .factory/skills/planning-with-files/scripts/inject-plan.py:324-333 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:324-333 | .opencode/skills/planning-with-files/scripts/inject-plan.py:324-333 | .pi/skills/planning-with-files/scripts/inject-plan.py:324-333 | scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:324-333 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:324-333 | skills/planning-with-files/scripts/inject-plan.py:324-333 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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.
  • Duplicated block (10 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1432 — .agents/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .codex/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .factory/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | .pi/skills/planning-with-files/scripts/inject-plan.py:1432-1441 | scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1432-1441 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1432-1441 | skills/planning-with-files/scripts/inject-plan.py:1432-1441 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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.
  • Duplicated block (10 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1633 — .agents/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .codex/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .factory/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | .pi/skills/planning-with-files/scripts/inject-plan.py:1633-1642 | scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1633-1642 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1633-1642 | skills/planning-with-files/scripts/inject-plan.py:1633-1642 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (8 lines × 15) · ×4
  • Duplicated block (8 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:164 — .agents/skills/planning-with-files/scripts/inject-plan.py:164-171 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:164-171 | .codex/skills/planning-with-files/scripts/inject-plan.py:164-171 | .cursor/skills/planning-with-files/scripts/inject-plan.py:164-171 | .factory/skills/planning-with-files/scripts/inject-plan.py:164-171 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:164-171 | .opencode/skills/planning-with-files/scripts/inject-plan.py:164-171 | .pi/skills/planning-with-files/scripts/inject-plan.py:164-171 | scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:164-171 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:164-171 | skills/planning-with-files/scripts/inject-plan.py:164-171 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:254 — .agents/skills/planning-with-files/scripts/inject-plan.py:254-261 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:254-261 | .codex/skills/planning-with-files/scripts/inject-plan.py:254-261 | .cursor/skills/planning-with-files/scripts/inject-plan.py:254-261 | .factory/skills/planning-with-files/scripts/inject-plan.py:254-261 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:254-261 | .opencode/skills/planning-with-files/scripts/inject-plan.py:254-261 | .pi/skills/planning-with-files/scripts/inject-plan.py:254-261 | scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:254-261 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:254-261 | skills/planning-with-files/scripts/inject-plan.py:254-261 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1731 — .agents/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .codex/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .factory/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | .pi/skills/planning-with-files/scripts/inject-plan.py:1731-1738 | scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1731-1738 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1731-1738 | skills/planning-with-files/scripts/inject-plan.py:1731-1738 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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.
  • Duplicated block (8 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:347 — .agents/skills/planning-with-files/scripts/session-catchup.py:347-354 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:347-354 | .codex/skills/planning-with-files/scripts/session-catchup.py:347-354 | .continue/skills/planning-with-files/scripts/session-catchup.py:347-354 | .cursor/skills/planning-with-files/scripts/session-catchup.py:347-354 | .factory/skills/planning-with-files/scripts/session-catchup.py:347-354 | .gemini/skills/planning-with-files/scripts/session-catchup.py:347-354 | .opencode/skills/planning-with-files/scripts/session-catchup.py:323-330 | .pi/skills/planning-with-files/scripts/session-catchup.py:347-354 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:343-350 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:345-352 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:348-355 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:344-351 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:343-350 | skills/planning-with-files/scripts/session-catchup.py:347-354 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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.
D15 · Churn × Complexity Hotspots · Repeated repair · ×3
  • Repeated repair: .dsh/packages/dsh-planning-with-files/src/index.ts .dsh/packages/dsh-planning-with-files/src/index.ts:221 — .dsh/packages/dsh-planning-with-files/src/index.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 13 (its worst body is (anonymous) at line 221), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(dsh): report selector requirement in status”; “fix(dsh): stamp the V4 producer-owned source kind on injected messages”; “fix(dsh): re-inject the plan after compaction from the compaction/end session event”; “fix(plugins): require PLAN_ID when several named plans exist, in the shared OpenCode and DSH core”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .dsh/packages/dsh-planning-with-files/src/index.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: .opencode/packages/opencode-planning-with-files/src/index.ts .opencode/packages/opencode-planning-with-files/src/index.ts:155 — .opencode/packages/opencode-planning-with-files/src/index.ts changed 4 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is event at line 155), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix(opencode): support v2 plugin registration and session lifecycle”; “fix(plugins): require PLAN_ID when several named plans exist, in the shared OpenCode and DSH core”; “fix: bind explicit plan selectors, floor slug modes on the project root, and classify doctor output on the data frame”; “fix(opencode, hermes): second-model review fixes for the plan resolvers and the OpenCode plugin”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .opencode/packages/opencode-planning-with-files/src/index.ts`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Repeated repair: .codex/hooks/run_sh.py .codex/hooks/run_sh.py:23 — .codex/hooks/run_sh.py changed 3 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 9 (its worst body is run_sh.main at line 23), UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “fix: bind parallel sessions and repair standalone hook delivery”; “fix(security): harden planning context isolation”; “fix: emit Codex JSON from Unix context hooks”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-05..2026-11-03, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-05 03:30:40 +01:00' --until='2026-11-03 03:30:40 +01:00' --full-history --no-merges -- .codex/hooks/run_sh.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D30 · Dependency Vulnerabilities · Medium vulnerability · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Duplicated block (23 lines × 15) · ×3
  • Duplicated block (23 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:867 — .agents/skills/planning-with-files/scripts/inject-plan.py:867-889 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:867-889 | .codex/skills/planning-with-files/scripts/inject-plan.py:867-889 | .cursor/skills/planning-with-files/scripts/inject-plan.py:867-889 | .factory/skills/planning-with-files/scripts/inject-plan.py:867-889 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:867-889 | .opencode/skills/planning-with-files/scripts/inject-plan.py:867-889 | .pi/skills/planning-with-files/scripts/inject-plan.py:867-889 | scripts/inject-plan.py:867-889 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:867-889 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:867-889 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:867-889 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:867-889 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:867-889 | skills/planning-with-files/scripts/inject-plan.py:867-889 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (23 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:76 — .agents/skills/planning-with-files/scripts/session-catchup.py:76-98 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:76-98 | .codex/skills/planning-with-files/scripts/session-catchup.py:76-98 | .continue/skills/planning-with-files/scripts/session-catchup.py:76-98 | .cursor/skills/planning-with-files/scripts/session-catchup.py:76-98 | .factory/skills/planning-with-files/scripts/session-catchup.py:76-98 | .gemini/skills/planning-with-files/scripts/session-catchup.py:76-98 | .opencode/skills/planning-with-files/scripts/session-catchup.py:52-74 | .pi/skills/planning-with-files/scripts/session-catchup.py:76-98 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:73-95 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:74-96 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:77-99 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:75-97 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:74-96 | skills/planning-with-files/scripts/session-catchup.py:76-98 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (23 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:122 — .agents/skills/planning-with-files/scripts/session-catchup.py:122-144 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:122-144 | .codex/skills/planning-with-files/scripts/session-catchup.py:122-144 | .continue/skills/planning-with-files/scripts/session-catchup.py:122-144 | .cursor/skills/planning-with-files/scripts/session-catchup.py:122-144 | .factory/skills/planning-with-files/scripts/session-catchup.py:122-144 | .gemini/skills/planning-with-files/scripts/session-catchup.py:122-144 | .opencode/skills/planning-with-files/scripts/session-catchup.py:98-120 | .pi/skills/planning-with-files/scripts/session-catchup.py:122-144 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:119-141 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:120-142 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:123-145 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:121-143 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:120-142 | skills/planning-with-files/scripts/session-catchup.py:122-144 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 `.agents/skills/planning-with-files/scripts/session-catchup.py:122` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. 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 (20 lines × 2) · ×3
  • Duplicated block (20 lines × 2) .codex/hooks/context_frame.py:169 — .codex/hooks/context_frame.py:169-188 | .hermes/plugins/planning-with-files/context_frame.py:169-188 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (20 lines × 2) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:173 — .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:173-192 | scripts/sync-ide-folders.py:357-376 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/sync-ide-folders.py` and `scripts/sync-ide-folders.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 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 (20 lines × 2) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:254 — .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:254-273 | scripts/sync-ide-folders.py:442-461 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/sync-ide-folders.py` and `scripts/sync-ide-folders.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 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 (15 lines × 2) · ×3
  • Duplicated block (15 lines × 2) .hermes/skills/planning-with-files/scripts/session-catchup.py:315 — .hermes/skills/planning-with-files/scripts/session-catchup.py:315-329 | scripts/session-catchup.py:292-306 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 491 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (15 lines × 2) .hermes/skills/planning-with-files/scripts/session-catchup.py:114 — .hermes/skills/planning-with-files/scripts/session-catchup.py:114-128 | scripts/session-catchup.py:120-134 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 491 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 `.hermes/skills/planning-with-files/scripts/session-catchup.py:114` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (15 lines × 2) .hermes/skills/planning-with-files/scripts/session-catchup.py:132 — .hermes/skills/planning-with-files/scripts/session-catchup.py:132-146 | scripts/session-catchup.py:138-152 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 491 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 (12 lines × 15) · ×3
  • Duplicated block (12 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:928 — .agents/skills/planning-with-files/scripts/inject-plan.py:928-939 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:928-939 | .codex/skills/planning-with-files/scripts/inject-plan.py:928-939 | .cursor/skills/planning-with-files/scripts/inject-plan.py:928-939 | .factory/skills/planning-with-files/scripts/inject-plan.py:928-939 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:928-939 | .opencode/skills/planning-with-files/scripts/inject-plan.py:928-939 | .pi/skills/planning-with-files/scripts/inject-plan.py:928-939 | scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:928-939 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:928-939 | skills/planning-with-files/scripts/inject-plan.py:928-939 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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.
  • Duplicated block (12 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1619 — .agents/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .codex/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .factory/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | .pi/skills/planning-with-files/scripts/inject-plan.py:1619-1630 | scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1619-1630 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1619-1630 | skills/planning-with-files/scripts/inject-plan.py:1619-1630 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (12 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:327 — .agents/skills/planning-with-files/scripts/session-catchup.py:327-338 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:327-338 | .codex/skills/planning-with-files/scripts/session-catchup.py:327-338 | .continue/skills/planning-with-files/scripts/session-catchup.py:327-338 | .cursor/skills/planning-with-files/scripts/session-catchup.py:327-338 | .factory/skills/planning-with-files/scripts/session-catchup.py:327-338 | .gemini/skills/planning-with-files/scripts/session-catchup.py:327-338 | .opencode/skills/planning-with-files/scripts/session-catchup.py:303-314 | .pi/skills/planning-with-files/scripts/session-catchup.py:327-338 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:323-334 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:325-336 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:328-339 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:324-335 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:323-334 | skills/planning-with-files/scripts/session-catchup.py:327-338 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (6 lines × 15) · ×3
  • Duplicated block (6 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:151 — .agents/skills/planning-with-files/scripts/inject-plan.py:151-156 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:151-156 | .codex/skills/planning-with-files/scripts/inject-plan.py:151-156 | .cursor/skills/planning-with-files/scripts/inject-plan.py:151-156 | .factory/skills/planning-with-files/scripts/inject-plan.py:151-156 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:151-156 | .opencode/skills/planning-with-files/scripts/inject-plan.py:151-156 | .pi/skills/planning-with-files/scripts/inject-plan.py:151-156 | scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:151-156 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:151-156 | skills/planning-with-files/scripts/inject-plan.py:151-156 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (6 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:315 — .agents/skills/planning-with-files/scripts/inject-plan.py:315-320 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:315-320 | .codex/skills/planning-with-files/scripts/inject-plan.py:315-320 | .cursor/skills/planning-with-files/scripts/inject-plan.py:315-320 | .factory/skills/planning-with-files/scripts/inject-plan.py:315-320 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:315-320 | .opencode/skills/planning-with-files/scripts/inject-plan.py:315-320 | .pi/skills/planning-with-files/scripts/inject-plan.py:315-320 | scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:315-320 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:315-320 | skills/planning-with-files/scripts/inject-plan.py:315-320 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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.
  • Duplicated block (6 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:337 — .agents/skills/planning-with-files/scripts/inject-plan.py:337-342 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:337-342 | .codex/skills/planning-with-files/scripts/inject-plan.py:337-342 | .cursor/skills/planning-with-files/scripts/inject-plan.py:337-342 | .factory/skills/planning-with-files/scripts/inject-plan.py:337-342 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:337-342 | .opencode/skills/planning-with-files/scripts/inject-plan.py:337-342 | .pi/skills/planning-with-files/scripts/inject-plan.py:337-342 | scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:337-342 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:337-342 | skills/planning-with-files/scripts/inject-plan.py:337-342 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (9 lines × 15) · ×3
  • Duplicated block (9 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:56 — .agents/skills/planning-with-files/scripts/session-catchup.py:56-64 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:56-64 | .codex/skills/planning-with-files/scripts/session-catchup.py:56-64 | .continue/skills/planning-with-files/scripts/session-catchup.py:56-64 | .cursor/skills/planning-with-files/scripts/session-catchup.py:56-64 | .factory/skills/planning-with-files/scripts/session-catchup.py:56-64 | .gemini/skills/planning-with-files/scripts/session-catchup.py:56-64 | .opencode/skills/planning-with-files/scripts/session-catchup.py:32-40 | .pi/skills/planning-with-files/scripts/session-catchup.py:56-64 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:53-61 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:54-62 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:57-65 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:55-63 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:54-62 | skills/planning-with-files/scripts/session-catchup.py:56-64 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (9 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:692 — .agents/skills/planning-with-files/scripts/session-catchup.py:692-700 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:692-700 | .codex/skills/planning-with-files/scripts/session-catchup.py:692-700 | .continue/skills/planning-with-files/scripts/session-catchup.py:692-700 | .cursor/skills/planning-with-files/scripts/session-catchup.py:692-700 | .factory/skills/planning-with-files/scripts/session-catchup.py:692-700 | .gemini/skills/planning-with-files/scripts/session-catchup.py:692-700 | .opencode/skills/planning-with-files/scripts/session-catchup.py:617-625 | .pi/skills/planning-with-files/scripts/session-catchup.py:692-700 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:403-411 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:405-413 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:408-416 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:673-681 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:403-411 | skills/planning-with-files/scripts/session-catchup.py:692-700 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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.
  • Duplicated block (9 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:775 — .agents/skills/planning-with-files/scripts/session-catchup.py:775-783 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:775-783 | .codex/skills/planning-with-files/scripts/session-catchup.py:775-783 | .continue/skills/planning-with-files/scripts/session-catchup.py:775-783 | .cursor/skills/planning-with-files/scripts/session-catchup.py:775-783 | .factory/skills/planning-with-files/scripts/session-catchup.py:775-783 | .gemini/skills/planning-with-files/scripts/session-catchup.py:775-783 | .opencode/skills/planning-with-files/scripts/session-catchup.py:700-708 | .pi/skills/planning-with-files/scripts/session-catchup.py:775-783 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:486-494 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:488-496 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:491-499 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:756-764 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:486-494 | skills/planning-with-files/scripts/session-catchup.py:775-783 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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.
D1 · Cyclomatic Complexity · session-catchup.extract_messages_from_session (cyclomatic 29) · ×2
  • session-catchup.extract_messages_from_session (cyclomatic 29) .hermes/skills/planning-with-files/scripts/session-catchup.py:392 — session-catchup.extract_messages_from_session has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.extract_messages_from_session (cyclomatic 29) scripts/session-catchup.py:369 — session-catchup.extract_messages_from_session has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · session-catchup.main (cyclomatic 20) · ×2
  • session-catchup.main (cyclomatic 20) .hermes/skills/planning-with-files/scripts/session-catchup.py:476 — session-catchup.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
  • session-catchup.main (cyclomatic 20) scripts/session-catchup.py:710 — session-catchup.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D2 · Cognitive Complexity · session-catchup.extract_messages_from_session (cognitive 62) · ×2
  • session-catchup.extract_messages_from_session (cognitive 62) .hermes/skills/planning-with-files/scripts/session-catchup.py:392 — session-catchup.extract_messages_from_session has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 3 (9 pts), boolean chains 5, ternaries 1 (4 pts), error handling 2 (3 pts) (nesting depth added 39). 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.
  • session-catchup.extract_messages_from_session (cognitive 62) scripts/session-catchup.py:369 — session-catchup.extract_messages_from_session has cognitive complexity 62 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 3 (9 pts), boolean chains 5, ternaries 1 (4 pts), error handling 2 (3 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · session-catchup.main (cognitive 28) · ×2
  • session-catchup.main (cognitive 28) .hermes/skills/planning-with-files/scripts/session-catchup.py:476 — session-catchup.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.main (cognitive 28) scripts/session-catchup.py:710 — session-catchup.main has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (24 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · context_frame.verified_frame (cognitive 25) · ×2
  • context_frame.verified_frame (cognitive 25) .codex/hooks/context_frame.py:251 — context_frame.verified_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • context_frame.verified_frame (cognitive 25) .hermes/plugins/planning-with-files/context_frame.py:251 — context_frame.verified_frame has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (6 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup.scan_for_planning_update (cognitive 22) · ×2
  • session-catchup.scan_for_planning_update (cognitive 22) .hermes/skills/planning-with-files/scripts/session-catchup.py:349 — session-catchup.scan_for_planning_update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
  • session-catchup.scan_for_planning_update (cognitive 22) scripts/session-catchup.py:326 — session-catchup.scan_for_planning_update has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D4 · Code Duplication · Members sharing a duplicated core (10 members, 50+ identical tokens) · ×2
  • Members sharing a duplicated core (10 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:450 — .agents/skills/planning-with-files/scripts/session-catchup.py:450-466 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:450-466 | .codex/skills/planning-with-files/scripts/session-catchup.py:450-466 | .continue/skills/planning-with-files/scripts/session-catchup.py:450-466 | .cursor/skills/planning-with-files/scripts/session-catchup.py:450-466 | .factory/skills/planning-with-files/scripts/session-catchup.py:450-466 | .gemini/skills/planning-with-files/scripts/session-catchup.py:450-466 | .pi/skills/planning-with-files/scripts/session-catchup.py:450-466 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:446-457 | skills/planning-with-files/scripts/session-catchup.py:450-466 — 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) .agents/skills/planning-with-files/scripts/session-catchup.py:807 — .agents/skills/planning-with-files/scripts/session-catchup.py:807-831 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:807-831 | .codex/skills/planning-with-files/scripts/session-catchup.py:807-831 | .continue/skills/planning-with-files/scripts/session-catchup.py:807-831 | .cursor/skills/planning-with-files/scripts/session-catchup.py:807-831 | .factory/skills/planning-with-files/scripts/session-catchup.py:807-831 | .gemini/skills/planning-with-files/scripts/session-catchup.py:807-831 | .pi/skills/planning-with-files/scripts/session-catchup.py:807-831 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:788-807 | skills/planning-with-files/scripts/session-catchup.py:807-831 — 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 · Duplicated block (28 lines × 15) · ×2
  • Duplicated block (28 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:778 — .agents/skills/planning-with-files/scripts/inject-plan.py:778-805 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:778-805 | .codex/skills/planning-with-files/scripts/inject-plan.py:778-805 | .cursor/skills/planning-with-files/scripts/inject-plan.py:778-805 | .factory/skills/planning-with-files/scripts/inject-plan.py:778-805 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:778-805 | .opencode/skills/planning-with-files/scripts/inject-plan.py:778-805 | .pi/skills/planning-with-files/scripts/inject-plan.py:778-805 | scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:778-805 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:778-805 | skills/planning-with-files/scripts/inject-plan.py:778-805 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
  • Duplicated block (28 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1673 — .agents/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .codex/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .factory/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | .pi/skills/planning-with-files/scripts/inject-plan.py:1673-1700 | scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1673-1700 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1673-1700 | skills/planning-with-files/scripts/inject-plan.py:1673-1700 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (19–21 lines × 3) · ×2
  • Duplicated block (19–21 lines × 3) .hermes/skills/planning-with-files/scripts/session-catchup.py:409 — .hermes/skills/planning-with-files/scripts/session-catchup.py:409-429 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:330-348 | scripts/session-catchup.py:386-406 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 237 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 `.hermes/skills/planning-with-files/scripts/session-catchup.py:409` 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. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
  • Duplicated block (19–21 lines × 3) .hermes/skills/planning-with-files/scripts/session-catchup.py:434 — .hermes/skills/planning-with-files/scripts/session-catchup.py:434-454 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:351-369 | scripts/session-catchup.py:411-431 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 237 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 `.hermes/skills/planning-with-files/scripts/session-catchup.py:434` 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 (19 lines × 15) · ×2
  • Duplicated block (19 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:184 — .agents/skills/planning-with-files/scripts/inject-plan.py:184-202 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:184-202 | .codex/skills/planning-with-files/scripts/inject-plan.py:184-202 | .cursor/skills/planning-with-files/scripts/inject-plan.py:184-202 | .factory/skills/planning-with-files/scripts/inject-plan.py:184-202 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:184-202 | .opencode/skills/planning-with-files/scripts/inject-plan.py:184-202 | .pi/skills/planning-with-files/scripts/inject-plan.py:184-202 | scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:184-202 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:184-202 | skills/planning-with-files/scripts/inject-plan.py:184-202 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (19 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1471 — .agents/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .codex/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .factory/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | .pi/skills/planning-with-files/scripts/inject-plan.py:1471-1489 | scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1471-1489 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1471-1489 | skills/planning-with-files/scripts/inject-plan.py:1471-1489 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (19 lines × 2) · ×2
  • Duplicated block (19 lines × 2) .codex/hooks/context_frame.py:47 — .codex/hooks/context_frame.py:47-65 | .hermes/plugins/planning-with-files/context_frame.py:47-65 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (19 lines × 2) .hermes/skills/planning-with-files/scripts/session-catchup.py:39 — .hermes/skills/planning-with-files/scripts/session-catchup.py:39-57 | scripts/session-catchup.py:45-63 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 491 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 (18 lines × 3) · ×2
  • Duplicated block (18 lines × 3) .hermes/skills/planning-with-files/scripts/session-catchup.py:93 — .hermes/skills/planning-with-files/scripts/session-catchup.py:93-110 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:66-83 | scripts/session-catchup.py:99-116 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 237 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.
  • Duplicated block (18 lines × 3) .hermes/skills/planning-with-files/scripts/session-catchup.py:157 — .hermes/skills/planning-with-files/scripts/session-catchup.py:157-174 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:125-142 | scripts/session-catchup.py:163-180 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 237 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 (17 lines × 2) · ×2
  • Duplicated block (17 lines × 2) .codex/hooks/context_frame.py:149 — .codex/hooks/context_frame.py:149-165 | .hermes/plugins/planning-with-files/context_frame.py:149-165 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (17 lines × 2) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:274 — .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:274-290 | scripts/sync-ide-folders.py:467-483 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/sync-ide-folders.py` and `scripts/sync-ide-folders.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 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 × 15) · ×2
  • Duplicated block (11 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1606 — .agents/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .codex/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .factory/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | .pi/skills/planning-with-files/scripts/inject-plan.py:1606-1616 | scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1606-1616 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1606-1616 | skills/planning-with-files/scripts/inject-plan.py:1606-1616 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (11 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:358 — .agents/skills/planning-with-files/scripts/session-catchup.py:358-368 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:358-368 | .codex/skills/planning-with-files/scripts/session-catchup.py:358-368 | .continue/skills/planning-with-files/scripts/session-catchup.py:358-368 | .cursor/skills/planning-with-files/scripts/session-catchup.py:358-368 | .factory/skills/planning-with-files/scripts/session-catchup.py:358-368 | .gemini/skills/planning-with-files/scripts/session-catchup.py:358-368 | .opencode/skills/planning-with-files/scripts/session-catchup.py:334-344 | .pi/skills/planning-with-files/scripts/session-catchup.py:358-368 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:354-364 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:356-366 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:359-369 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:355-365 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:354-364 | skills/planning-with-files/scripts/session-catchup.py:358-368 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (10 lines × 3) · ×2
  • Duplicated block (10 lines × 3) .codex/hooks/codex_hook_adapter.py:127 — .codex/hooks/codex_hook_adapter.py:127-136 | .codex/hooks/context_frame.py:55-64 | .hermes/plugins/planning-with-files/context_frame.py:55-64 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `.codex/hooks/codex_hook_adapter.py:124` calls `lstat`, `S_ISLNK` and `.codex/hooks/context_frame.py:54` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (10 lines × 3) .hermes/skills/planning-with-files/scripts/session-catchup.py:582 — .hermes/skills/planning-with-files/scripts/session-catchup.py:582-591 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:457-466 | scripts/session-catchup.py:812-821 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 237 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 lines × 2) · ×2
  • Duplicated block (10 lines × 2) .codex/hooks/context_frame.py:69 — .codex/hooks/context_frame.py:69-78 | .hermes/plugins/planning-with-files/context_frame.py:69-78 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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.
  • Duplicated block (10 lines × 2) scripts/bump-version.py:96 — scripts/bump-version.py:96-105 | scripts/bump-version.py:134-143 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (7 lines × 10) · ×2
  • Duplicated block (7 lines × 10) .agents/skills/planning-with-files/scripts/session-catchup.py:490 — .agents/skills/planning-with-files/scripts/session-catchup.py:490-496 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:490-496 | .codex/skills/planning-with-files/scripts/session-catchup.py:490-496 | .continue/skills/planning-with-files/scripts/session-catchup.py:490-496 | .cursor/skills/planning-with-files/scripts/session-catchup.py:490-496 | .factory/skills/planning-with-files/scripts/session-catchup.py:490-496 | .gemini/skills/planning-with-files/scripts/session-catchup.py:490-496 | .pi/skills/planning-with-files/scripts/session-catchup.py:490-496 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:481-487 | skills/planning-with-files/scripts/session-catchup.py:490-496 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (7 lines × 10) .agents/skills/planning-with-files/scripts/session-catchup.py:431 — .agents/skills/planning-with-files/scripts/session-catchup.py:431-437 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:431-437 | .codex/skills/planning-with-files/scripts/session-catchup.py:431-437 | .continue/skills/planning-with-files/scripts/session-catchup.py:431-437 | .cursor/skills/planning-with-files/scripts/session-catchup.py:431-437 | .factory/skills/planning-with-files/scripts/session-catchup.py:431-437 | .gemini/skills/planning-with-files/scripts/session-catchup.py:431-437 | .pi/skills/planning-with-files/scripts/session-catchup.py:431-437 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:428-434 | skills/planning-with-files/scripts/session-catchup.py:431-437 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `.agents/skills/planning-with-files/scripts/session-catchup.py:442` calls `FAILED` and `skills/i18n/planning-with-files-zh/scripts/session-catchup.py:439` 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 (7 lines × 2) · ×2
  • Duplicated block (7 lines × 2) .opencode/skills/planning-with-files/scripts/session-catchup.py:405 — .opencode/skills/planning-with-files/scripts/session-catchup.py:405-411 | scripts/session-catchup.py:492-498 — before extracting anything, compare `.opencode/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 302 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `data` to `Dict[str, Any]` in one and `Dict` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
  • Duplicated block (7 lines × 2) REDACTED:623 — REDACTED:623-629 | REDACTED:631-637 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:640` calls `copytree` and `REDACTED:631` 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 × 18) · ×2
  • Duplicated block (5 lines × 18) .agents/skills/planning-with-files/scripts/session-catchup.py:242 — .agents/skills/planning-with-files/scripts/session-catchup.py:242-246 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:242-246 | .codex/skills/planning-with-files/scripts/session-catchup.py:242-246 | .continue/skills/planning-with-files/scripts/session-catchup.py:242-246 | .cursor/skills/planning-with-files/scripts/session-catchup.py:242-246 | .factory/skills/planning-with-files/scripts/session-catchup.py:242-246 | .gemini/skills/planning-with-files/scripts/session-catchup.py:242-246 | .hermes/skills/planning-with-files/scripts/session-catchup.py:215-219 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:183-187 | .opencode/skills/planning-with-files/scripts/session-catchup.py:218-222 | .pi/skills/planning-with-files/scripts/session-catchup.py:242-246 | scripts/session-catchup.py:221-225 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:239-243 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:240-244 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:243-247 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:241-245 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:240-244 | skills/planning-with-files/scripts/session-catchup.py:242-246 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (5 lines × 18) .agents/skills/planning-with-files/scripts/session-catchup.py:704 — .agents/skills/planning-with-files/scripts/session-catchup.py:704-714 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:704-714 | .codex/skills/planning-with-files/scripts/session-catchup.py:704-714 | .continue/skills/planning-with-files/scripts/session-catchup.py:704-714 | .cursor/skills/planning-with-files/scripts/session-catchup.py:704-714 | .factory/skills/planning-with-files/scripts/session-catchup.py:704-714 | .gemini/skills/planning-with-files/scripts/session-catchup.py:704-714 | .hermes/skills/planning-with-files/scripts/session-catchup.py:31-35 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:26-30 | .opencode/skills/planning-with-files/scripts/session-catchup.py:629-639 | .pi/skills/planning-with-files/scripts/session-catchup.py:704-714 | scripts/session-catchup.py:31-41 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:415-425 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:417-427 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:420-430 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:685-695 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:415-425 | skills/planning-with-files/scripts/session-catchup.py:704-714 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `path_value` to `Any` in one and `object` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
SC1 · Supply-chain hygiene · JavaScript dependencies are not locked · ×2
  • JavaScript dependencies are not locked .opencode/package.json:2 — .opencode/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
  • JavaScript dependencies are not locked .pi/skills/planning-with-files/package.json:44 — .pi/skills/planning-with-files/package.json declares dependencies that no committed lockfile resolves — there is no REDACTED / yarn.lock / pnpm-lock.yaml / bun.lock beside it, and no locked workspace above it names it — so its installs aren't reproducible (SSDF PW.4.4). Commit its package manager's lockfile (or add it to the locked workspace) and install from it (`npm ci`, `yarn --immutable`, `pnpm i --frozen-lockfile` or `bun i --frozen-lockfile`). Advisory — never scored.
D1 · Cyclomatic Complexity · hooks._auto_bind (cyclomatic 38) · ×1
  • hooks._auto_bind (cyclomatic 38) .hermes/plugins/planning-with-files/hooks.py:282 — hooks._auto_bind has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · session-catchup.opencode_catchup (cyclomatic 30) · ×1
  • session-catchup.opencode_catchup (cyclomatic 30) scripts/session-catchup.py:541 — session-catchup.opencode_catchup has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · session-catchup.extract_messages_after (cyclomatic 25) · ×1
  • session-catchup.extract_messages_after (cyclomatic 25) .mastracode/skills/planning-with-files/scripts/session-catchup.py:325 — session-catchup.extract_messages_after has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · session-catchup.main (cyclomatic 22) · ×1
  • session-catchup.main (cyclomatic 22) .kiro/skills/planning-with-files/assets/scripts/session-catchup.py:51 — session-catchup.main has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · planning_files.extract_current_phase (cyclomatic 21) · ×1
  • planning_files.extract_current_phase (cyclomatic 21) .hermes/plugins/planning-with-files/planning_files.py:274 — planning_files.extract_current_phase has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · sync-ide-folders.main (cyclomatic 20) · ×1
  • sync-ide-folders.main (cyclomatic 20) scripts/sync-ide-folders.py:402 — sync-ide-folders.main has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · planning-with-files.pwf_command (cyclomatic 19) · ×1
  • planning-with-files.pwf_command (cyclomatic 19) .hermes/plugins/planning-with-files/__init__.py:78 — planning-with-files.pwf_command has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · tools.planning_with_files_select (cyclomatic 19) · ×1
  • tools.planning_with_files_select (cyclomatic 19) .hermes/plugins/planning-with-files/tools.py:77 — tools.planning_with_files_select has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · session-catchup.main (cyclomatic 19) · ×1
  • session-catchup.main (cyclomatic 19) .mastracode/skills/planning-with-files/scripts/session-catchup.py:386 — session-catchup.main has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · paths.resolve_plan (cyclomatic 18) · ×1
  • paths.resolve_plan (cyclomatic 18) .hermes/plugins/planning-with-files/paths.py:300 — paths.resolve_plan 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 · planning_files.phase_counts (cyclomatic 18) · ×1
  • planning_files.phase_counts (cyclomatic 18) .hermes/plugins/planning-with-files/planning_files.py:217 — planning_files.phase_counts 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 · sync-ide-folders.main (cyclomatic 18) · ×1
  • sync-ide-folders.main (cyclomatic 18) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:218 — sync-ide-folders.main 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 · codex_hook_adapter.is_session_attached (cyclomatic 16) · ×1
  • codex_hook_adapter.is_session_attached (cyclomatic 16) .codex/hooks/codex_hook_adapter.py:190 — codex_hook_adapter.is_session_attached has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · hooks._successful_file_result (cyclomatic 16) · ×1
  • hooks._successful_file_result (cyclomatic 16) .hermes/plugins/planning-with-files/hooks.py:262 — hooks._successful_file_result has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D2 · Cognitive Complexity · hooks._auto_bind (cognitive 64) · ×1
  • hooks._auto_bind (cognitive 64) .hermes/plugins/planning-with-files/hooks.py:282 — hooks._auto_bind has cognitive complexity 64 (threshold 15). Drivers by points: if/else 20 (43 pts), boolean chains 9, loops 4 (7 pts), error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup.extract_messages_after (cognitive 58) · ×1
  • session-catchup.extract_messages_after (cognitive 58) .mastracode/skills/planning-with-files/scripts/session-catchup.py:325 — session-catchup.extract_messages_after has cognitive complexity 58 (threshold 15). Drivers by points: if/else 12 (41 pts), loops 3 (9 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · session-catchup.opencode_catchup (cognitive 49) · ×1
  • session-catchup.opencode_catchup (cognitive 49) scripts/session-catchup.py:541 — session-catchup.opencode_catchup has cognitive complexity 49 (threshold 15). Drivers by points: if/else 17 (27 pts), loops 6 (8 pts), error handling 4 (7 pts), ternaries 2 (6 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup.main (cognitive 47) · ×1
  • session-catchup.main (cognitive 47) .kiro/skills/planning-with-files/assets/scripts/session-catchup.py:51 — session-catchup.main has cognitive complexity 47 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 3 (8 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · planning_files.extract_current_phase (cognitive 39) · ×1
  • planning_files.extract_current_phase (cognitive 39) .hermes/plugins/planning-with-files/planning_files.py:274 — planning_files.extract_current_phase has cognitive complexity 39 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 5 (8 pts), boolean chains 5 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sync-ide-folders.main (cognitive 35) · ×1
  • sync-ide-folders.main (cognitive 35) scripts/sync-ide-folders.py:402 — sync-ide-folders.main has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (28 pts), loops 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · paths.resolve_plan (cognitive 34) · ×1
  • paths.resolve_plan (cognitive 34) .hermes/plugins/planning-with-files/paths.py:300 — paths.resolve_plan has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (22 pts), error handling 2 (7 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sync-ide-folders.main (cognitive 33) · ×1
  • sync-ide-folders.main (cognitive 33) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:218 — sync-ide-folders.main has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (26 pts), loops 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · tools.planning_with_files_select (cognitive 30) · ×1
  • tools.planning_with_files_select (cognitive 30) .hermes/plugins/planning-with-files/tools.py:77 — tools.planning_with_files_select has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 3 (5 pts), error handling 1 (3 pts), boolean chains 2, 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 · session-catchup.find_last_planning_update (cognitive 28) · ×1
  • session-catchup.find_last_planning_update (cognitive 28) .mastracode/skills/planning-with-files/scripts/session-catchup.py:296 — session-catchup.find_last_planning_update has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (23 pts), loops 2 (5 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · planning_files.phase_counts (cognitive 27) · ×1
  • planning_files.phase_counts (cognitive 27) .hermes/plugins/planning-with-files/planning_files.py:217 — planning_files.phase_counts has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session-catchup.main (cognitive 26) · ×1
  • session-catchup.main (cognitive 26) .mastracode/skills/planning-with-files/scripts/session-catchup.py:386 — session-catchup.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 16 (23 pts), loops 2, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · shell_hook.handle (cognitive 25) · ×1
  • shell_hook.handle (cognitive 25) .hermes/plugins/planning-with-files/shell_hook.py:90 — shell_hook.handle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 4, error handling 1 (4 pts), loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sync-ide-folders._build_manifest (cognitive 21) · ×1
  • sync-ide-folders._build_manifest (cognitive 21) scripts/sync-ide-folders.py:105 — sync-ide-folders._build_manifest has cognitive complexity 21 (threshold 15). Drivers by points: loops 8 (16 pts), if/else 5 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · paths.nested_live_plans (cognitive 20) · ×1
  • paths.nested_live_plans (cognitive 20) .hermes/plugins/planning-with-files/paths.py:266 — paths.nested_live_plans has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · hooks._successful_file_result (cognitive 19) · ×1
  • hooks._successful_file_result (cognitive 19) .hermes/plugins/planning-with-files/hooks.py:262 — hooks._successful_file_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6, ternaries 3 (6 pts), boolean chains 5, 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.
D2 · Cognitive Complexity · codex_hook_adapter.is_session_attached (cognitive 18) · ×1
  • codex_hook_adapter.is_session_attached (cognitive 18) .codex/hooks/codex_hook_adapter.py:190 — codex_hook_adapter.is_session_attached has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), error handling 4 (5 pts), boolean chains 3, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · tools._project_dir (cognitive 18) · ×1
  • tools._project_dir (cognitive 18) .hermes/plugins/planning-with-files/tools.py:22 — tools._project_dir has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · sync-ide-folders._build_manifest (cognitive 18) · ×1
  • sync-ide-folders._build_manifest (cognitive 18) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:55 — sync-ide-folders._build_manifest has cognitive complexity 18 (threshold 15). Drivers by points: loops 7 (14 pts), if/else 4 (nesting depth added 7). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · session-catchup._format_opencode_part (cognitive 18) · ×1
  • session-catchup._format_opencode_part (cognitive 18) .opencode/skills/planning-with-files/scripts/session-catchup.py:399 — session-catchup._format_opencode_part has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, ternaries 2 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · codex_hook_adapter.session_plan_requires_binding (cognitive 17) · ×1
  • codex_hook_adapter.session_plan_requires_binding (cognitive 17) .codex/hooks/codex_hook_adapter.py:244 — codex_hook_adapter.session_plan_requires_binding has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · codex_hook_adapter._windows_git_bash (cognitive 17) · ×1
  • codex_hook_adapter._windows_git_bash (cognitive 17) .codex/hooks/codex_hook_adapter.py:298 — codex_hook_adapter._windows_git_bash has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3, boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · planning-with-files.pwf_command (cognitive 17) · ×1
  • planning-with-files.pwf_command (cognitive 17) .hermes/plugins/planning-with-files/__init__.py:78 — planning-with-files.pwf_command has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · hooks.pre_llm_call (cognitive 16) · ×1
  • hooks.pre_llm_call (cognitive 16) .hermes/plugins/planning-with-files/hooks.py:231 — hooks.pre_llm_call has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (15 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.
D4 · Code Duplication · Near-duplicate member family (18 members, 26 shared lines) · ×1
  • Near-duplicate member family (18 members, 26 shared lines) .agents/skills/planning-with-files/scripts/session-catchup.py:262 — .agents/skills/planning-with-files/scripts/session-catchup.py:262-309 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:262-309 | .codex/skills/planning-with-files/scripts/session-catchup.py:262-309 | .continue/skills/planning-with-files/scripts/session-catchup.py:262-309 | .cursor/skills/planning-with-files/scripts/session-catchup.py:262-309 | .factory/skills/planning-with-files/scripts/session-catchup.py:262-309 | .gemini/skills/planning-with-files/scripts/session-catchup.py:262-309 | .hermes/skills/planning-with-files/scripts/session-catchup.py:264-311 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:232-279 | .opencode/skills/planning-with-files/scripts/session-catchup.py:238-285 | .pi/skills/planning-with-files/scripts/session-catchup.py:262-309 | scripts/session-catchup.py:241-288 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:259-305 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:260-307 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:263-310 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:261-306 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:260-305 | skills/planning-with-files/scripts/session-catchup.py:262-309 — These 18 members are variants of one another: a block of 26 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 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 · Near-duplicate member family (15 members, 80 shared lines) · ×1
  • Near-duplicate member family (15 members, 80 shared lines) .agents/skills/planning-with-files/scripts/inject-plan.py:350 — .agents/skills/planning-with-files/scripts/inject-plan.py:350-430 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:350-430 | .codex/skills/planning-with-files/scripts/inject-plan.py:350-430 | .cursor/skills/planning-with-files/scripts/inject-plan.py:350-430 | .factory/skills/planning-with-files/scripts/inject-plan.py:350-430 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:350-430 | .opencode/skills/planning-with-files/scripts/inject-plan.py:350-430 | .pi/skills/planning-with-files/scripts/inject-plan.py:350-430 | scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:350-430 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:350-430 | skills/planning-with-files/scripts/inject-plan.py:350-430 — These 15 members are variants of one another: a block of 80 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 15 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 15 times.
D4 · Code Duplication · Near-duplicate member family (15 members, 74 shared lines) · ×1
  • Near-duplicate member family (15 members, 74 shared lines) .agents/skills/planning-with-files/scripts/inject-plan.py:809 — .agents/skills/planning-with-files/scripts/inject-plan.py:809-889 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:809-889 | .codex/skills/planning-with-files/scripts/inject-plan.py:809-889 | .cursor/skills/planning-with-files/scripts/inject-plan.py:809-889 | .factory/skills/planning-with-files/scripts/inject-plan.py:809-889 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:809-889 | .opencode/skills/planning-with-files/scripts/inject-plan.py:809-889 | .pi/skills/planning-with-files/scripts/inject-plan.py:809-889 | scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:809-889 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:809-889 | skills/planning-with-files/scripts/inject-plan.py:809-889 — These 15 members are variants of one another: a block of 74 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 15 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 15 times.
D4 · Code Duplication · Near-duplicate member family (15 members, 70 shared lines) · ×1
  • Near-duplicate member family (15 members, 70 shared lines) .agents/skills/planning-with-files/scripts/session-catchup.py:835 — .agents/skills/planning-with-files/scripts/session-catchup.py:835-921 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:835-921 | .codex/skills/planning-with-files/scripts/session-catchup.py:835-921 | .continue/skills/planning-with-files/scripts/session-catchup.py:835-921 | .cursor/skills/planning-with-files/scripts/session-catchup.py:835-921 | .factory/skills/planning-with-files/scripts/session-catchup.py:835-921 | .gemini/skills/planning-with-files/scripts/session-catchup.py:835-921 | .opencode/skills/planning-with-files/scripts/session-catchup.py:732-812 | .pi/skills/planning-with-files/scripts/session-catchup.py:835-921 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:518-598 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:549-629 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:523-603 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:811-895 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:547-627 | skills/planning-with-files/scripts/session-catchup.py:835-921 — These 15 members are variants of one another: a block of 70 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 15 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 15 times.
D4 · Code Duplication · Near-duplicate member family (15 members, 50 shared lines) · ×1
  • Near-duplicate member family (15 members, 50 shared lines) .agents/skills/planning-with-files/scripts/session-catchup.py:925 — .agents/skills/planning-with-files/scripts/session-catchup.py:925-1000 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:925-1000 | .codex/skills/planning-with-files/scripts/session-catchup.py:925-1000 | .continue/skills/planning-with-files/scripts/session-catchup.py:925-1000 | .cursor/skills/planning-with-files/scripts/session-catchup.py:925-1000 | .factory/skills/planning-with-files/scripts/session-catchup.py:925-1000 | .gemini/skills/planning-with-files/scripts/session-catchup.py:925-1000 | .opencode/skills/planning-with-files/scripts/session-catchup.py:816-891 | .pi/skills/planning-with-files/scripts/session-catchup.py:925-1000 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:631-701 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:633-703 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:639-710 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:899-972 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:631-701 | skills/planning-with-files/scripts/session-catchup.py:925-1000 — These 15 members are variants of one another: a block of 50 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 15 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 15 times.
D4 · Code Duplication · Near-duplicate member family (12 members, 129 shared lines) · ×1
  • Near-duplicate member family (12 members, 129 shared lines) .agents/skills/planning-with-files/scripts/session-catchup.py:529 — .agents/skills/planning-with-files/scripts/session-catchup.py:529-688 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:529-688 | .codex/skills/planning-with-files/scripts/session-catchup.py:529-688 | .continue/skills/planning-with-files/scripts/session-catchup.py:529-688 | .cursor/skills/planning-with-files/scripts/session-catchup.py:529-688 | .factory/skills/planning-with-files/scripts/session-catchup.py:529-688 | .gemini/skills/planning-with-files/scripts/session-catchup.py:529-688 | .opencode/skills/planning-with-files/scripts/session-catchup.py:454-613 | .pi/skills/planning-with-files/scripts/session-catchup.py:529-688 | scripts/session-catchup.py:542-707 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:520-669 | skills/planning-with-files/scripts/session-catchup.py:529-688 — These 12 members are variants of one another: a block of 129 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 12 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 12 times.
D4 · Code Duplication · Near-duplicate member family (10 members, 17 shared lines) · ×1
  • Near-duplicate member family (10 members, 17 shared lines) .agents/skills/planning-with-files/scripts/session-catchup.py:470 — .agents/skills/planning-with-files/scripts/session-catchup.py:470-496 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:470-496 | .codex/skills/planning-with-files/scripts/session-catchup.py:470-496 | .continue/skills/planning-with-files/scripts/session-catchup.py:470-496 | .cursor/skills/planning-with-files/scripts/session-catchup.py:470-496 | .factory/skills/planning-with-files/scripts/session-catchup.py:470-496 | .gemini/skills/planning-with-files/scripts/session-catchup.py:470-496 | .pi/skills/planning-with-files/scripts/session-catchup.py:470-496 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:461-487 | skills/planning-with-files/scripts/session-catchup.py:470-496 — These 10 members are variants of one another: a block of 17 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 · Edited copy of a member (73 corresponding lines) · ×1
  • Edited copy of a member (73 corresponding lines) .hermes/skills/planning-with-files/scripts/session-catchup.py:393 — .hermes/skills/planning-with-files/scripts/session-catchup.py:393-473 | scripts/session-catchup.py:370-450 — These two members are one piece of code written twice and then edited apart: 73 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport 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 (16 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (16 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:734 — .agents/skills/planning-with-files/scripts/session-catchup.py:734-771 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:734-771 | .codex/skills/planning-with-files/scripts/session-catchup.py:734-771 | .continue/skills/planning-with-files/scripts/session-catchup.py:734-771 | .cursor/skills/planning-with-files/scripts/session-catchup.py:734-771 | .factory/skills/planning-with-files/scripts/session-catchup.py:734-771 | .gemini/skills/planning-with-files/scripts/session-catchup.py:734-771 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:297-322 | .opencode/skills/planning-with-files/scripts/session-catchup.py:659-696 | .pi/skills/planning-with-files/scripts/session-catchup.py:734-771 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:445-482 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:447-484 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:450-487 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:715-752 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:445-482 | skills/planning-with-files/scripts/session-catchup.py:734-771 — 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 (12 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (12 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:411 — .agents/skills/planning-with-files/scripts/session-catchup.py:411-420 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:411-420 | .codex/skills/planning-with-files/scripts/session-catchup.py:411-420 | .continue/skills/planning-with-files/scripts/session-catchup.py:411-420 | .cursor/skills/planning-with-files/scripts/session-catchup.py:411-420 | .factory/skills/planning-with-files/scripts/session-catchup.py:411-420 | .gemini/skills/planning-with-files/scripts/session-catchup.py:411-420 | .opencode/skills/planning-with-files/scripts/session-catchup.py:387-396 | .pi/skills/planning-with-files/scripts/session-catchup.py:411-420 | scripts/session-catchup.py:465-480 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:408-417 | skills/planning-with-files/scripts/session-catchup.py:411-420 — These 12 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 12 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 12 times.
D4 · Code Duplication · Members sharing a duplicated core (11 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (11 members, 50+ identical tokens) .agents/skills/planning-with-files/scripts/session-catchup.py:392 — .agents/skills/planning-with-files/scripts/session-catchup.py:392-407 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:392-407 | .codex/skills/planning-with-files/scripts/session-catchup.py:392-407 | .continue/skills/planning-with-files/scripts/session-catchup.py:392-407 | .cursor/skills/planning-with-files/scripts/session-catchup.py:392-407 | .factory/skills/planning-with-files/scripts/session-catchup.py:392-407 | .gemini/skills/planning-with-files/scripts/session-catchup.py:392-407 | .opencode/skills/planning-with-files/scripts/session-catchup.py:368-383 | .pi/skills/planning-with-files/scripts/session-catchup.py:392-407 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:389-404 | skills/planning-with-files/scripts/session-catchup.py:392-407 — These 11 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 11 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 11 times.
D4 · Code Duplication · Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (4 members, 50+ identical tokens) skills/i18n/planning-with-files-ar/scripts/session-catchup.py:388 — skills/i18n/planning-with-files-ar/scripts/session-catchup.py:388-399 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:390-401 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:393-404 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:388-399 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
D4 · Code Duplication · Duplicated block (418 lines × 15) · ×1
  • Duplicated block (418 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:949 — .agents/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .codex/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .cursor/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .factory/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .opencode/skills/planning-with-files/scripts/inject-plan.py:949-1366 | .pi/skills/planning-with-files/scripts/inject-plan.py:949-1366 | scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:949-1366 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:949-1366 | skills/planning-with-files/scripts/inject-plan.py:949-1366 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (122 lines × 15) · ×1
  • Duplicated block (122 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:525 — .agents/skills/planning-with-files/scripts/inject-plan.py:525-646 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:525-646 | .codex/skills/planning-with-files/scripts/inject-plan.py:525-646 | .cursor/skills/planning-with-files/scripts/inject-plan.py:525-646 | .factory/skills/planning-with-files/scripts/inject-plan.py:525-646 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:525-646 | .opencode/skills/planning-with-files/scripts/inject-plan.py:525-646 | .pi/skills/planning-with-files/scripts/inject-plan.py:525-646 | scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:525-646 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:525-646 | skills/planning-with-files/scripts/inject-plan.py:525-646 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (99 lines × 15) · ×1
  • Duplicated block (99 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:654 — .agents/skills/planning-with-files/scripts/inject-plan.py:654-752 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:654-752 | .codex/skills/planning-with-files/scripts/inject-plan.py:654-752 | .cursor/skills/planning-with-files/scripts/inject-plan.py:654-752 | .factory/skills/planning-with-files/scripts/inject-plan.py:654-752 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:654-752 | .opencode/skills/planning-with-files/scripts/inject-plan.py:654-752 | .pi/skills/planning-with-files/scripts/inject-plan.py:654-752 | scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:654-752 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:654-752 | skills/planning-with-files/scripts/inject-plan.py:654-752 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (93 lines × 2) · ×1
  • Duplicated block (93 lines × 2) .hermes/skills/planning-with-files/scripts/session-catchup.py:493 — .hermes/skills/planning-with-files/scripts/session-catchup.py:493-585 | scripts/session-catchup.py:723-815 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 491 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 (88 lines × 15) · ×1
  • Duplicated block (88 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:434 — .agents/skills/planning-with-files/scripts/inject-plan.py:434-521 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:434-521 | .codex/skills/planning-with-files/scripts/inject-plan.py:434-521 | .cursor/skills/planning-with-files/scripts/inject-plan.py:434-521 | .factory/skills/planning-with-files/scripts/inject-plan.py:434-521 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:434-521 | .opencode/skills/planning-with-files/scripts/inject-plan.py:434-521 | .pi/skills/planning-with-files/scripts/inject-plan.py:434-521 | scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:434-521 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:434-521 | skills/planning-with-files/scripts/inject-plan.py:434-521 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (75–82 lines × 11) · ×1
  • Duplicated block (75–82 lines × 11) .agents/skills/planning-with-files/scripts/session-catchup.py:529 — .agents/skills/planning-with-files/scripts/session-catchup.py:529-610 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:529-610 | .codex/skills/planning-with-files/scripts/session-catchup.py:529-610 | .continue/skills/planning-with-files/scripts/session-catchup.py:529-610 | .cursor/skills/planning-with-files/scripts/session-catchup.py:529-610 | .factory/skills/planning-with-files/scripts/session-catchup.py:529-610 | .gemini/skills/planning-with-files/scripts/session-catchup.py:529-610 | .opencode/skills/planning-with-files/scripts/session-catchup.py:454-535 | .pi/skills/planning-with-files/scripts/session-catchup.py:529-610 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:520-594 | skills/planning-with-files/scripts/session-catchup.py:529-610 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (78 lines × 15) · ×1
  • Duplicated block (78 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1493 — .agents/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .codex/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .factory/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | .pi/skills/planning-with-files/scripts/inject-plan.py:1493-1570 | scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1493-1570 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1493-1570 | skills/planning-with-files/scripts/inject-plan.py:1493-1570 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (64 lines × 2) · ×1
  • Duplicated block (64 lines × 2) .codex/hooks/context_frame.py:82 — .codex/hooks/context_frame.py:82-145 | .hermes/plugins/planning-with-files/context_frame.py:82-145 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (49 lines × 15) · ×1
  • Duplicated block (49 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:382 — .agents/skills/planning-with-files/scripts/inject-plan.py:382-430 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:382-430 | .codex/skills/planning-with-files/scripts/inject-plan.py:382-430 | .cursor/skills/planning-with-files/scripts/inject-plan.py:382-430 | .factory/skills/planning-with-files/scripts/inject-plan.py:382-430 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:382-430 | .opencode/skills/planning-with-files/scripts/inject-plan.py:382-430 | .pi/skills/planning-with-files/scripts/inject-plan.py:382-430 | scripts/inject-plan.py:382-430 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:382-430 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:382-430 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:382-430 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:382-430 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:382-430 | skills/planning-with-files/scripts/inject-plan.py:382-430 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (48 lines × 15) · ×1
  • Duplicated block (48 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1378 — .agents/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .codex/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .factory/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | .pi/skills/planning-with-files/scripts/inject-plan.py:1378-1425 | scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1378-1425 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1378-1425 | skills/planning-with-files/scripts/inject-plan.py:1378-1425 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (42–44 lines × 11) · ×1
  • Duplicated block (42–44 lines × 11) .agents/skills/planning-with-files/scripts/session-catchup.py:925 — .agents/skills/planning-with-files/scripts/session-catchup.py:925-968 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:925-968 | .codex/skills/planning-with-files/scripts/session-catchup.py:925-968 | .continue/skills/planning-with-files/scripts/session-catchup.py:925-968 | .cursor/skills/planning-with-files/scripts/session-catchup.py:925-968 | .factory/skills/planning-with-files/scripts/session-catchup.py:925-968 | .gemini/skills/planning-with-files/scripts/session-catchup.py:925-968 | .opencode/skills/planning-with-files/scripts/session-catchup.py:816-859 | .pi/skills/planning-with-files/scripts/session-catchup.py:925-968 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:899-940 | skills/planning-with-files/scripts/session-catchup.py:925-968 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (42 lines × 15) · ×1
  • Duplicated block (42 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:950 — .agents/skills/planning-with-files/scripts/session-catchup.py:950-991 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:950-991 | .codex/skills/planning-with-files/scripts/session-catchup.py:950-991 | .continue/skills/planning-with-files/scripts/session-catchup.py:950-991 | .cursor/skills/planning-with-files/scripts/session-catchup.py:950-991 | .factory/skills/planning-with-files/scripts/session-catchup.py:950-991 | .gemini/skills/planning-with-files/scripts/session-catchup.py:950-991 | .opencode/skills/planning-with-files/scripts/session-catchup.py:841-882 | .pi/skills/planning-with-files/scripts/session-catchup.py:950-991 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:651-692 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:653-694 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:660-701 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:922-963 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:651-692 | skills/planning-with-files/scripts/session-catchup.py:950-991 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `.agents/skills/planning-with-files/scripts/session-catchup.py:946` calls `opencode_catchup` and `skills/i18n/planning-with-files-ar/scripts/session-catchup.py:648` 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 (40–42 lines × 2) · ×1
  • Duplicated block (40–42 lines × 2) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:57 — .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:57-96 | scripts/sync-ide-folders.py:108-149 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/sync-ide-folders.py` and `scripts/sync-ide-folders.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 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 after the matched lines, `scripts/sync-ide-folders.py:154` calls `str` and `.hermes/skills/planning-with-files/scripts/sync-ide-folders.py:98` 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 (40 lines × 15) · ×1
  • Duplicated block (40 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:882 — .agents/skills/planning-with-files/scripts/session-catchup.py:882-921 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:882-921 | .codex/skills/planning-with-files/scripts/session-catchup.py:882-921 | .continue/skills/planning-with-files/scripts/session-catchup.py:882-921 | .cursor/skills/planning-with-files/scripts/session-catchup.py:882-921 | .factory/skills/planning-with-files/scripts/session-catchup.py:882-921 | .gemini/skills/planning-with-files/scripts/session-catchup.py:882-921 | .opencode/skills/planning-with-files/scripts/session-catchup.py:773-812 | .pi/skills/planning-with-files/scripts/session-catchup.py:882-921 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:559-598 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:590-629 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:564-603 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:856-895 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:588-627 | skills/planning-with-files/scripts/session-catchup.py:882-921 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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–40 lines × 12) · ×1
  • Duplicated block (39–40 lines × 12) .agents/skills/planning-with-files/scripts/session-catchup.py:565 — .agents/skills/planning-with-files/scripts/session-catchup.py:565-604 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:565-604 | .codex/skills/planning-with-files/scripts/session-catchup.py:565-604 | .continue/skills/planning-with-files/scripts/session-catchup.py:565-604 | .cursor/skills/planning-with-files/scripts/session-catchup.py:565-604 | .factory/skills/planning-with-files/scripts/session-catchup.py:565-604 | .gemini/skills/planning-with-files/scripts/session-catchup.py:565-604 | .opencode/skills/planning-with-files/scripts/session-catchup.py:490-529 | .pi/skills/planning-with-files/scripts/session-catchup.py:565-604 | scripts/session-catchup.py:584-623 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:550-588 | skills/planning-with-files/scripts/session-catchup.py:565-604 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (38 lines × 15) · ×1
  • Duplicated block (38 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:734 — .agents/skills/planning-with-files/scripts/session-catchup.py:734-771 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:734-771 | .codex/skills/planning-with-files/scripts/session-catchup.py:734-771 | .continue/skills/planning-with-files/scripts/session-catchup.py:734-771 | .cursor/skills/planning-with-files/scripts/session-catchup.py:734-771 | .factory/skills/planning-with-files/scripts/session-catchup.py:734-771 | .gemini/skills/planning-with-files/scripts/session-catchup.py:734-771 | .opencode/skills/planning-with-files/scripts/session-catchup.py:659-696 | .pi/skills/planning-with-files/scripts/session-catchup.py:734-771 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:445-482 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:447-484 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:450-487 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:715-752 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:445-482 | skills/planning-with-files/scripts/session-catchup.py:734-771 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 × 15) · ×1
  • Duplicated block (37 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1742 — .agents/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .codex/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .factory/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | .pi/skills/planning-with-files/scripts/inject-plan.py:1742-1778 | scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1742-1778 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1742-1778 | skills/planning-with-files/scripts/inject-plan.py:1742-1778 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (36 lines × 15) · ×1
  • Duplicated block (36 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:148 — .agents/skills/planning-with-files/scripts/session-catchup.py:148-183 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:148-183 | .codex/skills/planning-with-files/scripts/session-catchup.py:148-183 | .continue/skills/planning-with-files/scripts/session-catchup.py:148-183 | .cursor/skills/planning-with-files/scripts/session-catchup.py:148-183 | .factory/skills/planning-with-files/scripts/session-catchup.py:148-183 | .gemini/skills/planning-with-files/scripts/session-catchup.py:148-183 | .opencode/skills/planning-with-files/scripts/session-catchup.py:124-159 | .pi/skills/planning-with-files/scripts/session-catchup.py:148-183 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:145-180 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:146-181 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:149-184 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:147-182 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:146-181 | skills/planning-with-files/scripts/session-catchup.py:148-183 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (33–35 lines × 12) · ×1
  • Duplicated block (33–35 lines × 12) .agents/skills/planning-with-files/scripts/session-catchup.py:627 — .agents/skills/planning-with-files/scripts/session-catchup.py:627-661 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:627-661 | .codex/skills/planning-with-files/scripts/session-catchup.py:627-661 | .continue/skills/planning-with-files/scripts/session-catchup.py:627-661 | .cursor/skills/planning-with-files/scripts/session-catchup.py:627-661 | .factory/skills/planning-with-files/scripts/session-catchup.py:627-661 | .gemini/skills/planning-with-files/scripts/session-catchup.py:627-661 | .opencode/skills/planning-with-files/scripts/session-catchup.py:552-586 | .pi/skills/planning-with-files/scripts/session-catchup.py:627-661 | scripts/session-catchup.py:646-680 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:610-642 | skills/planning-with-files/scripts/session-catchup.py:627-661 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (34 lines × 2) · ×1
  • Duplicated block (34 lines × 2) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:219 — .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:219-252 | scripts/sync-ide-folders.py:403-436 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/sync-ide-folders.py` and `scripts/sync-ide-folders.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 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 (31 lines × 15) · ×1
  • Duplicated block (31 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:350 — .agents/skills/planning-with-files/scripts/inject-plan.py:350-380 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:350-380 | .codex/skills/planning-with-files/scripts/inject-plan.py:350-380 | .cursor/skills/planning-with-files/scripts/inject-plan.py:350-380 | .factory/skills/planning-with-files/scripts/inject-plan.py:350-380 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:350-380 | .opencode/skills/planning-with-files/scripts/inject-plan.py:350-380 | .pi/skills/planning-with-files/scripts/inject-plan.py:350-380 | scripts/inject-plan.py:350-380 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:350-380 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:350-380 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:350-380 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:350-380 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:350-380 | skills/planning-with-files/scripts/inject-plan.py:350-380 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (31 lines × 2) · ×1
  • Duplicated block (31 lines × 2) .hermes/skills/planning-with-files/scripts/session-catchup.py:359 — .hermes/skills/planning-with-files/scripts/session-catchup.py:359-389 | scripts/session-catchup.py:336-366 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 491 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 (30 lines × 15) · ×1
  • Duplicated block (30 lines × 15) .agents/skills/planning-with-files/scripts/session-catchup.py:837 — .agents/skills/planning-with-files/scripts/session-catchup.py:837-866 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:837-866 | .codex/skills/planning-with-files/scripts/session-catchup.py:837-866 | .continue/skills/planning-with-files/scripts/session-catchup.py:837-866 | .cursor/skills/planning-with-files/scripts/session-catchup.py:837-866 | .factory/skills/planning-with-files/scripts/session-catchup.py:837-866 | .gemini/skills/planning-with-files/scripts/session-catchup.py:837-866 | .opencode/skills/planning-with-files/scripts/session-catchup.py:733-762 | .pi/skills/planning-with-files/scripts/session-catchup.py:837-866 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:519-548 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:550-579 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:524-553 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:813-842 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:548-577 | skills/planning-with-files/scripts/session-catchup.py:837-866 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `.agents/skills/planning-with-files/scripts/session-catchup.py:867` calls `get`, `isinstance` and `.opencode/skills/planning-with-files/scripts/session-catchup.py:763` 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 × 2) · ×1
  • Duplicated block (29 lines × 2) .codex/hooks/context_frame.py:260 — .codex/hooks/context_frame.py:260-288 | .hermes/plugins/planning-with-files/context_frame.py:260-288 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (26 lines × 18) · ×1
  • Duplicated block (26 lines × 18) .agents/skills/planning-with-files/scripts/session-catchup.py:276 — .agents/skills/planning-with-files/scripts/session-catchup.py:276-301 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:276-301 | .codex/skills/planning-with-files/scripts/session-catchup.py:276-301 | .continue/skills/planning-with-files/scripts/session-catchup.py:276-301 | .cursor/skills/planning-with-files/scripts/session-catchup.py:276-301 | .factory/skills/planning-with-files/scripts/session-catchup.py:276-301 | .gemini/skills/planning-with-files/scripts/session-catchup.py:276-301 | .hermes/skills/planning-with-files/scripts/session-catchup.py:278-303 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:246-271 | .opencode/skills/planning-with-files/scripts/session-catchup.py:252-277 | .pi/skills/planning-with-files/scripts/session-catchup.py:276-301 | scripts/session-catchup.py:255-280 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:273-298 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:274-299 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:277-302 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:274-299 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:273-298 | skills/planning-with-files/scripts/session-catchup.py:276-301 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 `.agents/skills/planning-with-files/scripts/session-catchup.py:276` 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.
D4 · Code Duplication · Duplicated block (26 lines × 15) · ×1
  • Duplicated block (26 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:840 — .agents/skills/planning-with-files/scripts/inject-plan.py:840-865 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:840-865 | .codex/skills/planning-with-files/scripts/inject-plan.py:840-865 | .cursor/skills/planning-with-files/scripts/inject-plan.py:840-865 | .factory/skills/planning-with-files/scripts/inject-plan.py:840-865 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:840-865 | .opencode/skills/planning-with-files/scripts/inject-plan.py:840-865 | .pi/skills/planning-with-files/scripts/inject-plan.py:840-865 | scripts/inject-plan.py:840-865 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:840-865 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:840-865 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:840-865 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:840-865 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:840-865 | skills/planning-with-files/scripts/inject-plan.py:840-865 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (26 lines × 2) · ×1
  • Duplicated block (26 lines × 2) .hermes/skills/planning-with-files/scripts/session-catchup.py:419 — .hermes/skills/planning-with-files/scripts/session-catchup.py:419-444 | scripts/session-catchup.py:396-421 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 491 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 (25 lines × 15) · ×1
  • Duplicated block (25 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:809 — .agents/skills/planning-with-files/scripts/inject-plan.py:809-833 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:809-833 | .codex/skills/planning-with-files/scripts/inject-plan.py:809-833 | .cursor/skills/planning-with-files/scripts/inject-plan.py:809-833 | .factory/skills/planning-with-files/scripts/inject-plan.py:809-833 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:809-833 | .opencode/skills/planning-with-files/scripts/inject-plan.py:809-833 | .pi/skills/planning-with-files/scripts/inject-plan.py:809-833 | scripts/inject-plan.py:809-833 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:809-833 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:809-833 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:809-833 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:809-833 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:809-833 | skills/planning-with-files/scripts/inject-plan.py:809-833 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (20–25 lines × 10) · ×1
  • Duplicated block (20–25 lines × 10) .agents/skills/planning-with-files/scripts/session-catchup.py:807 — .agents/skills/planning-with-files/scripts/session-catchup.py:807-831 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:807-831 | .codex/skills/planning-with-files/scripts/session-catchup.py:807-831 | .continue/skills/planning-with-files/scripts/session-catchup.py:807-831 | .cursor/skills/planning-with-files/scripts/session-catchup.py:807-831 | .factory/skills/planning-with-files/scripts/session-catchup.py:807-831 | .gemini/skills/planning-with-files/scripts/session-catchup.py:807-831 | .pi/skills/planning-with-files/scripts/session-catchup.py:807-831 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:788-807 | skills/planning-with-files/scripts/session-catchup.py:807-831 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (25 lines × 2) · ×1
  • Duplicated block (25 lines × 2) .codex/hooks/context_frame.py:292 — .codex/hooks/context_frame.py:292-316 | .hermes/plugins/planning-with-files/context_frame.py:292-316 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (22 lines × 2) · ×1
  • Duplicated block (22 lines × 2) .hermes/skills/planning-with-files/scripts/session-catchup.py:452 — .hermes/skills/planning-with-files/scripts/session-catchup.py:452-473 | scripts/session-catchup.py:429-450 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 26 separate duplicated blocks between them, totalling at least 491 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 `.hermes/skills/planning-with-files/scripts/session-catchup.py:452` 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 (21 lines × 15) · ×1
  • Duplicated block (21 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:1703 — .agents/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .codex/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .cursor/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .factory/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .opencode/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | .pi/skills/planning-with-files/scripts/inject-plan.py:1703-1723 | scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:1703-1723 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:1703-1723 | skills/planning-with-files/scripts/inject-plan.py:1703-1723 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 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 (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) .codex/hooks/context_frame.py:228 — .codex/hooks/context_frame.py:228-248 | .hermes/plugins/planning-with-files/context_frame.py:228-248 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (20 lines × 15) · ×1
  • Duplicated block (20 lines × 15) .agents/skills/planning-with-files/scripts/inject-plan.py:278 — .agents/skills/planning-with-files/scripts/inject-plan.py:278-297 | .codebuddy/skills/planning-with-files/scripts/inject-plan.py:278-297 | .codex/skills/planning-with-files/scripts/inject-plan.py:278-297 | .cursor/skills/planning-with-files/scripts/inject-plan.py:278-297 | .factory/skills/planning-with-files/scripts/inject-plan.py:278-297 | .mastracode/skills/planning-with-files/scripts/inject-plan.py:278-297 | .opencode/skills/planning-with-files/scripts/inject-plan.py:278-297 | .pi/skills/planning-with-files/scripts/inject-plan.py:278-297 | scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-ar/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-de/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-es/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-zh/scripts/inject-plan.py:278-297 | skills/i18n/planning-with-files-zht/scripts/inject-plan.py:278-297 | skills/planning-with-files/scripts/inject-plan.py:278-297 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/inject-plan.py` and `.codebuddy/skills/planning-with-files/scripts/inject-plan.py` as WHOLE FILES: this scan already matched 40 separate duplicated blocks between them, totalling at least 1397 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. The two sit in different directories, so one cannot simply be deleted in favour of the other while both are reached separately: hoist the shared part into a location both already depend on and have each file call it, and retire whichever file turns out to have no caller of its own left. Extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (19 lines × 18) · ×1
  • Duplicated block (19 lines × 18) .agents/skills/planning-with-files/scripts/session-catchup.py:220 — .agents/skills/planning-with-files/scripts/session-catchup.py:220-238 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:220-238 | .codex/skills/planning-with-files/scripts/session-catchup.py:220-238 | .continue/skills/planning-with-files/scripts/session-catchup.py:220-238 | .cursor/skills/planning-with-files/scripts/session-catchup.py:220-238 | .factory/skills/planning-with-files/scripts/session-catchup.py:220-238 | .gemini/skills/planning-with-files/scripts/session-catchup.py:220-238 | .hermes/skills/planning-with-files/scripts/session-catchup.py:193-211 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:161-179 | .opencode/skills/planning-with-files/scripts/session-catchup.py:196-214 | .pi/skills/planning-with-files/scripts/session-catchup.py:220-238 | scripts/session-catchup.py:199-217 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:217-235 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:218-236 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:221-239 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:219-237 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:218-236 | skills/planning-with-files/scripts/session-catchup.py:220-238 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (15–18 lines × 13) · ×1
  • Duplicated block (15–18 lines × 13) .agents/skills/planning-with-files/scripts/session-catchup.py:667 — .agents/skills/planning-with-files/scripts/session-catchup.py:667-681 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:667-681 | .codex/skills/planning-with-files/scripts/session-catchup.py:667-681 | .continue/skills/planning-with-files/scripts/session-catchup.py:667-681 | .cursor/skills/planning-with-files/scripts/session-catchup.py:667-681 | .factory/skills/planning-with-files/scripts/session-catchup.py:667-681 | .gemini/skills/planning-with-files/scripts/session-catchup.py:667-681 | .hermes/skills/planning-with-files/scripts/session-catchup.py:563-580 | .opencode/skills/planning-with-files/scripts/session-catchup.py:592-606 | .pi/skills/planning-with-files/scripts/session-catchup.py:667-681 | scripts/session-catchup.py:686-700 | scripts/session-catchup.py:793-810 | skills/planning-with-files/scripts/session-catchup.py:667-681 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (18 lines × 12) · ×1
  • Duplicated block (18 lines × 12) .agents/skills/planning-with-files/scripts/session-catchup.py:606 — .agents/skills/planning-with-files/scripts/session-catchup.py:606-623 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:606-623 | .codex/skills/planning-with-files/scripts/session-catchup.py:606-623 | .continue/skills/planning-with-files/scripts/session-catchup.py:606-623 | .cursor/skills/planning-with-files/scripts/session-catchup.py:606-623 | .factory/skills/planning-with-files/scripts/session-catchup.py:606-623 | .gemini/skills/planning-with-files/scripts/session-catchup.py:606-623 | .opencode/skills/planning-with-files/scripts/session-catchup.py:531-548 | .pi/skills/planning-with-files/scripts/session-catchup.py:606-623 | scripts/session-catchup.py:625-642 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:590-607 | skills/planning-with-files/scripts/session-catchup.py:606-623 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (17 lines × 18) · ×1
  • Duplicated block (17 lines × 18) .agents/skills/planning-with-files/scripts/session-catchup.py:509 — .agents/skills/planning-with-files/scripts/session-catchup.py:509-525 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:509-525 | .codex/skills/planning-with-files/scripts/session-catchup.py:509-525 | .continue/skills/planning-with-files/scripts/session-catchup.py:509-525 | .cursor/skills/planning-with-files/scripts/session-catchup.py:509-525 | .factory/skills/planning-with-files/scripts/session-catchup.py:509-525 | .gemini/skills/planning-with-files/scripts/session-catchup.py:509-525 | .hermes/skills/planning-with-files/scripts/session-catchup.py:243-259 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:211-227 | .opencode/skills/planning-with-files/scripts/session-catchup.py:434-450 | .pi/skills/planning-with-files/scripts/session-catchup.py:509-525 | scripts/session-catchup.py:522-538 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:611-627 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:529-545 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:619-635 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:500-516 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:527-543 | skills/planning-with-files/scripts/session-catchup.py:509-525 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (12–17 lines × 10) · ×1
  • Duplicated block (12–17 lines × 10) .agents/skills/planning-with-files/scripts/session-catchup.py:450 — .agents/skills/planning-with-files/scripts/session-catchup.py:450-466 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:450-466 | .codex/skills/planning-with-files/scripts/session-catchup.py:450-466 | .continue/skills/planning-with-files/scripts/session-catchup.py:450-466 | .cursor/skills/planning-with-files/scripts/session-catchup.py:450-466 | .factory/skills/planning-with-files/scripts/session-catchup.py:450-466 | .gemini/skills/planning-with-files/scripts/session-catchup.py:450-466 | .pi/skills/planning-with-files/scripts/session-catchup.py:450-466 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:446-457 | skills/planning-with-files/scripts/session-catchup.py:450-466 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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–16 lines × 12) · ×1
  • Duplicated block (10–16 lines × 12) .agents/skills/planning-with-files/scripts/session-catchup.py:411 — .agents/skills/planning-with-files/scripts/session-catchup.py:411-420 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:411-420 | .codex/skills/planning-with-files/scripts/session-catchup.py:411-420 | .continue/skills/planning-with-files/scripts/session-catchup.py:411-420 | .cursor/skills/planning-with-files/scripts/session-catchup.py:411-420 | .factory/skills/planning-with-files/scripts/session-catchup.py:411-420 | .gemini/skills/planning-with-files/scripts/session-catchup.py:411-420 | .opencode/skills/planning-with-files/scripts/session-catchup.py:387-396 | .pi/skills/planning-with-files/scripts/session-catchup.py:411-420 | scripts/session-catchup.py:465-480 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:408-417 | skills/planning-with-files/scripts/session-catchup.py:411-420 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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–16 lines × 12) · ×1
  • Duplicated block (15–16 lines × 12) .agents/skills/planning-with-files/scripts/session-catchup.py:547 — .agents/skills/planning-with-files/scripts/session-catchup.py:547-561 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:547-561 | .codex/skills/planning-with-files/scripts/session-catchup.py:547-561 | .continue/skills/planning-with-files/scripts/session-catchup.py:547-561 | .cursor/skills/planning-with-files/scripts/session-catchup.py:547-561 | .factory/skills/planning-with-files/scripts/session-catchup.py:547-561 | .gemini/skills/planning-with-files/scripts/session-catchup.py:547-561 | .opencode/skills/planning-with-files/scripts/session-catchup.py:472-486 | .pi/skills/planning-with-files/scripts/session-catchup.py:547-561 | scripts/session-catchup.py:565-580 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:533-547 | skills/planning-with-files/scripts/session-catchup.py:547-561 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (16 lines × 12) · ×1
  • Duplicated block (16 lines × 12) .agents/skills/planning-with-files/scripts/session-catchup.py:673 — .agents/skills/planning-with-files/scripts/session-catchup.py:673-688 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:673-688 | .codex/skills/planning-with-files/scripts/session-catchup.py:673-688 | .continue/skills/planning-with-files/scripts/session-catchup.py:673-688 | .cursor/skills/planning-with-files/scripts/session-catchup.py:673-688 | .factory/skills/planning-with-files/scripts/session-catchup.py:673-688 | .gemini/skills/planning-with-files/scripts/session-catchup.py:673-688 | .opencode/skills/planning-with-files/scripts/session-catchup.py:598-613 | .pi/skills/planning-with-files/scripts/session-catchup.py:673-688 | scripts/session-catchup.py:692-707 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:654-669 | skills/planning-with-files/scripts/session-catchup.py:673-688 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (16 lines × 11) · ×1
  • Duplicated block (16 lines × 11) .agents/skills/planning-with-files/scripts/session-catchup.py:392 — .agents/skills/planning-with-files/scripts/session-catchup.py:392-407 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:392-407 | .codex/skills/planning-with-files/scripts/session-catchup.py:392-407 | .continue/skills/planning-with-files/scripts/session-catchup.py:392-407 | .cursor/skills/planning-with-files/scripts/session-catchup.py:392-407 | .factory/skills/planning-with-files/scripts/session-catchup.py:392-407 | .gemini/skills/planning-with-files/scripts/session-catchup.py:392-407 | .opencode/skills/planning-with-files/scripts/session-catchup.py:368-383 | .pi/skills/planning-with-files/scripts/session-catchup.py:392-407 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:389-404 | skills/planning-with-files/scripts/session-catchup.py:392-407 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (15 lines × 6) · ×1
  • Duplicated block (15 lines × 6) .mastracode/skills/planning-with-files/scripts/session-catchup.py:367 — .mastracode/skills/planning-with-files/scripts/session-catchup.py:367-381 | .opencode/skills/planning-with-files/scripts/session-catchup.py:765-779 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:551-565 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:582-596 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:556-570 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:580-594 — before extracting anything, compare `.mastracode/skills/planning-with-files/scripts/session-catchup.py` and `.opencode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 12 separate duplicated blocks between them, totalling at least 147 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 `.mastracode/skills/planning-with-files/scripts/session-catchup.py:367` 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 (14 lines × 3) · ×1
  • Duplicated block (14 lines × 3) .hermes/skills/planning-with-files/scripts/session-catchup.py:61 — .hermes/skills/planning-with-files/scripts/session-catchup.py:61-74 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:34-47 | scripts/session-catchup.py:67-80 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 237 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 (12 lines × 4) · ×1
  • Duplicated block (12 lines × 4) skills/i18n/planning-with-files-ar/scripts/session-catchup.py:388 — skills/i18n/planning-with-files-ar/scripts/session-catchup.py:388-399 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:390-401 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:393-404 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:388-399 — before extracting anything, compare `skills/i18n/planning-with-files-ar/scripts/session-catchup.py` and `skills/i18n/planning-with-files-de/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 35 separate duplicated blocks between them, totalling at least 531 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 (12 lines × 3) · ×1
  • Duplicated block (12 lines × 3) .hermes/skills/planning-with-files/scripts/session-catchup.py:178 — .hermes/skills/planning-with-files/scripts/session-catchup.py:178-189 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:146-157 | scripts/session-catchup.py:184-195 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 237 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 × 2) · ×1
  • Duplicated block (10–11 lines × 2) .hermes/plugins/planning-with-files/paths.py:80 — .hermes/plugins/planning-with-files/paths.py:80-89 | .hermes/plugins/planning-with-files/paths.py:104-114 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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, `.hermes/plugins/planning-with-files/paths.py:102` calls `find_skill_dir`, `has_skill_assets` and `.hermes/plugins/planning-with-files/paths.py:79` 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 (10 lines × 11) · ×1
  • Duplicated block (10 lines × 11) .agents/skills/planning-with-files/scripts/session-catchup.py:470 — .agents/skills/planning-with-files/scripts/session-catchup.py:470-479 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:470-479 | .codex/skills/planning-with-files/scripts/session-catchup.py:470-479 | .continue/skills/planning-with-files/scripts/session-catchup.py:470-479 | .cursor/skills/planning-with-files/scripts/session-catchup.py:470-479 | .factory/skills/planning-with-files/scripts/session-catchup.py:470-479 | .gemini/skills/planning-with-files/scripts/session-catchup.py:470-479 | .pi/skills/planning-with-files/scripts/session-catchup.py:470-479 | scripts/session-catchup.py:484-493 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:461-470 | skills/planning-with-files/scripts/session-catchup.py:470-479 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `data` to `Dict[str, Any]` in one and `Dict` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `.agents/skills/planning-with-files/scripts/session-catchup.py:481` calls `_opencode_state_annotation` and `scripts/session-catchup.py:495` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (9 lines × 16) · ×1
  • Duplicated block (9 lines × 16) .agents/skills/planning-with-files/scripts/session-catchup.py:745 — .agents/skills/planning-with-files/scripts/session-catchup.py:745-753 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:745-753 | .codex/skills/planning-with-files/scripts/session-catchup.py:745-753 | .continue/skills/planning-with-files/scripts/session-catchup.py:745-753 | .cursor/skills/planning-with-files/scripts/session-catchup.py:745-753 | .factory/skills/planning-with-files/scripts/session-catchup.py:745-753 | .gemini/skills/planning-with-files/scripts/session-catchup.py:745-753 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:305-313 | .opencode/skills/planning-with-files/scripts/session-catchup.py:670-678 | .pi/skills/planning-with-files/scripts/session-catchup.py:745-753 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:456-464 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:458-466 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:461-469 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:726-734 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:456-464 | skills/planning-with-files/scripts/session-catchup.py:745-753 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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, `.agents/skills/planning-with-files/scripts/session-catchup.py:742` calls `get`, `isinstance` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py:304` 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 × 18) · ×1
  • Duplicated block (8 lines × 18) .agents/skills/planning-with-files/scripts/session-catchup.py:993 — .agents/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .codex/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .continue/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .cursor/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .factory/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .gemini/skills/planning-with-files/scripts/session-catchup.py:993-1000 | .hermes/skills/planning-with-files/scripts/session-catchup.py:587-594 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:462-469 | .opencode/skills/planning-with-files/scripts/session-catchup.py:884-891 | .pi/skills/planning-with-files/scripts/session-catchup.py:993-1000 | scripts/session-catchup.py:817-824 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:694-701 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:696-703 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:703-710 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:965-972 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:694-701 | skills/planning-with-files/scripts/session-catchup.py:993-1000 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (8 lines × 12) · ×1
  • Duplicated block (8 lines × 12) .agents/skills/planning-with-files/scripts/session-catchup.py:664 — .agents/skills/planning-with-files/scripts/session-catchup.py:664-671 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:664-671 | .codex/skills/planning-with-files/scripts/session-catchup.py:664-671 | .continue/skills/planning-with-files/scripts/session-catchup.py:664-671 | .cursor/skills/planning-with-files/scripts/session-catchup.py:664-671 | .factory/skills/planning-with-files/scripts/session-catchup.py:664-671 | .gemini/skills/planning-with-files/scripts/session-catchup.py:664-671 | .opencode/skills/planning-with-files/scripts/session-catchup.py:589-596 | .pi/skills/planning-with-files/scripts/session-catchup.py:664-671 | scripts/session-catchup.py:683-690 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:645-652 | skills/planning-with-files/scripts/session-catchup.py:664-671 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (8 lines × 2) · ×1
  • Duplicated block (8 lines × 2) .codex/hooks/context_frame.py:215 — .codex/hooks/context_frame.py:215-222 | .hermes/plugins/planning-with-files/context_frame.py:215-222 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (7 lines × 18) · ×1
  • Duplicated block (7 lines × 18) .agents/skills/planning-with-files/scripts/session-catchup.py:166 — .agents/skills/planning-with-files/scripts/session-catchup.py:166-172 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:166-172 | .codex/skills/planning-with-files/scripts/session-catchup.py:166-172 | .continue/skills/planning-with-files/scripts/session-catchup.py:166-172 | .cursor/skills/planning-with-files/scripts/session-catchup.py:166-172 | .factory/skills/planning-with-files/scripts/session-catchup.py:166-172 | .gemini/skills/planning-with-files/scripts/session-catchup.py:166-172 | .hermes/skills/planning-with-files/scripts/session-catchup.py:103-109 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:76-82 | .opencode/skills/planning-with-files/scripts/session-catchup.py:142-148 | .pi/skills/planning-with-files/scripts/session-catchup.py:166-172 | scripts/session-catchup.py:109-115 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:163-169 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:164-170 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:167-173 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:165-171 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:164-170 | skills/planning-with-files/scripts/session-catchup.py:166-172 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 × 8) · ×1
  • Duplicated block (7 lines × 8) .hermes/skills/planning-with-files/scripts/session-catchup.py:450 — .hermes/skills/planning-with-files/scripts/session-catchup.py:450-456 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:365-371 | .opencode/skills/planning-with-files/scripts/session-catchup.py:763-769 | scripts/session-catchup.py:427-433 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:549-555 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:580-586 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:554-560 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:578-584 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/session-catchup.py` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 17 separate duplicated blocks between them, totalling at least 237 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, `.opencode/skills/planning-with-files/scripts/session-catchup.py:761` calls `isinstance` and `.mastracode/skills/planning-with-files/scripts/session-catchup.py:364` 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 (5 lines × 2) · ×1
  • Duplicated block (5 lines × 2) .opencode/skills/planning-with-files/scripts/session-catchup.py:413 — .opencode/skills/planning-with-files/scripts/session-catchup.py:413-417 | scripts/session-catchup.py:500-504 — before extracting anything, compare `.opencode/skills/planning-with-files/scripts/session-catchup.py` and `scripts/session-catchup.py` as WHOLE FILES: this scan already matched 20 separate duplicated blocks between them, totalling at least 302 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 (18 lines × 14) · ×1
  • Duplicated block (18 lines × 14) .agents/skills/planning-with-files/scripts/session-catchup.py:24 — .agents/skills/planning-with-files/scripts/session-catchup.py:24-41 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:24-41 | .codex/skills/planning-with-files/scripts/session-catchup.py:24-41 | .continue/skills/planning-with-files/scripts/session-catchup.py:24-41 | .cursor/skills/planning-with-files/scripts/session-catchup.py:24-41 | .factory/skills/planning-with-files/scripts/session-catchup.py:24-41 | .gemini/skills/planning-with-files/scripts/session-catchup.py:24-41 | .pi/skills/planning-with-files/scripts/session-catchup.py:24-41 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:21-38 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:22-39 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:25-42 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:23-40 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:22-39 | skills/planning-with-files/scripts/session-catchup.py:24-41 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (12 lines × 18) · ×1
  • Duplicated block (12 lines × 18) .agents/skills/planning-with-files/scripts/session-catchup.py:102 — .agents/skills/planning-with-files/scripts/session-catchup.py:102-118 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:102-118 | .codex/skills/planning-with-files/scripts/session-catchup.py:102-118 | .continue/skills/planning-with-files/scripts/session-catchup.py:102-118 | .cursor/skills/planning-with-files/scripts/session-catchup.py:102-118 | .factory/skills/planning-with-files/scripts/session-catchup.py:102-118 | .gemini/skills/planning-with-files/scripts/session-catchup.py:102-118 | .hermes/skills/planning-with-files/scripts/session-catchup.py:78-89 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:51-62 | .opencode/skills/planning-with-files/scripts/session-catchup.py:78-94 | .pi/skills/planning-with-files/scripts/session-catchup.py:102-118 | scripts/session-catchup.py:84-95 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:99-115 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:100-116 | skills/i18n/planning-with-files-es/scripts/session-catchup.py:103-119 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:101-117 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:100-116 | skills/planning-with-files/scripts/session-catchup.py:102-118 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (6 lines × 17) · ×1
  • Duplicated block (6 lines × 17) .agents/skills/planning-with-files/scripts/session-catchup.py:500 — .agents/skills/planning-with-files/scripts/session-catchup.py:500-505 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:500-505 | .codex/skills/planning-with-files/scripts/session-catchup.py:500-505 | .continue/skills/planning-with-files/scripts/session-catchup.py:500-505 | .cursor/skills/planning-with-files/scripts/session-catchup.py:500-505 | .factory/skills/planning-with-files/scripts/session-catchup.py:500-505 | .gemini/skills/planning-with-files/scripts/session-catchup.py:500-505 | .hermes/skills/planning-with-files/scripts/session-catchup.py:234-239 | .mastracode/skills/planning-with-files/scripts/session-catchup.py:202-207 | .opencode/skills/planning-with-files/scripts/session-catchup.py:425-430 | .pi/skills/planning-with-files/scripts/session-catchup.py:500-505 | scripts/session-catchup.py:513-518 | skills/i18n/planning-with-files-ar/scripts/session-catchup.py:602-607 | skills/i18n/planning-with-files-de/scripts/session-catchup.py:520-525 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:491-496 | skills/i18n/planning-with-files-zht/scripts/session-catchup.py:518-523 | skills/planning-with-files/scripts/session-catchup.py:500-505 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 (6 lines × 2) · ×1
  • Duplicated block (6 lines × 2) .codex/hooks/context_frame.py:199 — .codex/hooks/context_frame.py:199-204 | .hermes/plugins/planning-with-files/context_frame.py:199-204 — before extracting anything, compare `.codex/hooks/context_frame.py` and `.hermes/plugins/planning-with-files/context_frame.py` as WHOLE FILES: this scan already matched 11 separate duplicated blocks between them, totalling at least 229 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 (18 lines × 2) · ×1
  • Duplicated block (18 lines × 2) .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:198 — .hermes/skills/planning-with-files/scripts/sync-ide-folders.py:198-215 | scripts/sync-ide-folders.py:382-399 — before extracting anything, compare `.hermes/skills/planning-with-files/scripts/sync-ide-folders.py` and `scripts/sync-ide-folders.py` as WHOLE FILES: this scan already matched 6 separate duplicated blocks between them, totalling at least 151 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 (9 lines × 10) · ×1
  • Duplicated block (9 lines × 10) .agents/skills/planning-with-files/scripts/session-catchup.py:871 — .agents/skills/planning-with-files/scripts/session-catchup.py:871-879 | .codebuddy/skills/planning-with-files/scripts/session-catchup.py:871-879 | .codex/skills/planning-with-files/scripts/session-catchup.py:871-879 | .continue/skills/planning-with-files/scripts/session-catchup.py:871-879 | .cursor/skills/planning-with-files/scripts/session-catchup.py:871-879 | .factory/skills/planning-with-files/scripts/session-catchup.py:871-879 | .gemini/skills/planning-with-files/scripts/session-catchup.py:871-879 | .pi/skills/planning-with-files/scripts/session-catchup.py:871-879 | skills/i18n/planning-with-files-zh/scripts/session-catchup.py:845-853 | skills/planning-with-files/scripts/session-catchup.py:871-879 — before extracting anything, compare `.agents/skills/planning-with-files/scripts/session-catchup.py` and `.codebuddy/skills/planning-with-files/scripts/session-catchup.py` as WHOLE FILES: this scan already matched 49 separate duplicated blocks between them, totalling at least 881 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 `.agents/skills/planning-with-files/scripts/session-catchup.py:871` 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 (6 lines × 3) · ×1
  • Duplicated block (6 lines × 3) REDACTED:623 — REDACTED:623-628 | REDACTED:631-636 | REDACTED:641-646 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `REDACTED:640` calls `copytree` and `REDACTED:631` 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.
D8 · Code Coverage · Coverage not measured · ×1
  • Coverage not measured — JavaScript/TypeScript suite — Coverage NOT MEASURED: the JavaScript/TypeScript half could not be measured — .dsh/packages/dsh-planning-with-files/ runs vitest but declares no coverage provider, so the suite can run and still produce no lcov — add `@vitest/coverage-v8` (or `@vitest/coverage-istanbul`) as a devDependency. Coverage is excluded from the score rather than counted as a near-zero. The named suite step is one the repository's maintainers can perform; once it passes, the real number is measured on the next scan. Alternatively, commit the lcov/Cobertura report your CI produces and it is read without a re-run.
Minor — 79 finding(s)
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×34
  • Silent fallback default on parse failure .agents/skills/planning-with-files/scripts/inject-plan.py:154 — `slug_is_valid` returns `False` when `UnicodeDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .agents/skills/planning-with-files/scripts/inject-plan.py:208 — `canonicalize` returns `''` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .agents/skills/planning-with-files/scripts/inject-plan.py:224 — `mtime_seconds` returns `0` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .agents/skills/planning-with-files/scripts/inject-plan.py:341 — `_inside` returns `False` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .agents/skills/planning-with-files/scripts/inject-plan.py:767 — `hook_is_main` returns `False` when `(ValueError, UnicodeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codebuddy/skills/planning-with-files/scripts/inject-plan.py:154 — `slug_is_valid` returns `False` when `UnicodeDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codebuddy/skills/planning-with-files/scripts/inject-plan.py:208 — `canonicalize` returns `''` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codebuddy/skills/planning-with-files/scripts/inject-plan.py:224 — `mtime_seconds` returns `0` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codebuddy/skills/planning-with-files/scripts/inject-plan.py:341 — `_inside` returns `False` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codebuddy/skills/planning-with-files/scripts/inject-plan.py:767 — `hook_is_main` returns `False` when `(ValueError, UnicodeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codex/hooks/codex_hook_adapter.py:37 — `load_payload` returns `{}` when `json.JSONDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codex/hooks/codex_hook_adapter.py:293 — `parse_json` returns `{}` when `json.JSONDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codex/skills/planning-with-files/scripts/inject-plan.py:154 — `slug_is_valid` returns `False` when `UnicodeDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codex/skills/planning-with-files/scripts/inject-plan.py:208 — `canonicalize` returns `''` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codex/skills/planning-with-files/scripts/inject-plan.py:224 — `mtime_seconds` returns `0` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codex/skills/planning-with-files/scripts/inject-plan.py:341 — `_inside` returns `False` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .codex/skills/planning-with-files/scripts/inject-plan.py:767 — `hook_is_main` returns `False` when `(ValueError, UnicodeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .cursor/skills/planning-with-files/scripts/inject-plan.py:154 — `slug_is_valid` returns `False` when `UnicodeDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .cursor/skills/planning-with-files/scripts/inject-plan.py:208 — `canonicalize` returns `''` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .cursor/skills/planning-with-files/scripts/inject-plan.py:224 — `mtime_seconds` returns `0` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .cursor/skills/planning-with-files/scripts/inject-plan.py:341 — `_inside` returns `False` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .cursor/skills/planning-with-files/scripts/inject-plan.py:767 — `hook_is_main` returns `False` when `(ValueError, UnicodeError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .factory/skills/planning-with-files/scripts/inject-plan.py:154 — `slug_is_valid` returns `False` when `UnicodeDecodeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .factory/skills/planning-with-files/scripts/inject-plan.py:208 — `canonicalize` returns `''` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure .factory/skills/planning-with-files/scripts/inject-plan.py:224 — `mtime_seconds` returns `0` when `(OSError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • + 9 more in this group — see findings.md.
X10 · Duplicated predicate · Duplicated predicate · ×25
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:66 — `!!st && st.isDirectory() && !st.isSymbolicLink()` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:61 — `!!st && st.isFile() && !st.isSymbolicLink()` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:431 — `!MODE_LOWERING_TOKENS.has(token) && !effective.includes(token)` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:429 — `!MODE_LOWERING_TOKENS.has(token) || floor.includes(token)` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:816 — `!candidate || candidate.startsWith("<!--")` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:152 — `!path.isAbsolute(pin) || pin.startsWith("\\\\") || pin.startsWith("//")` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:166 — `!realCandidate || !realRoot || !isInside(realCandidate, realRoot)` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:96 — `!st || !st.isFile() || st.isSymbolicLink() || st.nlink > 1 || !real || !isInside(real, realRoot)` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:156 — `!st || st.isSymbolicLink() || !st.isDirectory()` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:312 — `chosen === null && isRegularFile(path.join(root, "task_plan.md"))` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:550 — `counts.total <= 0 || counts.in_progress <= 0` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:862 — `counts.total > 0 && counts.complete >= counts.total` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:677 — `env.HOME || env.USERPROFILE || os.homedir()` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:678 — `env.XDG_CONFIG_HOME || path.join(home, ".config")` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:820 — `firstInProgressPhase(text) || "No phase found"` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:558 — `firstInProgressPhase(text) || "unknown phase"` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:233 — `isRealDir(path.join(planningRoot, "sessions")) && isRegularFile(path.join(root, "task_plan.md"))` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:210 — `isRealDir(slugDir) && isRegularFile(path.join(slugDir, "task_plan.md"))` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:513 — `line.includes("**Status:** in_progress") || line.includes("[in_progress]")` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:762 — `mode !== "" && mode !== "autonomous" && mode !== "gated"` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:527 — `n.startsWith("ledger-") && n.endsWith(".jsonl")` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:154 — `process.platform === "win32" && /^[\\/]/.test(pin)` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:133 — `rel === "" || (!rel.startsWith("..") && !path.isAbsolute(rel))` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:722 — `template !== "default" && isRegularFile(prefixed)` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
  • Duplicated predicate .dsh/packages/dsh-planning-with-files/src/core.ts:843 — `verified !== null && verified.ok && verified.attestationValid` appears character-identically in 2 files — .dsh/packages/dsh-planning-with-files/src/core.ts, .opencode/packages/opencode-planning-with-files/src/core.ts. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
X6 · Hand-rolled structured-format parsing · Hand-rolled JSON/XML parsing via regex · ×7
  • Hand-rolled JSON/XML parsing via regex skills/planning-with-files/scripts/session-catchup.py:130 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex skills/i18n/planning-with-files-zht/scripts/session-catchup.py:128 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex skills/i18n/planning-with-files-zh/scripts/session-catchup.py:129 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex skills/i18n/planning-with-files-es/scripts/session-catchup.py:131 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex skills/i18n/planning-with-files-de/scripts/session-catchup.py:128 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex skills/i18n/planning-with-files-ar/scripts/session-catchup.py:127 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
  • Hand-rolled JSON/XML parsing via regex scripts/bump-version.py:117 — A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
X7 · Silent fallback defaults · Silent fallback default in catch · ×6
  • Silent fallback default in catch .agents/skills/planning-with-files/scripts/inject-plan.py:1771 — `main` swallows every exception into `return 3` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch .codebuddy/skills/planning-with-files/scripts/inject-plan.py:1771 — `main` swallows every exception into `return 3` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch .codex/skills/planning-with-files/scripts/inject-plan.py:1771 — `main` swallows every exception into `return 3` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch .cursor/skills/planning-with-files/scripts/inject-plan.py:1771 — `main` swallows every exception into `return 3` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch .factory/skills/planning-with-files/scripts/inject-plan.py:1771 — `main` swallows every exception into `return 3` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch .mastracode/skills/planning-with-files/scripts/inject-plan.py:1771 — `main` swallows every exception into `return 3` — 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.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 11 significant file(s) lose their only recent owner: skills/planning-with-files/scripts/inject-plan.py, skills/i18n/planning-with-files-zht/scripts/inject-plan.py, skills/i18n/planning-with-files-zh/scripts/inject-plan.py, skills/i18n/planning-with-files-es/scripts/inject-plan.py, skills/i18n/planning-with-files-de/scripts/inject-plan.py, skills/i18n/planning-with-files-ar/scripts/inject-plan.py, scripts/inject-plan.py, skills/i18n/planning-with-files-ar/scripts/session-catchup.py (+3 more). Pair on, review, or document these before any departure.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion — 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (17597 LoC, 110 module-visible types across 27 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
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.
M3 · Folder & project structure · No src/ separation · ×1
  • No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:8 — 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 5315 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.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation .dsh/packages/dsh-planning-with-files/package.json:62 — `.dsh/packages/dsh-planning-with-files/package.json` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-0ac4fab498154db691be135b0a711dca/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-0ac4fab498154db691be135b0a711dca/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 .12artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update35artifacts/raw/trivy-fs.json
D31 · IaC & Container Securitytrivy—trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.0—
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that. semgrep could not parse 2 file(s) — `.opencode/packages/opencode-planning-with-files/src/index.ts`, `.pi/skills/planning-with-files/extensions/planning-with-files/plan.ts` — so the PII/GDPR sweep did not cover the unparsed regions of them; rows reported elsewhere in those files are real.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciestrivy—trivy fs --scanners vuln --format json --quiet --severity CRITICAL,HIGH,MEDIUM,LOW --skip-dirs **/bin/** --skip-dirs **/obj/** . --skip-db-update0artifacts/raw/trivy-fs.json

Run 01a1a568-59a3-7207-899a-0cdbe984d9f8 · 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