Public report of hugohe3/ppt-master, published 25 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 25 October 2026, 07:36 UTC · Survey ID cd_45bcee40478b46b4a58689f14268aa7e
hugohe3/ppt-master
Measured 25 October 2026, 07:33 UTC, at code version 78759bf
No regression since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreAt riskNo change since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 164,472 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 1.2 person-years · Weakest lens: Production Readiness, 37
Findings by how serious they are
24 critical1725 serious61 minor
13 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
25 October 2026, 07:33 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
A critical security finding is open, such as a library with a known critical vulnerability or a password or key found in the code. The score itself is unchanged, but its band shows At risk until the finding is fixed. See the Security and Compliance lens.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
57of 60 dimensions measured by tools. The other 3 are advisory notes from an AI model, which explain the code but don't count towards the score.
1801of 1810 findings point to an exact file and line, so you can open each one in the code. The other 9 concern the repository as a whole, such as missing documentation.
60dimensions across 7 lenses, read from 164,472 lines of product code in 1 project.
hugohe3/ppt-master scores 53 out of 100, but it is rated At risk while a critical security finding is open; the score itself is unchanged.
The weakest lens counts most in the score, and here that is Production Readiness, which scores 37 and is rated Weak. Its CI/CD gates dimension scores 0 out of 10, and until that reaches 4, Production Readiness can't be rated higher than Adequate. The first actions are to resolve the 1 Banned license finding(s) in License Compliance and to add a CI workflow that builds and runs the test suite on every push/PR, and if Production Readiness rose to 70, the score would rise from 53 to about 64.
24 findings are critical: 20 in Forms & labels, three in Dependency Vulnerabilities and one in License Compliance.
Watchdog couldn't measure 11 dimensions in this code, among them Code Coverage, Internal API Consistency and Navigability, so they are left out of the score. The product code is 164,472 lines, which would take an estimated 1.2 person-years, around €180,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Exception handling · Swallowed exception (caught, then discarded) REDACTED
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 22 findings
These 22 critical or serious findings were in the previous survey, on 11 October 2026, and are gone from this one.
Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Rebuild cost: about €180,000 · Estimate
Cost to rebuild
€59,000 to €290,000, for 977 to 3,101 hours of work, about 1.2 person-years for 1 to 3 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 53. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 164,472 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 1 Banned license finding(s) in License Compliance.
Add a CI workflow that builds and runs the test suite on every push/PR.
Raises the score by about 8 points · Medium effort · CI/CD gates
3
Run what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €180,000 to build again, about 1.2 person-years of work. Its weakest lens is Production Readiness, at 37 (Weak). Production Readiness is about whether the product is ready to run in production and to change without breaking. Because the weakest lens counts most in the score, work on Production Readiness also moves the score most.
Based on: the rebuild estimate · the Production Readiness grade · how much each lens counts
What to do: Start with the Production Readiness actions in Top priorities.
If you do one thing first · First action
Resolve the 1 Banned license finding(s) in License Compliance. Of all the actions in this report, it raises the score most for the work it takes: about 5 points for low effort, because it clears the 1 License Compliance 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.8 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 5% to 12% on every change. The history of the code shows how much it changes: about 201,240 lines over the last 90 days, which is about 816,140 lines a year. At that pace, the extra work comes to an estimated 110.8 to 664.7 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: 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.
125 modules, with 87 dependencies between them. Every module uses only modules listed above it, so there are no loops.
The table shows the 40 modules with the most connections; 85 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
image_sources uses image_sources.provider_common, so a change to image_sources.provider_common can break image_sources, while a change to image_sources can't break image_sources.provider_common.
Position
Below the diagonal: image_sources uses a module listed above it, which is the healthy direction.
pptx_shapes.registry uses pptx_shapes.models, so a change to pptx_shapes.models can break pptx_shapes.registry, while a change to pptx_shapes.registry can't break pptx_shapes.models.
Position
Below the diagonal: pptx_shapes.registry uses a module listed above it, which is the healthy direction.
pptx_to_svg.color_resolver uses pptx_to_svg.ooxml_loader, so a change to pptx_to_svg.ooxml_loader can break pptx_to_svg.color_resolver, while a change to pptx_to_svg.color_resolver can't break pptx_to_svg.ooxml_loader.
Position
Below the diagonal: pptx_to_svg.color_resolver uses a module listed above it, which is the healthy direction.
pptx_to_svg.converter uses pptx_workspace, so a change to pptx_workspace can break pptx_to_svg.converter, while a change to pptx_to_svg.converter can't break pptx_workspace.
Position
Below the diagonal: pptx_to_svg.converter uses a module listed above it, which is the healthy direction.
pptx_to_svg.shape_walker uses pptx_to_svg.emu_units, so a change to pptx_to_svg.emu_units can break pptx_to_svg.shape_walker, while a change to pptx_to_svg.shape_walker can't break pptx_to_svg.emu_units.
Position
Below the diagonal: pptx_to_svg.shape_walker uses a module listed above it, which is the healthy direction.
pptx_to_svg.slide_to_svg uses pptx_to_svg.ooxml_loader, so a change to pptx_to_svg.ooxml_loader can break pptx_to_svg.slide_to_svg, while a change to pptx_to_svg.slide_to_svg can't break pptx_to_svg.ooxml_loader.
Position
Below the diagonal: pptx_to_svg.slide_to_svg uses a module listed above it, which is the healthy direction.
svg_authoring_contract uses compact_svg_coordinates, so a change to compact_svg_coordinates can break svg_authoring_contract, while a change to svg_authoring_contract can't break compact_svg_coordinates.
Position
Below the diagonal: svg_authoring_contract uses a module listed above it, which is the healthy direction.
svg_authoring_contract uses compact_svg_styles, so a change to compact_svg_styles can break svg_authoring_contract, while a change to svg_authoring_contract can't break compact_svg_styles.
Position
Below the diagonal: svg_authoring_contract uses a module listed above it, which is the healthy direction.
svg_to_pptx uses svg_to_pptx.drawingml.context, so a change to svg_to_pptx.drawingml.context can break svg_to_pptx, while a change to svg_to_pptx can't break svg_to_pptx.drawingml.context.
Position
Below the diagonal: svg_to_pptx uses a module listed above it, which is the healthy direction.
svg_to_pptx.drawingml uses svg_to_pptx.drawingml.context, so a change to svg_to_pptx.drawingml.context can break svg_to_pptx.drawingml, while a change to svg_to_pptx.drawingml can't break svg_to_pptx.drawingml.context.
Position
Below the diagonal: svg_to_pptx.drawingml uses a module listed above it, which is the healthy direction.
svg_to_pptx.native_objects uses svg_to_pptx.drawingml.context, so a change to svg_to_pptx.drawingml.context can break svg_to_pptx.native_objects, while a change to svg_to_pptx.native_objects can't break svg_to_pptx.drawingml.context.
Position
Below the diagonal: svg_to_pptx.native_objects uses a module listed above it, which is the healthy direction.
svg_to_pptx.native_objects uses svg_to_pptx.native_objects.formula_ast, so a change to svg_to_pptx.native_objects.formula_ast can break svg_to_pptx.native_objects, while a change to svg_to_pptx.native_objects can't break svg_to_pptx.native_objects.formula_ast.
Position
Below the diagonal: svg_to_pptx.native_objects uses a module listed above it, which is the healthy direction.
svg_to_pptx.pptx_package.builder uses svg_to_pptx.pptx_package.template_structure, so a change to svg_to_pptx.pptx_package.template_structure can break svg_to_pptx.pptx_package.builder, while a change to svg_to_pptx.pptx_package.builder can't break svg_to_pptx.pptx_package.template_structure.
Position
Below the diagonal: svg_to_pptx.pptx_package.builder uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses apply_template, so a change to apply_template can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break apply_template.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses authoring_roundtrip, so a change to authoring_roundtrip can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break authoring_roundtrip.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses compact_svg_coordinates, so a change to compact_svg_coordinates can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break compact_svg_coordinates.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses compact_svg_styles, so a change to compact_svg_styles can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break compact_svg_styles.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses extract_svg_pictures, so a change to extract_svg_pictures can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break extract_svg_pictures.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses finalize_svg, so a change to finalize_svg can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break finalize_svg.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses hyperlink_contract, so a change to hyperlink_contract can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break hyperlink_contract.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses image_search, so a change to image_search can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break image_search.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses image_sources.provider_common, so a change to image_sources.provider_common can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break image_sources.provider_common.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses mirror_template_materialize, so a change to mirror_template_materialize can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break mirror_template_materialize.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses narration_sync, so a change to narration_sync can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break narration_sync.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses native_payloads, so a change to native_payloads can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break native_payloads.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses notes_to_audio, so a change to notes_to_audio can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break notes_to_audio.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses pptx_animations, so a change to pptx_animations can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break pptx_animations.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses pptx_embedded_fonts, so a change to pptx_embedded_fonts can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break pptx_embedded_fonts.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses pptx_transitions, so a change to pptx_transitions can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break pptx_transitions.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses pptx_workspace, so a change to pptx_workspace can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break pptx_workspace.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
skills.ppt-master.scripts uses svg_authoring_contract, so a change to svg_authoring_contract can break skills.ppt-master.scripts, while a change to skills.ppt-master.scripts can't break svg_authoring_contract.
Position
Below the diagonal: skills.ppt-master.scripts uses a module listed above it, which is the healthy direction.
pptx_shapes uses pptx_shapes.formula, so a change to pptx_shapes.formula can break pptx_shapes, while a change to pptx_shapes can't break pptx_shapes.formula.
Position
Below the diagonal: pptx_shapes uses a module listed above it, which is the healthy direction.
pptx_shapes uses pptx_shapes.models, so a change to pptx_shapes.models can break pptx_shapes, while a change to pptx_shapes can't break pptx_shapes.models.
Position
Below the diagonal: pptx_shapes uses a module listed above it, which is the healthy direction.
pptx_shapes uses pptx_shapes.registry, so a change to pptx_shapes.registry can break pptx_shapes, while a change to pptx_shapes can't break pptx_shapes.registry.
Position
Below the diagonal: pptx_shapes uses a module listed above it, which is the healthy direction.
pptx_to_svg uses pptx_shapes.formula, so a change to pptx_shapes.formula can break pptx_to_svg, while a change to pptx_to_svg can't break pptx_shapes.formula.
Position
Below the diagonal: pptx_to_svg uses a module listed above it, which is the healthy direction.
pptx_to_svg uses pptx_to_svg.emu_units, so a change to pptx_to_svg.emu_units can break pptx_to_svg, while a change to pptx_to_svg can't break pptx_to_svg.emu_units.
Position
Below the diagonal: pptx_to_svg uses a module listed above it, which is the healthy direction.
pptx_to_svg uses pptx_to_svg.ooxml_loader, so a change to pptx_to_svg.ooxml_loader can break pptx_to_svg, while a change to pptx_to_svg can't break pptx_to_svg.ooxml_loader.
Position
Below the diagonal: pptx_to_svg uses a module listed above it, which is the healthy direction.
pptx_to_svg uses pptx_to_svg.color_resolver, so a change to pptx_to_svg.color_resolver can break pptx_to_svg, while a change to pptx_to_svg can't break pptx_to_svg.color_resolver.
Position
Below the diagonal: pptx_to_svg uses a module listed above it, which is the healthy direction.
pptx_to_svg uses pptx_to_svg.converter, so a change to pptx_to_svg.converter can break pptx_to_svg, while a change to pptx_to_svg can't break pptx_to_svg.converter.
Position
Below the diagonal: pptx_to_svg uses a module listed above it, which is the healthy direction.
pptx_to_svg uses pptx_to_svg.shape_walker, so a change to pptx_to_svg.shape_walker can break pptx_to_svg, while a change to pptx_to_svg can't break pptx_to_svg.shape_walker.
Position
Below the diagonal: pptx_to_svg uses a module listed above it, which is the healthy direction.
pptx_to_svg uses pptx_to_svg.slide_to_svg, so a change to pptx_to_svg.slide_to_svg can break pptx_to_svg, while a change to pptx_to_svg can't break pptx_to_svg.slide_to_svg.
Position
Below the diagonal: pptx_to_svg uses a module listed above it, which is the healthy direction.
svg_to_pptx.pptx_package uses authoring_roundtrip, so a change to authoring_roundtrip can break svg_to_pptx.pptx_package, while a change to svg_to_pptx.pptx_package can't break authoring_roundtrip.
Position
Below the diagonal: svg_to_pptx.pptx_package uses a module listed above it, which is the healthy direction.
svg_to_pptx.pptx_package uses pptx_embedded_fonts, so a change to pptx_embedded_fonts can break svg_to_pptx.pptx_package, while a change to svg_to_pptx.pptx_package can't break pptx_embedded_fonts.
Position
Below the diagonal: svg_to_pptx.pptx_package uses a module listed above it, which is the healthy direction.
svg_to_pptx.pptx_package uses svg_to_pptx.pptx_package.template_structure, so a change to svg_to_pptx.pptx_package.template_structure can break svg_to_pptx.pptx_package, while a change to svg_to_pptx.pptx_package can't break svg_to_pptx.pptx_package.template_structure.
Position
Below the diagonal: svg_to_pptx.pptx_package uses a module listed above it, which is the healthy direction.
svg_to_pptx.pptx_package uses svg_to_pptx.pptx_package.builder, so a change to svg_to_pptx.pptx_package.builder can break svg_to_pptx.pptx_package, while a change to svg_to_pptx.pptx_package can't break svg_to_pptx.pptx_package.builder.
Position
Below the diagonal: svg_to_pptx.pptx_package uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 78% · Adequate · gated by D1, D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A03:2025 — Software Supply Chain Failures
8
High / Critical
A05:2025 — Injection
1
Medium
Roadmap
Establish a CI pipeline to automatically build, test, and run security scans on every push, ensuring security regressions fail the build immediately. Concurrently, resolve the single banned license finding to ensure compliance. Improve accessibility by adding programmatic labels to all form controls and buttons, and maintain a changelog to track release changes.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 1 Banned license finding(s) in License Compliance.
Run what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add so a security regression fails the build instead of landing.
Enforce accessibility over your pages: run an accessibility checker (axe-core, pa11y or Lighthouse) against your HTML in CI and fail the build on new violations — these run as standalone tools without adding a package manifest.
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.
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 — 24
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 — 1725
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 — 61
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 13
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 57 of 60 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 3 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 60 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 1801 of 1810 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.py) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, 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. You can widen what we reach: optional: 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 — then the real number is read on the next scan.
D12 Dependency Hygiene — 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. This repository's 19 shipped Python distribution(s) across 1 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
D16 Bus Factor — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. Single-maintainer repository — bus factor is not applicable (28 contributor(s) across 2200 commit(s) sampled, automation and bot accounts excluded). One of them holds 97% of the history; the other 27 hold 0.1% each on average, below the 5% at which there is somebody to hand the work to. That is a single maintainer with drive-by contributors, not a team whose knowledge has concentrated — so the bus factor is not applicable and there is nothing here for the owner to act on.
D22 Internal API Consistency — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 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 publishes a package — a Claude Code plugin, declared by skills/.claude-plugin/plugin.json — so it DOES have an intentionally-exposed surface: the commands, skills, agents and hooks the plugin contributes to its host, which consumers reach by name. D22 collects code-API surfaces (type and member signatures) only, and has no collector for a plugin's contribution surface, so the consistency of that surface was not judged. That is OUR side and it is a COLLECTOR gap, not an environment fault — no change to the scan image can close it.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
AX1 Captive dependencies — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads Microsoft.Extensions.DependencyInjection registrations in C# and Spring beans in Java/Kotlin only, and no container it models, or knows cannot hold a captive, was found in this repository's source, 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.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check 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.
AXB1 Runtime evidence locked — no reproducible boot — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Subject: 5 markup document(s) — HTML, Razor, JSX, Vue, Svelte or server templates. The Runtime Evidence tier boots an app only via docker-compose, an Aspire AppHost, a Dockerfile, an npm dev script, a web service's own toolchain entry point (cargo, go, dotnet, Python, Spring Boot), or an Android app's own Gradle wrapper (run on an emulator); an Apple or Flutter app needs a host it lacks. None applied, so no live runtime a11y/egress/header evidence was collected. You can widen what we reach: add a docker-compose.yml (or an Aspire AppHost) that brings the app up with its dependencies. Watchdog then boots it in an isolated sandbox and gathers real runtime evidence — you change nothing in your pipeline (no CI step, no SDK).
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
M3 Folder & project structure — measured, with a gap in what it reached — Watchdog measured this, but not all of it. What it did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Whether the tests sit apart from production code is not visible here, because the suite is not in a form this pass reads. The test-separation credit is granted rather than withheld: this is a gap in the analyzer's language coverage, not a finding about the repository's tests. You can widen what we reach: keep the test surface somewhere a reader can find it without opening a binary — an exported/checked-in test source tree beside the production code makes the suite reviewable, diffable and discoverable by tooling.
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 — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These 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.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax 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.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
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 — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned REDACTED, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
AC2 Forms & labels: Label association is read from static markup — a label wired up at runtime (JS-set aria-labelledby, framework-injected ids) reads as missing, a present label says nothing about whether its text is correct. A known UI-library field component (e.g. a JSX <TextField>) is now checked conservatively — flagged only when it carries NO label/aria-label/aria-labelledby/id/name — but wrapper/context-labelled libraries (Chakra/Radix FormControl+FormLabel) aren't statically visible (possible false positive) and non-JSX lowercased components are still skipped. A click handler on a plain element is now asked for a name too (it is a control the author declared), but the subtree test that answers it is deliberately generous: any DYNAMIC text expression in the subtree counts as a name, so an icon chosen by a ternary ({cond ? <IconA/> : <IconB/>}) reads as named, and a glyph component from a library the icon-import list does not know still names its parent. A clean result is "no unlabelled control found", not a labelling proof.
AC3 Page structure: Page structure is read from the static markup tree — landmarks, headings and lang injected at runtime aren't seen, heading ORDER is checked structurally (not against the rendered visual hierarchy), and lang/title/main fire only on full documents, never partials, and the data-table check sees header-cell presence (a <th> exists), not whether each header correctly associates with its cells. Static readiness, not conformance.
AC5 ARIA correctness: ARIA correctness is checked against the static role/attribute shape — roles/attributes set dynamically aren't seen, a valid role says nothing about whether it matches the element's real behaviour, and required-state checks are suppressed when a JSX spread could supply them. The two-branch toggle check (a control whose state is conveyed only by which of two mutually exclusive branches renders) reads CONDITIONALS THAT ARE ATTRIBUTES — Vue v-if/v-else/v-show and Alpine x-if/x-show — so the same toggle written as a Svelte {#if} block or a JSX ternary is control flow the markup model never projects as a branch and is not seen at all.
AC6 Visual & motion safety: Contrast and motion safety are PARTIAL by construction — literal colours (hex/rgb/hsl/named) in inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS top-level declarations are read (same-rule/same-element colour+background pairs only); computed/runtime/theme colour, external-CDN stylesheets, CSS-in-JS dynamic (${…}) and nested-selector colours, cross-element pairs and image contrast stay out of reach, so a clean result is bounded by what the static CSS itself shows.
AC7 A11y enforcement: Enforcement is scored from in-repo config/CI evidence only — an a11y gate enforced in external tooling with no in-repo trace can't be credited, and a configured linter is presence, not proof the rules actually run or block a merge.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
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.
The LLM boundary
LLM-set scores this run (3): D19, D21, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
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.
494 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was builder.create_pptx_with_native_svg at 348. A further 2 method(s) were over the threshold but excluded as flat dispatchers (a long switch/match over independent cases: many branches, almost no nesting), the largest being paths.svg_path_to_absolute at 21 — they are counted neither in the figure above nor in this dimension's score.
+ 489 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 21 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with builder.create_pptx_with_native_svg (cyclomatic 348), cli.main (cyclomatic 309), template_structure.parse_template_slide (cyclomatic 128). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 21 together lifts 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.
Stand up a CI pipeline, then gate Cyclomatic Complexity in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 755 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 84 bodies over 60 down to 60 or less in Cognitive Complexity — start with builder.create_pptx_with_native_svg (cognitive 700), cli.main (cognitive 502), pdf_to_md.extract_pdf_to_markdown (cognitive 270). — 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 84 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.
Stand up a CI pipeline, then gate Cognitive Complexity in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes8.0 / 10Strong✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 68 FileTooLong finding(s) in God Classes — start with REDACTED (2), converter.py (2), cli.py (2). — One of this dimension's main actionable groups (68 warning-level).
Resolve the 4 FunctionTooLong finding(s) in God Classes — start with REDACTED (4). — One of this dimension's main actionable groups (4 warning-level).
Resolve the 2 TooManyMethods finding(s) in God Classes — start with formula_parser.py, cli.py. — One of this dimension's main actionable groups (2 warning-level).
Stand up a CI pipeline, then gate God Classes in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
229 duplicated block group(s) detected. A further 7 rows report members as variants of one another; they aggregate block groups already counted above and are not themselves counted.
+ 92 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 18 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with svg_position_calculator.py (3), authoring_roundtrip.py (2), color_resolver.py (2). — One of this dimension's main actionable groups (18 warning-level).
Resolve the 16 Duplicated block (7 lines × 2) finding(s) in Code Duplication — start with chart_style.py (2), backend_bfl.py, pptx_intake.py. — One of this dimension's main actionable groups (16 warning-level).
Resolve the 14 Duplicated block (5 lines × 2) finding(s) in Code Duplication — start with doc_to_md.py (2), align_embed_images.py (2), batch_validate.py. — One of this dimension's main actionable groups (14 warning-level).
Stand up a CI pipeline, then gate Code Duplication in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. 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.
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.
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.
872 test methods: 872 unit, 0 integration, 0 BDD, 0 e2e. The Python suite contributes 872 test function(s) across 68 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
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.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
What it measures: Whether the licenses of third-party packages are compatible with your policy.
Method: Third-party package licenses resolved from declared package metadata and checked against the configured policy (allow/deny/copyleft). Deterministic; clean = no incompatible license found at metadata depth.
1 of 96 shipped Python distribution(s) use a banned license. Licences were resolved from PyPI over the distributions a consumer installs — this repository's 19 declared runtime requirement(s) closed transitively over each distribution's published `requires_dist` (77 reached that way). Requirements it states ONLY under an extra, a PEP 735 dependency group, a Poetry dev group or a dev-named requirements file are excluded: pip does not install any of them for a consumer. ★ This repository commits no dependency lockfile that this pass reads, so each licence is the one PyPI publishes for the distribution's CURRENT release rather than for a pinned version. 17 of them publish no licence on PyPI this pass can read; that is missing data, not a violation, and none of them is charged.
Banned license: edge-tts
What to do
Resolve the 1 Banned license finding(s) in License Compliance. — One of this dimension's main actionable groups (1 issue-level).
Stand up a CI pipeline, then gate License Compliance in it to reach Verified (currently Documented). — This repository has no CI pipeline, so there is nothing to add a gate to yet — the pipeline comes first. Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d14_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Top hotspots: skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py (49×309=15141); skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py (43×348=14964); skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py (36×107=3852) Repeated repair below the complexity floor: skills/ppt-master/scripts/visual_review.py (4 of 4 changes were fixes); skills/ppt-master/scripts/server_common.py (3 of 4 changes were fixes); skills/ppt-master/scripts/pptx_ooxml/analyzer.py (3 of 4 changes were fixes)
Resolve the 82 Hotspot finding(s) in Churn × Complexity Hotspots — start with cli.py (3), REDACTED (2), converter.py (2). — One of this dimension's main actionable groups (82 warning-level).
Resolve the 7 Repeated repair finding(s) in Churn × Complexity Hotspots — start with visual_review.py, server_common.py, analyzer.py. — One of this dimension's main actionable groups (7 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
0 deducted task-comment markers across 164472 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.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README and the docs/README directories together provide an excellent overview of PPT Master — AI that generates native PowerPoint from any document. The root README is open with a strong value proposition ('I'm open to new opportunities') plus links to star-history.com, Trendshift.io, and a GitHub star badge, followed by a clear project positioning section, sponsor list, and a bulleted roadmap of sections (PPT Master — AI generates native PowerPoint from any document; ❤️ Sponsors; Product Positioning; Built by Hugo He; You Might Also Like; ResearchStudio-<img src= This is a repository of reusable templates for PPT Master: the READMEs document each template directory (charts, decks, icons, layouts, sounds, styles, tables) and describe what they contain without giving an overview of the project or installation/usage guidance. The architecture/design docs are separate markdown files covering planning vocabulary, authoring contracts, and runtime boundaries; these are not shown in the summary but the outline is present for each document. All visible documents are well-structured with headings, a planning/vocabulary section, and commands to run (e.g. `python3 skills/ppt-master/scripts/icon_sync.py`), so content completeness is evident from the visible material. This project is a well-structured open-source workflow tool for generating editable PowerPoint decks from speaker notes and source material. The documentation is comprehensive: the README (16 docs) covers installation, usage, contribution, and licensing; architecture/design documents give full design rationale and decision records; and the core product positioning document defines PPT Master's role as an AI-driven workflow that author or preserve more of PowerPoint's object model than any competing tool. The content is clear, complete, and well-organized with a strong outline for each document. This architecture document is excellent: it defines the four template kinds at the data-model layer, enumerates each kind's workspace root and what it writes/does not write, gives originating workflows for every one, and lists a full outline (Template Architecture: Brand / Style / Layout / Deck; 1. The four kinds; templates/brands/anthropic/templates/design_spec.md; ...; 7. Non-goals) that every named section in the body confirms exists. It also links to an overview guide for user-facing usage, which is a good cross-reference.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
1 of 1 build units (Python) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: 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.
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).
1 finding(s): 0 critical, 0 high, 1 medium, 0 low. semgrep hit a parse error in 4 file(s) — `skills/ppt-master/scripts/confirm_ui/static/app.js`, `REDACTED`, `skills/ppt-master/scripts/svg_quality/checker.py`, `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py` — so no absence of findings in them is evidence of anything, and nothing in them was analysed. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them.
REDACTED
What to do
Resolve the 1 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any dependency has a known published vulnerability (CVE), direct or transitive, in ANY ecosystem the repository declares — Dart pub, Elixir and Erlang via Hex, Go modules, Java and Kotlin via Maven/Gradle, JavaScript/npm, .NET/NuGet, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift.
Method: Dependency-CVE scan across every ecosystem the repository declares, scored ONCE. Three sources are unioned and deduplicated by advisory identity (rule id + alias closure, CVE<->GHSA) scoped to package+version, keeping the worst severity: `osv-scanner --recursive` over osv.dev for Dart pub, Elixir/Hex (and Erlang, whose `rebar.lock` syft first converts to a CycloneDX SBOM the scanner reads, with rows attributed back to the lock), Go, Java and Kotlin via Maven/Gradle (and Scala, whose sbt build's pinned direct declarations are written into a CycloneDX SBOM the scanner reads, with rows attributed back to the build file), npm, PHP/Composer, Python/PyPI, RubyGems, Rust/Cargo and Swift; `trivy fs --scanners vuln` for npm lockfiles; and `dotnet list package --vulnerable --include-transitive` for NuGet (with per-advisory collapse of the project x target-framework fan-out), plus a DECLARED-dependency arm that resolves a published gem's gemspec against rubygems.org where no Gemfile.lock is committed. `SeverityScore(c,h,m,l, normalizer 8.0)`. NotApplicable only when NO ecosystem is readable; if any applicable ecosystem could not be scanned the findings are REPORTED and the score is withheld. Supersedes the npm and OSV arms, retired 2026-09-05.
Resolve the 5 Medium CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (5). — One of this dimension's main actionable groups (5 warning-level).
Resolve the 2 High CVE finding(s) in Dependency Vulnerabilities — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 1 Critical CVE finding(s) in Dependency Vulnerabilities — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Detailed fixes: d30_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
Every significant source file has living knowledge — recently and meaningfully worked. Counted over 214 of the 243 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
Resolve the 4 Change coupling finding(s) in Change Coupling — start with error_helper.py, svg_authoring_view.py, flatten_tspan.py. — One of this dimension's main actionable groups (4 warning-level).
Detailed fixes: d35_recommendation.md · top locations in Appendix A, every location in findings.md.
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.
What it measures: Whether any dependency the repository declares is published as MALICIOUS rather than merely vulnerable — a package that is an attacker's work, in any ecosystem osv-scanner reads. Scored apart from D30 because the answer is binary: there is no safe version to upgrade to, and the fix is to remove the package and rotate every credential it could have read.
Method: The same dependency scan D30 reads, partitioned on the scanner's own classification rather than rescanned: a row is MALICIOUS when its id is in the `MAL-` space (the ossf/malicious-packages feed) OR its `database_specific.cwe_ids` carries `CWE-506` ("Embedded Malicious Code"). Both channels are structural; the summary text is deliberately NOT read, because a malicious-package record whose summary says only "Critical severity vulnerability" is a real shape ([GHSA redacted]) and a text matcher misses it. Scored BINARY: any surviving row is 0, whatever its severity and however many CVEs sit beside it — a hostile dependency is not a quantity. Applicability and degradation are D30's: NotApplicable only when no ecosystem is readable, and an unscannable ecosystem degrades rather than reading clean. SCORED, not informational.
What it measures: Whether anyone still ships security patches for the platform this repository RUNS ON — the runtime it pins and the framework majors its own constraints hold it to. Separate from D12 because the question differs: a current Django on an end-of-life Python is perfectly up to date and completely unsupported, and the fix is a migration rather than a version bump. What the repository says it merely SUPPORTS is never charged.
Method: End-of-life PLATFORM read from the repository's own declarations and graded against a FROZEN, dated table of vendor support dates — no network, no feed, no API, so this dimension answers identically inside a closed scan fence. Two subjects: a RUNTIME the project pins (a single or all-end-of-life TargetFramework, a .nvmrc or .python-version, a requires-python CAP) and a FRAMEWORK major a dependency constraint cannot move off (a caret, tilde or exact version; `vue@^2.7.16` pins Vue 2). A FLOOR is deliberately never charged — `requires-python = ">=3.8"` states what a package SUPPORTS, not what it runs on — and a multi-target project is charged only when EVERY target is out of support. Runtime 4.0/product capped 8.0, framework 1.5 capped 4.5. The table is safe to freeze because a statement about support that ended in the past cannot become false: it loses recall as it ages, never precision, and a test asserts every entry predates the freeze date. Disjoint from D31 (a container image's OS layer) and D29 (the toolchain a CI workflow installs). Abstains when the repository declares no platform this pass reads — never scores it clean.
0 end-of-life runtime(s) and 0 end-of-life framework(s), read from 0 platform declaration(s) and 19 dependency declaration(s). This dimension reads what the repository says about ITSELF — a pinned target framework, a version file, a capped requires-python, a Rust toolchain pin, a framework major a constraint cannot move off. A FLOOR is deliberately never charged: `requires-python = ">=3.8"` states what the package SUPPORTS, not what it runs on, and a well-maintained library declares exactly that while running its own CI on a current release. The end-of-life facts are FROZEN and dated, so this dimension needs no network and answers identically inside a closed scan fence; as the table ages it loses recall and never precision, because a statement about support that ended in the past cannot become false. The OS layer of a container image is D31's question and the toolchain a CI workflow installs is D29's; this row is neither.
✓ On the Gold path — maintain.
Detailed fixes: d44_recommendation.md.
Do you agree with this assessment?
Frontend & cross-cutting dimensions
R = React/JS · M = Maturity · P = Readiness.
AC2 · Forms & labels2.9 / 10Weak✓ Tool-verified
Other · Accessibility — Whether form controls have a programmatic label (an associated label, aria-label or aria-labelledby), buttons have text, links have an accessible name, a click handler on a plain element names the control it declares, fieldsets have a non-empty legend, known UI-library field components carry a label prop, and a placeholder isn't used as the only label. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: inputs/selects/textareas checked for an associated label[for]/wrapping label/aria-label/aria-labelledby (per document), buttons for accessible text, fieldsets for a legend; placeholder-only labelling flagged. Deterministic, hard fact per control.
Coverage: Population: form controls, buttons, links, fieldsets and known UI-library field components in the PARSED MARKUP files only (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx); components, hidden subtrees and spread/dynamic-attribute elements are skipped, so a control whose label arrives through a spread or a runtime expression is deliberately not judged. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it. (×15) — REDACTED:2124, REDACTED:2125, REDACTED:2128, …
This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label. (×5) — REDACTED:2259, REDACTED:2281, REDACTED:3017, …
What to do
Give every control a programmatic label (a <label for> / wrapping <label> / aria-label) and every button text — a placeholder is not a label.
Do you agree with this assessment?
AC3 · Page structure4.8 / 10Weak✓ Tool-verified
Other · Accessibility — Whether pages declare a language (well-formed BCP-47) and a non-empty title, expose exactly one main landmark and a sane heading order with non-empty headings, keep zoom enabled, title their iframes, give data tables header cells, and avoid meta-refresh. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: html lang, document <title>, a main landmark and heading order on full documents only, plus zoom-disabling viewports, untitled iframes and meta-refresh anywhere. Deterministic, per structural checkpoint.
Coverage: Population: the PARSED MARKUP documents (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx). The page-level checks — lang, title, single main landmark — fire ONCE PER FULL DOCUMENT (an <html> root) and never on a partial or component fragment, so a repo of fragments is assessed only on the per-element checks (heading order, table headers, iframe titles, meta-refresh, zoom). Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>. (×2) — index.html:2, skills/ppt-master/scripts/svg_editor/static/index.html:2
A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope). (×2) — REDACTED:2111, REDACTED:2938
What to do
Declare <html lang>, a document <title> and a <main> landmark, keep headings in order, leave zoom enabled, title iframes and drop meta-refresh.
Other · Accessibility — Whether ARIA is used correctly — valid non-abstract roles, the ARIA state a role requires, valid (non-misspelled) aria-* attribute names, in-enum values for token-typed aria-* attributes, and no aria-hidden on (or wrapping) a focusable element. Static markup readiness, not a WCAG conformance claim.
Method: Static markup-model scan: role values checked against the WAI-ARIA role set (abstract/invalid flagged), required ARIA state for a role, and aria-hidden on a focusable element. Deterministic, role/attribute level.
Coverage: Population: elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx) that carry a role or an aria-* attribute; roles and token values are checked against the ARIA enums exhaustively within that set. An expression-valued (dynamic) role or aria-* value is skipped rather than guessed, and markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Other · Accessibility — Whether focus outlines aren't removed without a replacement, motion respects prefers-reduced-motion, and literal CSS colour pairs meet contrast — PARTIAL: inline styles, in-repo <style> blocks, in-repo .css files, var() tokens, Tailwind neutral utilities and CSS-in-JS literals are read (hex/rgb/hsl/named), never computed/runtime/external-CDN colour. Static markup readiness, not a WCAG conformance claim.
Method: Static markup/CSS scan: inline outline:none/0, literal inline colour/background contrast against the 4.5:1 AA floor, and <style>-block animation without a prefers-reduced-motion guard. Deterministic but PARTIAL — only inline styles and in-repo CSS literals are visible.
Coverage: Population: styled elements in the PARSED MARKUP files (.html/.htm/.cshtml/.razor/.vue/.svelte/.jsx/.tsx), plus in-repo <style> blocks, in-repo .css files and CSS-in-JS literals. Colour contrast is computed from LITERAL colour pairs only (hex/rgb/hsl/named, including var() tokens and Tailwind neutral utilities) — computed, runtime-themed and external-CDN colour is never resolved, so this is a partial read of contrast by construction. Markup built in script — tagged-template (html`…`) UIs and hyperscript DOM factories — is not read at all.
Do you agree with this assessment?
AC7 · A11y enforcement4.0 / 10Weak✓ Tool-verified
Other · Accessibility — Whether accessibility is ENFORCED in the toolchain — an accessibility checker configured over the markup (an a11y lint rule set, e.g. eslint-plugin-jsx-a11y or vuejs-accessibility where the project lints JavaScript) and an automated accessibility assertion wired into tests or CI (axe/pa11y/Lighthouse or an equivalent) — on the Documented→Verified→Prevented ladder.
Method: Repo config/CI scan: an accessibility checker configured over the markup (an a11y lint rule set such as eslint-plugin-jsx-a11y / vuejs-accessibility where JavaScript is linted) and an automated accessibility assertion in tests or CI (axe/pa11y/Lighthouse or equivalent), graded on the Documented→Verified→Prevented rungs. Deterministic, presence/rung detection.
Coverage: Population: the repository's own tooling configuration — lint config, test and CI files — NOT the markup. It is read for a configured accessibility checker and an automated accessibility assertion (axe/pa11y/Lighthouse, or a native-toolkit equivalent), and it credits an INVOCATION, never a mention: a licence filename, an import comment or a doc reference earns no rung. Enforcement configured entirely outside the repository leaves no evidence here and cannot be credited.
No accessibility enforcement found — no automated accessibility check runs over your pages. Add an accessibility checker (axe-core, pa11y or Lighthouse) over your HTML in CI and fail the build on new violations. What was searched, so you can tell an absence from a miss: the 5 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
What to do
Enforce accessibility over your pages: run an accessibility checker (axe-core, pa11y or Lighthouse) against your HTML in CI and fail the build on new violations — these run as standalone tools without adding a package manifest.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
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.
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 all sits under skills/ alongside the root build files, so the conventional src/ boundary between the product and its tooling isn't drawn.
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.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
docs/rules/code-style.md documents the environment variable `UPPER_SNAKE_CASE`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/rules/code-style.md:166
skills/ppt-master/scripts/docs/multilingual-text-smoke.md documents the environment variable `PYTHONPATH`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — skills/ppt-master/scripts/docs/multilingual-text-smoke.md:9
What to do
Reconcile the README with reality: docs/rules/code-style.md documents the environment variable `UPPER_SNAKE_CASE`, but no code, script or configuration file names it; skills/ppt-master/scripts/docs/multilingual-text-smoke.md documents the environment variable `PYTHONPATH`, but no code, script or configuration file names it.
Do you agree with this assessment?
P1 · CI/CD gates0.0 / 10Critical✓ Tool-verified
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.
No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, …) — changes aren't gated by an automated build/test.
What to do
Add a CI workflow that builds and runs the test suite on every push/PR.
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 — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 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.
What to do
Run what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — locally for now, since there is no CI pipeline here yet, and as a step of the first workflow you add 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.
Readiness · Readiness — Whether releases are traceable — a maintained changelog and explicit version stamping.
Method: Filesystem scan: changelog file presence and version tags in csproj or git tags. Exhaustive, deterministic.
No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
What to do
Keep a changelog (e.g. Keep-a-Changelog) recording what shipped in each release.
Readiness · Readiness — Whether outbound HTTP calls are wrapped in resilience (retry/timeout/circuit-breaker) so a failing dependency doesn't cascade.
Method: Source scan: outbound HTTP clients and what bounds them — resilience handlers (Polly, AddStandardResilienceHandler) on .NET; on Go, the JVM, Python, JavaScript/TypeScript, Ruby, PHP, Rust, Elixir, Swift, Dart and Erlang, a timeout, deadline, retry or breaker beside each call, or a process-wide client default (a framework-wide deadline such as Drupal core's, Laravel's or actix's awc counts). Exhaustive, deterministic.
Readiness · Performance — Whether asynchronous code stays responsive — it avoids sync-over-async blocking (a .NET .Wait()/.GetAwaiter().GetResult(), a time.sleep or blocking HTTP call inside a Python coroutine, a *Sync call inside an async JavaScript function, block_on inside a Rust async fn, runBlocking inside a Kotlin suspend function, block() inside a Reactor publisher) that stalls a thread or event loop and risks deadlock, and, where the code is a reusable library on .NET, awaits with ConfigureAwait(false) so it never captures and stalls its caller's context.
Method: Production-source scan: sync-over-async blocking counted everywhere — .Wait()/.GetAwaiter().GetResult() in .NET; off .NET, read from the language model, a blocking call inside an async function (Python, TS/JS, Rust, Kotlin, Swift, Dart) or inside a Java method returning a Reactor Mono/Flux or a Scala method returning a Future or effect — and, for a .NET library with ≥5 awaits, the share of awaits using ConfigureAwait(false). Deterministic, syntax/text detection.
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.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
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.
Other · Code Health — Whether a loop that shortens a string until it fits a length budget has a floor — one with none grinds the value down to the empty string, or past it into a negative-length `Substring`.
Method: Roslyn syntax + semantics: while/do loops whose body's only effect on a string is to drop its last character, checked for whether anything — a direct comparison on the length, a body guard, a break — bounds that length below. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `while`/`do` loop whose body’s one assignment to a value is `x = x.slice(0, -1)` or `x = x.slice|substring|substr(0, x.length - 1)`, driven by a condition that reads `x.length` only as a term of a larger expression — never compared directly, never tested for truthiness, and with no other read of `x` — and whose body has no `break`, `return`, `throw` or `if` naming `x`. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document1.8 / 10Critical✓ Tool-verified
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
`analyze_template_text_slots` is public, takes a document from its caller (line 111) and hands it to `visit`, which calls itself at line 83 (`visit`) with a piece of `node` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/template_text_slots.py:83
`semantic_subtree_sha256` is public, takes a document from its caller (line 271) and hands it to `visit`, which calls itself at line 294 (`visit`) with a piece of `item` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_authoring_view.py:294
`compact_svg_style_tree` is public, takes a document from its caller (line 486) and hands it to `_effective_value`, which calls itself at line 250 (`_effective_value`) with a piece of `element` — and nowhere in `_effective_value` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_effective_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/compact_svg_styles.py:250
`compact_svg_style_tree` is public, takes a document from its caller (line 486) and hands it to `_promote_common_group_defaults`, which calls itself at line 361 (`_promote_common_group_defaults`) with a piece of `element` — and nowhere in `_promote_common_group_defaults` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_promote_common_group_defaults` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/compact_svg_styles.py:361
`compact_svg_style_tree` is public, takes a document from its caller (line 486) and hands it to `_remove_redundant_inherited_styles`, which calls itself at line 483 (`_remove_redundant_inherited_styles`) with a piece of `element` — and nowhere in `_remove_redundant_inherited_styles` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_remove_redundant_inherited_styles` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/compact_svg_styles.py:483
`deep_clone_slide_private_parts` is public, takes a document from its caller (line 205) and hands it to `_clone_part_private_deps`, which calls itself at line 191 (`_clone_part_private_deps`) with a piece of `rels_root` — and nowhere in `_clone_part_private_deps` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_clone_part_private_deps` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/pptx_ooxml/clone.py:191
`svg_preset_preview_fingerprint` is public, takes a document from its caller (line 84) and hands it to `_preview_subtree`, which calls itself at line 223 (`_preview_subtree`) with a piece of `element` — and nowhere in `_preview_subtree` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_preview_subtree` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:223
`svg_native_fallback_fingerprint` is public, takes a document from its caller (line 96) and hands it to `_native_fallback_subtree`, which calls itself at line 271 (`_native_fallback_subtree`) with a piece of `element` — and nowhere in `_native_fallback_subtree` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_native_fallback_subtree` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:271
`svg_native_fallback_fingerprint` is public, takes a document from its caller (line 96) and hands it to `visit`, which calls itself at line 313 (`visit`) with a piece of `element` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:313
`svg_native_fallback_fingerprint` is public, takes a document from its caller (line 96) and hands it to `visit`, which calls itself at line 388 (`visit`) with a piece of `element` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:388
`svg_text_fingerprint` is public, takes a document from its caller (line 55) and hands it to `_element_payload`, which calls itself at line 446 (`_element_payload`) with a piece of `element` — and nowhere in `_element_payload` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_element_payload` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:446
`walk_sp_tree` is public, takes a document from its caller (line 551) and hands it to `_walk_container`, which calls itself at line 345 (`_walk_container`) with a piece of `container` — and nowhere in `_walk_container` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_walk_container` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:345
`iter_leaf_shapes` is public and takes `shapes: object` from its caller, and it calls itself at line 223 (`iter_leaf_shapes`) with a piece of `shapes` — and nowhere in `iter_leaf_shapes` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `iter_leaf_shapes` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/source_to_md/ppt_to_md.py:223
`project_transform_errors` is public, takes a document from its caller (line 1250) and hands it to `_iter_visual_transform_tree`, which calls itself at line 931 (`_iter_visual_transform_tree`) with a piece of `elem` — and nowhere in `_iter_visual_transform_tree` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_iter_visual_transform_tree` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:931
`supports_full_project_transform` is public and takes `elem: ET.Element` from its caller, and it calls itself at line 1003 (`supports_full_project_transform`) with a piece of `elem` — and nowhere in `supports_full_project_transform` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `supports_full_project_transform` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1003
`project_stroke_style_errors` is public, takes a document from its caller (line 1098) and hands it to `visit`, which calls itself at line 1067 (`visit`) with a piece of `elem` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1067
`project_transform_errors` is public, takes a document from its caller (line 1250) and hands it to `validate_branch`, which calls itself at line 1315 (`validate_branch`) with a piece of `elem` — and nowhere in `validate_branch` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `validate_branch` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1315
`resolve_project_font_sizes` is public, takes a document from its caller (line 528) and hands it to `walk`, which calls itself at line 522 (`walk`) with a piece of `elem` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:522
`resolve_project_letter_spacings` is public, takes a document from its caller (line 536) and hands it to `walk`, which calls itself at line 562 (`walk`) with a piece of `elem` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:562
`convert_text` is public, takes a document from its caller (line 3158) and hands it to `_collect_inline_runs`, which calls itself at line 2798 (`_collect_inline_runs`) with a piece of `container` — and nowhere in `_collect_inline_runs` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_collect_inline_runs` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2798
`collect_hidden_visuals` is public, takes a document from its caller (line 1840) and hands it to `visit`, which calls itself at line 1854 (`visit`) with a piece of `element` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1854
`collect_unsupported_visuals` is public, takes a document from its caller (line 1971) and hands it to `walk`, which calls itself at line 2006 (`walk`) with a piece of `elem` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack. — skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2006
What to do
Each finding names the externally-callable member that accepts the document and the self-call that descends, and states that no depth parameter or counter exists anywhere in the walk. Confirm from the two, then thread a depth argument through the walk and reject documents past a fixed maximum, or rewrite it with an explicit stack.
Other · Code Health — Whether a type's disposal matches what it OWNS — releasing what it created, leaving alone what it was handed, and not declaring a finalizer for state that has nothing unmanaged to finalize.
Method: Roslyn syntax + semantics: every assignment to a disposable field is read to decide whether the type CREATED the value or was handed it, and the type's disposal is checked against that answer — an injected interface it disposes, a value it constructed and never releases, a finalizer on a type holding nothing unmanaged, and a disposable local whose every reference is a plain member read. A value handed to a container that disposes its contents (a parent control's `Controls` collection, a component `IContainer`) is released by that container and is not reported; generated code is out of population. On a repository with no .NET source the same ownership questions are read in JavaScript/TypeScript off the engine’s own token stream (test, vendored, generated and minified paths not): a class declaring `dispose()`, `[Symbol.dispose]()` or `[Symbol.asyncDispose]()` that disposes a field it was handed through a constructor parameter typed as a repository interface or resolved by a dependency-injection container; that assigns a field only ever from `new X(…)` of a disposable class and neither releases it anywhere in the class nor names it in its disposal member or a method that member calls, nor hands it to anything else; and a `const`/`let` local built from literals only whose every reference opens a statement operating on a non-release member of it. A class is disposable when every repository declaration of its name declares or inherits a disposal member, or when it is a documented library disposable (`vscode` EventEmitter, CancellationTokenSource and Disposable; three.js geometries, materials, textures, render targets, renderers, controls and composers). The finalizer arm has no JavaScript counterpart: a class cannot declare one. Dart is read for the owned-and-never-released arm: a Flutter `State` (or a class declaring `dispose()`/`close()`) whose library-private field is written only with direct creations of a framework controller, `FocusNode`, `StreamController` or periodic `Timer` (or a `.listen(…)` into a field declared `StreamSubscription`), which nothing in the class or its library releases (`dispose`/`close`/`cancel`) and which is never handed on except as a named argument. Ruby is read for the owned-and-never-released arm and the abandoned-local arm: a class declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose instance variable is written only with a blockless core descriptor creation (`File.open`/`new`, `Tempfile`, `Dir.open`, `IO.popen`, the `socket` and `openssl` socket classes) that no method of the class closes and that is never handed on (passed, returned, stored, exposed by `attr_reader`, delegated) — a class whose superclass or mixin lies outside the repository is not judged — and a blockless creation read through and dropped (`File.open(path).read`) or held in a local that is never closed, returned, passed or stored (a `&:read` block-pass, an `autoclose: false` borrow and a `fileno` hand-over are not abandonment). PHP is read for the same two arms: a class (not a trait, and not one using a trait) declaring an instance `close`, `dispose`, `shutdown`, `stop`, `disconnect` or `terminate` whose `private` property (or a `final` class's `protected` one) is written only with a direct core `fopen`, `tmpfile`, `popen`, `proc_open`, `fsockopen`, `stream_socket_client`/`server` or `opendir` that nothing in the class closes (`fclose`, `pclose`, `closedir`, `unset`, a reset to `null`) and that is never handed on, and a handle held in a function's local, or read through as the argument of a reader, that is never closed, returned, passed, captured or stored; a `php://` stream, `curl_init`, `SplFileObject`, `PDO` and a function the repository declares under the core name are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped7.8 / 10Strong✓ Tool-verified
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
`elem_id` carries text this program read out of a document — an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again — and it is written straight into the `id` attribute of markup built here with nothing escaping it on the way. The value is chosen by whoever authored that document, not by this program, so it can close the attribute or element it sits in and open another — a crafted document becomes markup in what this code renders. Escape `elem_id` at this site, or validate it against the shape the position accepts before interpolating it. (×3) — skills/ppt-master/scripts/svg_quality/checker.py:5581, skills/ppt-master/scripts/svg_quality/checker.py:5591, skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5469
`label` is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — skills/ppt-master/scripts/confirm_ui/static/app.js:968
`icons[idx]` is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup. — skills/ppt-master/scripts/confirm_ui/static/app.js:3546
What to do
Each finding names the expression, the attribute it lands in and the line. Confirm the value's origin from the read this analyzer traced, then escape it at the sink or validate it against the shape the attribute accepts before interpolating.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X29 · Per-element action decided by a fixed element10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a decision taken once per element is taken ABOUT that element — a test inside a counted loop that reads a fixed subscript of the very collection its guarded statement indexes by the loop variable applies element zero's answer to all of them, so the elements that differ from it are all handled wrongly, and in the same direction.
Method: Roslyn syntax only, no semantic model: every `for` statement declaring exactly ONE loop variable, and every `if` inside its body that is not under a nested loop or a lambda. A site enters the population when the `if`’s condition never mentions the loop variable while the statement it guards indexes some collection by that variable ALONE (`c[i]`; `c[i + 1]` and `c[i, j]` are outside it). A finding additionally needs the AGREEING TWIN at the same-collection grain: the condition must read THAT SAME collection at a subscript that does not move — written into the condition, or reached through a local declared BEFORE the loop, so an alias bound inside the body is not followed. Both collection expressions must be simple identifiers. On a repository with no .NET source the same rule reads JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `for (let|var|const x = …; …; …)` with one declarator and a braced body, an alias followed only when it is declared before the loop in a block that encloses it and never assigned inside the loop. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
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. (×12) — skills/ppt-master/scripts/rotate_images.py:491, skills/ppt-master/scripts/confirm_ui/static/app.js:722, skills/ppt-master/scripts/confirm_ui/static/app.js:4440, …
`except BaseException` 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. — skills/ppt-master/scripts/image_search.py:2403
`.catch(function(){})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it. — skills/ppt-master/scripts/confirm_ui/static/app.js:4439
`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. (×13) — skills/ppt-master/scripts/project_management/page_context.py:750, skills/ppt-master/scripts/source_to_md/ppt_to_md.py:186, skills/ppt-master/scripts/source_to_md/pdf_to_md.py:943, …
`catch (e)` 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. (×2) — REDACTED:2793, REDACTED:3055
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.
Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.
Do you agree with this assessment?
WCAG coverage — what static analysis assessed
Statically assessed 10 of 55 WCAG 2.2 Level A/AA success criteria (18%; ≈20% of the 50 WCAG 2.1 AA criteria for EN 301 549). The other 45 require runtime or manual evaluation. Partial signal only (a clean result is necessary, not sufficient; static analysis fully verifies none). This is accessibility readiness, not a conformance claim — a WCAG conformance claim requires manual evaluation (WCAG-EM 1.0).
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 25 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X6 Hand-rolled structured-format parsing — 2 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 26 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 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.
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 — 53 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 image/media element found in the parsed markup — AC1 not applicable here.
AC4 Keyboard semantics — No interactive element found in the parsed markup — AC4 not applicable here.
AX1 Captive dependencies — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
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
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository registers no route and starts no server another machine can reach (no Flask/FastAPI/Starlette route, Django urlpatterns or class-based view, Tornado handler). Access control is therefore N/A here — a library or command-line tool is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or MongoEngine model, a migration or a SQL schema — and no database or data-store client (Django ORM, SQLAlchemy, psycopg, PyMongo, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~17950 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 currency not established — no declaration carries an exact pin to grade
D16 Bus Factor — single-maintainer repository — bus factor is not applicable
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
D22 Internal API Consistency — 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+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.py), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
D36 Supply-chain Provenance & Signing — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
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.
D5 Coupling — Not applicable — no manifest declares this repository's modules, and its source holds 1 production component(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production components are not part of the shipped graph.)
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 included — suite not readable by the collector
DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (203 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 — no CI workflow found
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.
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 and TypeScript/JavaScript 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.
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.
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.
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 — 24 finding(s)
AC2 · Forms & labels· <input> without a programmatic label · ×16
<input> without a programmatic label REDACTED:2124— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2125— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2128— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2129— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2256— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2259— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label REDACTED:2281— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label REDACTED:2297— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2299— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2306— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2940— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:2942— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:3015— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<input> without a programmatic label REDACTED:3017— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label REDACTED:3022— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
<input> without a programmatic label REDACTED:3039— This control has only a placeholder — a placeholder is not a label (it vanishes on input and many AT ignore it). Add a <label for>, a wrapping <label>, or aria-label.
AC2 · Forms & labels· <textarea> without a programmatic label · ×2
<textarea> without a programmatic label REDACTED:2146— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<textarea> without a programmatic label REDACTED:2303— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
AC2 · Forms & labels· <select> without a programmatic label · ×2
<select> without a programmatic label REDACTED:2265— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
<select> without a programmatic label REDACTED:3029— This control has no associated label. Add a <label for> / wrapping <label> / aria-label / aria-labelledby so assistive tech can name it.
Banned license: edge-tts — `edge-tts` 7.3.1 is published on PyPI under `LGPL-3.0`, which this policy bans, and it is in the SHIPPED closure of this repository — so it is installed by everything that depends on this repository, not just by its test environment. A distribution offering SEVERAL licences is a choice and is only charged when every one of them is banned. Replace the package, or record an accepted exception.
Hotspot: skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1982— skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py changed 49 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 309 in cli.main at line 1982. 22 of those changes were fix/bug commits, and the other 27 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.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/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6730— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py changed 43 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 348 in builder.create_pptx_with_native_svg at line 6730. 21 of those changes were fix/bug commits, and the other 22 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.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/ppt-master/scripts/svg_to_pptx/drawingml/elements.py skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3158— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in elements.convert_text at line 3158. 23 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.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/ppt-master/scripts/confirm_ui/static/app.js skills/ppt-master/scripts/confirm_ui/static/app.js:1418— skills/ppt-master/scripts/confirm_ui/static/app.js changed 36 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in app.enumField at line 1418. 16 of those changes were fix/bug commits, and the other 20 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/confirm_ui/static/app.js`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
Hotspot: skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2018— skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py changed 29 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 77 in converter.convert_svg_to_slide_shapes at line 2018. 14 of those changes were fix/bug commits, and the other 15 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.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/ppt-master/scripts/project_management/cli.py skills/ppt-master/scripts/project_management/cli.py:857— skills/ppt-master/scripts/project_management/cli.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in ProjectManager.import_sources at line 857. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/project_management/cli.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/ppt-master/scripts/svg_to_pptx/drawingml/utils.py skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2798— skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py changed 31 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 47 in utils.project_filter_errors at line 2798. 24 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.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/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1512— skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 128 in template_structure.parse_template_slide at line 1512. 5 of those changes were fix/bug commits, and the other 5 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.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/ppt-master/scripts/svg_to_pptx/native_objects/table.py skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1782— skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in table._build_native_table at line 1782. 14 of those changes were fix/bug commits, so the churn is repair rather than feature work. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/table.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/ppt-master/scripts/svg_quality/cli.py skills/ppt-master/scripts/svg_quality/cli.py:168— skills/ppt-master/scripts/svg_quality/cli.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in cli.main at line 168. 8 of those changes were fix/bug commits, and the other 9 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_quality/cli.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/ppt-master/scripts/image_gen.py skills/ppt-master/scripts/image_gen.py:588— skills/ppt-master/scripts/image_gen.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in image_gen.load_manifest at line 588. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/image_gen.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/ppt-master/scripts/source_to_md/pdf_to_md.py skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1419— skills/ppt-master/scripts/source_to_md/pdf_to_md.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in pdf_to_md.extract_pdf_to_markdown at line 1419. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/source_to_md/pdf_to_md.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/ppt-master/scripts/slice_images.py skills/ppt-master/scripts/slice_images.py:937— skills/ppt-master/scripts/slice_images.py changed 20 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 46 in slice_images.slice_sheet at line 937. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/slice_images.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/ppt-master/scripts/svg_to_pptx/animation_config.py skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1570— skills/ppt-master/scripts/svg_to_pptx/animation_config.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in animation_config.validate_animation_config at line 1570. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/animation_config.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/ppt-master/scripts/image_search.py skills/ppt-master/scripts/image_search.py:2617— skills/ppt-master/scripts/image_search.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 75 in image_search.main at line 2617. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/image_search.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/ppt-master/scripts/pptx_to_svg/slide_to_svg.py skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:532— skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in slide_to_svg._convert_shape at line 532. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.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/ppt-master/scripts/pptx_animations.py skills/ppt-master/scripts/pptx_animations.py:3033— skills/ppt-master/scripts/pptx_animations.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in pptx_animations.validate_slide_animation_structure at line 3033. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/pptx_animations.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/ppt-master/scripts/notes_to_audio.py skills/ppt-master/scripts/notes_to_audio.py:439— skills/ppt-master/scripts/notes_to_audio.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 61 in notes_to_audio.main at line 439. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/notes_to_audio.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/ppt-master/scripts/authoring_roundtrip.py skills/ppt-master/scripts/authoring_roundtrip.py:325— skills/ppt-master/scripts/authoring_roundtrip.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in authoring_roundtrip._load_documents at line 325. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/authoring_roundtrip.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/ppt-master/scripts/text_measure.py skills/ppt-master/scripts/text_measure.py:905— skills/ppt-master/scripts/text_measure.py changed 23 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in text_measure.main at line 905. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/text_measure.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/ppt-master/scripts/register_template.py skills/ppt-master/scripts/register_template.py:658— skills/ppt-master/scripts/register_template.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in register_template._validate_style_spec at line 658. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/register_template.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/ppt-master/scripts/svg_editor/server.py skills/ppt-master/scripts/svg_editor/server.py:1481— skills/ppt-master/scripts/svg_editor/server.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in server.main at line 1481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_editor/server.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/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:308— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 52 in chart_data._chart_axes at line 308. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.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/ppt-master/scripts/source_to_md/web_to_md.py skills/ppt-master/scripts/source_to_md/web_to_md.py:653— skills/ppt-master/scripts/source_to_md/web_to_md.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in web_to_md.download_and_rewrite_images at line 653. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/source_to_md/web_to_md.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/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py:555— skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py changed 19 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in native_objects._validate_native_object_marker_payload at line 555. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/__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.
FileTooLong: pptx_package/builder.py skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py— FileTooLong — 6923 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6423 over it, 13.85× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: drawingml/elements.py skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py— FileTooLong — 4334 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3834 over it, 8.67× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED skills/ppt-master/scripts/confirm_ui/static/app.js— FileTooLong — 3644 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3144 over it, 7.29× 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/pptx_animations.py skills/ppt-master/scripts/pptx_animations.py— FileTooLong — 3177 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2677 over it, 6.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: pptx_package/template_structure.py skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py— FileTooLong — 3009 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2509 over it, 6.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: drawingml/utils.py skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py— FileTooLong — 2917 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2417 over it, 5.83× 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/mirror_template_materialize.py skills/ppt-master/scripts/mirror_template_materialize.py— FileTooLong — 2813 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2313 over it, 5.63× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: pptx_to_svg/chart_to_svg.py skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py— FileTooLong — 2724 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2224 over it, 5.45× 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/pptx_transitions.py skills/ppt-master/scripts/pptx_transitions.py— FileTooLong — 2530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2030 over it, 5.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: scripts/svg_authoring_view.py skills/ppt-master/scripts/svg_authoring_view.py— FileTooLong — 2333 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1833 over it, 4.67× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 2311 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1811 over it, 4.62× 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/image_search.py skills/ppt-master/scripts/image_search.py— FileTooLong — 2253 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1753 over it, 4.51× 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: pptx_to_svg/slide_to_svg.py skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py— FileTooLong — 2039 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1539 over it, 4.08× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: drawingml/converter.py skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py— FileTooLong — 1986 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1486 over it, 3.97× 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/authoring_roundtrip.py skills/ppt-master/scripts/authoring_roundtrip.py— FileTooLong — 1936 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1436 over it, 3.87× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: scripts/prompt_audit.py skills/ppt-master/scripts/prompt_audit.py— FileTooLong — 1895 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1395 over it, 3.79× 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: native_objects/formula_parser.py skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py— FileTooLong — 1829 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1329 over it, 3.66× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: scripts/narration_sync.py skills/ppt-master/scripts/narration_sync.py— FileTooLong — 1766 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1266 over it, 3.53× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: pptx_package/cli.py skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py— FileTooLong — 1725 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1225 over it, 3.45× 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: native_objects/table.py skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py— FileTooLong — 1675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1175 over it, 3.35× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: pptx_to_svg/tbl_to_svg.py skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py— FileTooLong — 1603 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1103 over it, 3.21× 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: pptx_to_svg/converter.py skills/ppt-master/scripts/pptx_to_svg/converter.py— FileTooLong — 1509 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1009 over it, 3.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: svg_to_pptx/animation_config.py skills/ppt-master/scripts/svg_to_pptx/animation_config.py— FileTooLong — 1502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1002 over it, 3.00× 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: native_objects/chart_xml.py skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py— FileTooLong — 1486 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 986 over it, 2.97× 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: native_objects/chart_data.py skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py— FileTooLong — 1413 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 913 over it, 2.83× 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.
+ 43 more in this group — see findings.md.
X17 · Uncapped recursion over a caller-supplied document· Recursive walk over a caller-supplied document has no depth cap · ×22
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/template_text_slots.py:83— `analyze_template_text_slots` is public, takes a document from its caller (line 111) and hands it to `visit`, which calls itself at line 83 (`visit`) with a piece of `node` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_authoring_view.py:294— `semantic_subtree_sha256` is public, takes a document from its caller (line 271) and hands it to `visit`, which calls itself at line 294 (`visit`) with a piece of `item` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/compact_svg_styles.py:250— `compact_svg_style_tree` is public, takes a document from its caller (line 486) and hands it to `_effective_value`, which calls itself at line 250 (`_effective_value`) with a piece of `element` — and nowhere in `_effective_value` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_effective_value` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/compact_svg_styles.py:361— `compact_svg_style_tree` is public, takes a document from its caller (line 486) and hands it to `_promote_common_group_defaults`, which calls itself at line 361 (`_promote_common_group_defaults`) with a piece of `element` — and nowhere in `_promote_common_group_defaults` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_promote_common_group_defaults` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/compact_svg_styles.py:483— `compact_svg_style_tree` is public, takes a document from its caller (line 486) and hands it to `_remove_redundant_inherited_styles`, which calls itself at line 483 (`_remove_redundant_inherited_styles`) with a piece of `element` — and nowhere in `_remove_redundant_inherited_styles` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_remove_redundant_inherited_styles` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/pptx_ooxml/clone.py:191— `deep_clone_slide_private_parts` is public, takes a document from its caller (line 205) and hands it to `_clone_part_private_deps`, which calls itself at line 191 (`_clone_part_private_deps`) with a piece of `rels_root` — and nowhere in `_clone_part_private_deps` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_clone_part_private_deps` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:223— `svg_preset_preview_fingerprint` is public, takes a document from its caller (line 84) and hands it to `_preview_subtree`, which calls itself at line 223 (`_preview_subtree`) with a piece of `element` — and nowhere in `_preview_subtree` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_preview_subtree` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:271— `svg_native_fallback_fingerprint` is public, takes a document from its caller (line 96) and hands it to `_native_fallback_subtree`, which calls itself at line 271 (`_native_fallback_subtree`) with a piece of `element` — and nowhere in `_native_fallback_subtree` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_native_fallback_subtree` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:313— `svg_native_fallback_fingerprint` is public, takes a document from its caller (line 96) and hands it to `visit`, which calls itself at line 313 (`visit`) with a piece of `element` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:388— `svg_native_fallback_fingerprint` is public, takes a document from its caller (line 96) and hands it to `visit`, which calls itself at line 388 (`visit`) with a piece of `element` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:446— `svg_text_fingerprint` is public, takes a document from its caller (line 55) and hands it to `_element_payload`, which calls itself at line 446 (`_element_payload`) with a piece of `element` — and nowhere in `_element_payload` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_element_payload` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:345— `walk_sp_tree` is public, takes a document from its caller (line 551) and hands it to `_walk_container`, which calls itself at line 345 (`_walk_container`) with a piece of `container` — and nowhere in `_walk_container` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_walk_container` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/source_to_md/ppt_to_md.py:223— `iter_leaf_shapes` is public and takes `shapes: object` from its caller, and it calls itself at line 223 (`iter_leaf_shapes`) with a piece of `shapes` — and nowhere in `iter_leaf_shapes` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `iter_leaf_shapes` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:931— `project_transform_errors` is public, takes a document from its caller (line 1250) and hands it to `_iter_visual_transform_tree`, which calls itself at line 931 (`_iter_visual_transform_tree`) with a piece of `elem` — and nowhere in `_iter_visual_transform_tree` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_iter_visual_transform_tree` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1003— `supports_full_project_transform` is public and takes `elem: ET.Element` from its caller, and it calls itself at line 1003 (`supports_full_project_transform`) with a piece of `elem` — and nowhere in `supports_full_project_transform` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `supports_full_project_transform` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1067— `project_stroke_style_errors` is public, takes a document from its caller (line 1098) and hands it to `visit`, which calls itself at line 1067 (`visit`) with a piece of `elem` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1315— `project_transform_errors` is public, takes a document from its caller (line 1250) and hands it to `validate_branch`, which calls itself at line 1315 (`validate_branch`) with a piece of `elem` — and nowhere in `validate_branch` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `validate_branch` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:522— `resolve_project_font_sizes` is public, takes a document from its caller (line 528) and hands it to `walk`, which calls itself at line 522 (`walk`) with a piece of `elem` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:562— `resolve_project_letter_spacings` is public, takes a document from its caller (line 536) and hands it to `walk`, which calls itself at line 562 (`walk`) with a piece of `elem` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2798— `convert_text` is public, takes a document from its caller (line 3158) and hands it to `_collect_inline_runs`, which calls itself at line 2798 (`_collect_inline_runs`) with a piece of `container` — and nowhere in `_collect_inline_runs` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `_collect_inline_runs` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1854— `collect_hidden_visuals` is public, takes a document from its caller (line 1840) and hands it to `visit`, which calls itself at line 1854 (`visit`) with a piece of `element` — and nowhere in `visit` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `visit` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Recursive walk over a caller-supplied document has no depth cap skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2006— `collect_unsupported_visuals` is public, takes a document from its caller (line 1971) and hands it to `walk`, which calls itself at line 2006 (`walk`) with a piece of `elem` — and nowhere in `walk` is there a depth parameter, a descent counter, or any other cap. The walk therefore spends one stack frame per LEVEL of the value it is handed, so the nesting of the caller's document — not this code — decides how deep the stack goes. Python's parsers accept far more nesting than its stack allows: `json.loads` turns 3,000 bytes of brackets into 1,500 levels and `xml.etree.ElementTree` parses tens of thousands, while a walk like this one raises `RecursionError` once it passes the interpreter's default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any `try` the worker or the program exits with it. Raising `sys.setrecursionlimit` only moves the number the document has to beat. Thread a depth argument through `walk` and reject the value past a fixed maximum, or rewrite the descent with an explicit stack.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/authoring_roundtrip.py:1402— skills/ppt-master/scripts/authoring_roundtrip.py:1402-1410 | skills/ppt-master/scripts/svg_authoring_view.py:1083-1091 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/batch_validate.py:168— skills/ppt-master/scripts/batch_validate.py:168-176 | skills/ppt-master/scripts/svg_quality/checker.py:9608-9616 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/batch_validate.py:168` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/narration_sync.py:205— skills/ppt-master/scripts/narration_sync.py:205-213 | skills/ppt-master/scripts/video_subtitles.py:57-65 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1729— skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1729-1737 | skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1758-1766 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:303— skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:303-311 | skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:362-370 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note 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 (9 lines × 2) skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:668— skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:668-676 | skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:706-714 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/pptx_to_svg/converter.py:846— skills/ppt-master/scripts/pptx_to_svg/converter.py:846-854 | skills/ppt-master/scripts/pptx_to_svg/converter.py:860-868 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2263— skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2263-2271 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2307-2315 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:383— skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:383-391 | skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:437-445 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/svg_position_calculator.py:421— skills/ppt-master/scripts/svg_position_calculator.py:421-429 | skills/ppt-master/scripts/svg_position_calculator.py:558-566 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_position_calculator.py:421` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/svg_position_calculator.py:668— skills/ppt-master/scripts/svg_position_calculator.py:668-676 | skills/ppt-master/scripts/svg_position_calculator.py:758-766 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/svg_position_calculator.py:891— skills/ppt-master/scripts/svg_position_calculator.py:891-899 | skills/ppt-master/scripts/svg_position_calculator.py:910-918 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:9897— skills/ppt-master/scripts/svg_quality/checker.py:9897-9905 | skills/ppt-master/scripts/svg_quality/checker.py:9953-9961 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1434— skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1434-1442 | skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1511-1519 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:421— skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:421-429 | skills/ppt-master/scripts/svg_to_pptx/geometry_properties.py:93-101 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1282— skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1282-1290 | skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1292-1300 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2244— skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2244-2254 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:3256-3264 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9 lines × 2) skills/ppt-master/scripts/authoring_roundtrip.py:244— skills/ppt-master/scripts/authoring_roundtrip.py:244-252 | skills/ppt-master/scripts/mirror_template_materialize.py:596-604 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/image_backends/backend_bfl.py:140— skills/ppt-master/scripts/image_backends/backend_bfl.py:140-146 | skills/ppt-master/scripts/image_backends/backend_replicate.py:124-130 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/pptx_intake.py:56— skills/ppt-master/scripts/pptx_intake.py:56-62 | skills/ppt-master/scripts/project_management/cli.py:200-206 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_intake.py:56` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `payload` to `dict[str, 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `skills/ppt-master/scripts/project_management/cli.py:208` calls `chmod` and `skills/ppt-master/scripts/pptx_intake.py:63` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/pptx_ooxml/clone.py:535— skills/ppt-master/scripts/pptx_ooxml/clone.py:535-541 | skills/ppt-master/scripts/pptx_ooxml/package.py:231-237 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:656— skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:656-662 | skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:867-873 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:945— skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:945-952 | skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:983-989 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:611— skills/ppt-master/scripts/source_to_md/pdf_to_md.py:611-617 | skills/ppt-master/scripts/source_to_md/pdf_to_md.py:774-780 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/svg_authoring_view.py:1269— skills/ppt-master/scripts/svg_authoring_view.py:1269-1275 | skills/ppt-master/scripts/svg_authoring_view.py:1380-1386 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_authoring_view.py:1269` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:5830— skills/ppt-master/scripts/svg_quality/checker.py:5830-5838 | skills/ppt-master/scripts/svg_quality/checker.py:5919-5925 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note 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 (7 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:657— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:657-663 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1369-1375 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1391— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1391-1397 | skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1324-1330 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1391` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:470— skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:470-476 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:503-509 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/image_backends/backend_minimax.py:104— skills/ppt-master/scripts/image_backends/backend_minimax.py:104-116 | skills/ppt-master/scripts/image_backends/backend_qwen.py:100-106 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_minimax.py` and `skills/ppt-master/scripts/image_backends/backend_qwen.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 129 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/image_sources/provider_pexels.py:54— skills/ppt-master/scripts/image_sources/provider_pexels.py:54-60 | skills/ppt-master/scripts/image_sources/provider_pixabay.py:55-61 — before extracting anything, compare `skills/ppt-master/scripts/image_sources/provider_pexels.py` and `skills/ppt-master/scripts/image_sources/provider_pixabay.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/pptx_to_svg/preset_svg_markup.py:192— skills/ppt-master/scripts/pptx_to_svg/preset_svg_markup.py:192-198 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:179-185 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:365— skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:365-371 | skills/ppt-master/scripts/svg_to_pptx/text_outline.py:363-369 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7 lines × 2) skills/ppt-master/scripts/image_gen.py:1139— skills/ppt-master/scripts/image_gen.py:1139-1145 | skills/ppt-master/scripts/image_search.py:1991-1997 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `cli_value` to `int | None` in one and `Optional[int]` 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.
Swallowed exception (caught, then discarded) skills/ppt-master/scripts/image_search.py:2403— `except BaseException` 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/ppt-master/scripts/project_management/page_context.py:750— `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/ppt-master/scripts/source_to_md/ppt_to_md.py:186— `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/ppt-master/scripts/source_to_md/pdf_to_md.py:943— `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/ppt-master/scripts/source_to_md/pdf_to_md.py:1072— `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/ppt-master/scripts/source_to_md/pdf_to_md.py:1231— `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/ppt-master/scripts/source_to_md/doc_to_md.py:1186— `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/ppt-master/scripts/source_to_md/doc_to_md.py:1217— `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/ppt-master/scripts/source_to_md/doc_to_md.py:1552— `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) REDACTED:2793— `catch (e)` 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) REDACTED:3055— `catch (e)` 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/ppt-master/scripts/svg_finalize/embed_images.py:97— `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/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py:276— `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/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:2686— `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/ppt-master/scripts/tts_backends/backend_elevenlabs.py:45— `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/ppt-master/scripts/tts_backends/backend_common.py:24— `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.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/batch_validate.py:253— skills/ppt-master/scripts/batch_validate.py:253-257 | skills/ppt-master/scripts/svg_quality/checker.py:10127-10131 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note first that the copies are not typed on the same thing: the declarations holding them bind `output_file` to `str = 'validation_report.txt'` in one and `str = 'svg_quality_report.txt'` 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 (5 lines × 2) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2748— skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2748-2753 | skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2823-2827 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:142— skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:142-146 | skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:160-164 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:142` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/pptx_to_svg/preset_registry_to_svg.py:105— skills/ppt-master/scripts/pptx_to_svg/preset_registry_to_svg.py:105-109 | skills/ppt-master/scripts/pptx_to_svg/preset_registry_to_svg.py:114-118 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/preset_registry_to_svg.py:105` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/pptx_workspace.py:920— skills/ppt-master/scripts/pptx_workspace.py:920-924 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:429-438 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:429` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/source_to_md/doc_to_md.py:563— skills/ppt-master/scripts/source_to_md/doc_to_md.py:563-567 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:606-610 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/source_to_md/web_to_md.py:1281— skills/ppt-master/scripts/source_to_md/web_to_md.py:1281-1285 | skills/ppt-master/scripts/source_to_md/web_to_md.py:1349-1353 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/svg_finalize/align_embed_images.py:225— skills/ppt-master/scripts/svg_finalize/align_embed_images.py:225-229 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4535-4539 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `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 × 2) skills/ppt-master/scripts/svg_position_calculator.py:222— skills/ppt-master/scripts/svg_position_calculator.py:222-228 | skills/ppt-master/scripts/svg_position_calculator.py:265-269 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3657— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3657-3661 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3729-3733 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3655` calls `Element` and `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3727` 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 (5 lines × 2) skills/ppt-master/scripts/authoring_roundtrip.py:256— skills/ppt-master/scripts/authoring_roundtrip.py:256-260 | skills/ppt-master/scripts/mirror_template_materialize.py:608-612 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/source_to_md/doc_to_md.py:118— skills/ppt-master/scripts/source_to_md/doc_to_md.py:118-122 | skills/ppt-master/scripts/source_to_md/excel_to_md.py:48-52 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) skills/ppt-master/scripts/svg_finalize/align_embed_images.py:177— skills/ppt-master/scripts/svg_finalize/align_embed_images.py:177-181 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4518-4522 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `img` to `'PILImage'` in one and `Any` 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 (5 lines × 2) skills/ppt-master/scripts/tts_backends/backend_common.py:22— skills/ppt-master/scripts/tts_backends/backend_common.py:22-26 | skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py:43-47 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/beautify_identity.py:289— skills/ppt-master/scripts/beautify_identity.py:289-299 | skills/ppt-master/scripts/beautify_inventory.py:437-447 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/confirm_ui/server.py:2345— skills/ppt-master/scripts/confirm_ui/server.py:2345-2355 | skills/ppt-master/scripts/svg_editor/server.py:667-679 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:210— skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:210-220 | skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:361-371 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:210` 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 (11 lines × 2) skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:449— skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:449-459 | skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:483-493 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:460` calls `parse_xfrm` and `skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:494` 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 (11 lines × 2) skills/ppt-master/scripts/project_utils.py:278— skills/ppt-master/scripts/project_utils.py:278-290 | skills/ppt-master/scripts/project_utils.py:324-334 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note 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 (11 lines × 2) skills/ppt-master/scripts/svg_authoring_view.py:638— skills/ppt-master/scripts/svg_authoring_view.py:638-648 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:792-802 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:560— skills/ppt-master/scripts/svg_quality/checker.py:560-570 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1641-1651 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:925— skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:925-935 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1126-1136 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2335— skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2335-2345 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2372-2382 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:496— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:496-506 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:531-541 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:948— skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:948-958 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:993-1003 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (11 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:912— skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:912-922 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1106-1116 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1104` calls `set` and `skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:910` 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 (11 lines × 2) skills/ppt-master/scripts/tts_backends/backend_edge.py:299— skills/ppt-master/scripts/tts_backends/backend_edge.py:299-309 | skills/ppt-master/scripts/video_subtitles.py:186-196 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/tts_backends/backend_edge.py:299` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/attribution_guard.py:138— skills/ppt-master/scripts/attribution_guard.py:138-143 | skills/ppt-master/scripts/attribution_guard.py:172-177 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/image_gen.py:664— skills/ppt-master/scripts/image_gen.py:664-669 | skills/ppt-master/scripts/image_search.py:1921-1926 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/image_sources/provider_openverse.py:90— skills/ppt-master/scripts/image_sources/provider_openverse.py:90-96 | skills/ppt-master/scripts/image_sources/provider_wikimedia.py:126-131 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/image_sources/provider_openverse.py:90` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/pptx_animations.py:1636— skills/ppt-master/scripts/pptx_animations.py:1636-1641 | skills/ppt-master/scripts/pptx_animations.py:1668-1673 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:951— skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:951-956 | skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:1038-1043 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/source_to_md/doc_to_md.py:382— skills/ppt-master/scripts/source_to_md/doc_to_md.py:382-387 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:405-410 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:5521— skills/ppt-master/scripts/svg_quality/checker.py:5521-5526 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1663-1668 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_quality/checker.py:5521` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/svg_quality/cli.py:230— skills/ppt-master/scripts/svg_quality/cli.py:230-235 | skills/ppt-master/scripts/svg_quality/cli.py:239-244 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:768— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:768-773 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:814-819 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1175— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1175-1180 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chartex.py:280-285 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/total_md_split.py:178— skills/ppt-master/scripts/total_md_split.py:178-183 | skills/ppt-master/scripts/total_md_split.py:194-199 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:97— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:97-102 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:914-919 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (6 lines × 2) skills/ppt-master/scripts/authoring_roundtrip.py:1353— skills/ppt-master/scripts/authoring_roundtrip.py:1353-1358 | skills/ppt-master/scripts/svg_authoring_view.py:1047-1052 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Swallowed exception (empty catch) skills/ppt-master/scripts/rotate_images.py:491— 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/ppt-master/scripts/confirm_ui/static/app.js:722— 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/ppt-master/scripts/confirm_ui/static/app.js:4439— `.catch(function(){})` handles the rejection by doing nothing — the failure is discarded with no log and no rethrow, and the chain carries on as if the work succeeded. Log it through whatever this codebase already uses to report problems, hand it to a caller that can (`next(error)`, a returned rejection), or don't catch it.
Swallowed exception (empty catch) skills/ppt-master/scripts/confirm_ui/static/app.js:4440— 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/ppt-master/scripts/confirm_ui/static/app.js:4494— 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/ppt-master/scripts/confirm_ui/static/app.js:4545— 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/ppt-master/scripts/image_backends/backend_common.py:330— 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/ppt-master/scripts/source_to_md/pdf_to_md.py:1250— 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) REDACTED:333— 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) REDACTED:390— 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) REDACTED:1543— 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) REDACTED:2131— 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) REDACTED:2945— 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.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/confirm_ui/server.py:903— skills/ppt-master/scripts/confirm_ui/server.py:903-914 | skills/ppt-master/scripts/svg_editor/server.py:1365-1376 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/image_backends/backend_fal.py:66— skills/ppt-master/scripts/image_backends/backend_fal.py:66-77 | skills/ppt-master/scripts/image_backends/backend_replicate.py:67-78 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_fal.py` and `skills/ppt-master/scripts/image_backends/backend_replicate.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 44 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/image_search.py:1426— skills/ppt-master/scripts/image_search.py:1426-1437 | skills/ppt-master/scripts/pptx_intake.py:58-69 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/image_search.py:1426` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note first that the copies are not typed on the same thing: the declarations holding them bind `payload` to `dict` in one and `dict[str, Any]` 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 (12 lines × 2) skills/ppt-master/scripts/mirror_template_materialize.py:2984— skills/ppt-master/scripts/mirror_template_materialize.py:2984-2995 | skills/ppt-master/scripts/mirror_template_materialize.py:2996-3007 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:953— skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:953-964 | skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1164-1175 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/pptx_to_svg/converter.py:1638— skills/ppt-master/scripts/pptx_to_svg/converter.py:1638-1649 | skills/ppt-master/scripts/pptx_to_svg/converter.py:1650-1661 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/project_management/cli.py:700— skills/ppt-master/scripts/project_management/cli.py:700-711 | skills/ppt-master/scripts/project_management/cli.py:718-729 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/svg_quality/svg_contracts.py:909— skills/ppt-master/scripts/svg_quality/svg_contracts.py:909-920 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:1044-1055 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_quality/svg_contracts.py:909` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1304— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1304-1315 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1577-1588 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4130— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4130-4141 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2838-2849 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4130` 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 (12 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:276— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:276-287 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:296-307 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:276` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:309` calls `get` and `skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:289` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (12 lines × 2) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:892— skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:892-903 | skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:925-936 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/extract_svg_assets.py:817— skills/ppt-master/scripts/extract_svg_assets.py:817-824 | skills/ppt-master/scripts/extract_svg_assets.py:854-861 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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 × 2) skills/ppt-master/scripts/finalize_svg.py:454— skills/ppt-master/scripts/finalize_svg.py:454-461 | skills/ppt-master/scripts/svg_finalize/align_embed_images.py:633-640 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/pptx_animations.py:576— skills/ppt-master/scripts/pptx_animations.py:576-583 | skills/ppt-master/scripts/pptx_transitions.py:1043-1050 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/pptx_animations.py:729— skills/ppt-master/scripts/pptx_animations.py:729-736 | skills/ppt-master/scripts/pptx_animations.py:743-750 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note 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. Note first that the copies are not typed on the same thing: the declarations holding them bind `field` to `str = 'animation shape_id'` in one and `str` 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 (8 lines × 2) skills/ppt-master/scripts/prompt_audit.py:1135— skills/ppt-master/scripts/prompt_audit.py:1135-1142 | skills/ppt-master/scripts/prompt_audit.py:1247-1255 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/prompt_audit.py:1135` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/svg_quality/svg_contracts.py:761— skills/ppt-master/scripts/svg_quality/svg_contracts.py:761-768 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:982-989 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1293— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1293-1300 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5115-5122 — both copies are in the same file, so extract the 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, `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5123` calls `ctx_x`, `ctx_y` and `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1301` 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 (8 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_colors.py:131— skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_colors.py:131-138 | skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py:174-181 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:993— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:993-1000 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1092-1103 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1824— skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1824-1831 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1845-1852 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:614— skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:614-621 | skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:650-657 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (8 lines × 2) skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:188— skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:188-195 | skills/ppt-master/scripts/tts_backends/backend_minimax.py:78-85 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/image_backends/backend_gemini.py:294— skills/ppt-master/scripts/image_backends/backend_gemini.py:294-308 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:182-196 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_gemini.py` and `skills/ppt-master/scripts/image_backends/backend_openrouter.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2611— skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2611-2625 | skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2713-2727 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/project_utils.py:262— skills/ppt-master/scripts/project_utils.py:262-276 | skills/ppt-master/scripts/project_utils.py:308-322 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:7313— skills/ppt-master/scripts/svg_quality/checker.py:7313-7327 | skills/ppt-master/scripts/svg_quality/checker.py:7362-7376 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:8360— skills/ppt-master/scripts/svg_quality/checker.py:8360-8374 | skills/ppt-master/scripts/svg_quality/checker.py:8397-8411 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:666— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:666-680 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1072-1086 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:666` 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) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1584— skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1584-1598 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1817-1831 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:706— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:706-720 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chartex.py:22-36 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:164— skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:164-178 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:238-252 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1479— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1479-1493 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1525-1539 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 2) skills/ppt-master/scripts/tts_backends/backend_common.py:178— skills/ppt-master/scripts/tts_backends/backend_common.py:178-192 | skills/ppt-master/scripts/tts_backends/backend_edge.py:510-524 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (16 lines × 2) skills/ppt-master/scripts/confirm_ui/server.py:2327— skills/ppt-master/scripts/confirm_ui/server.py:2327-2342 | skills/ppt-master/scripts/svg_editor/server.py:649-664 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (16 lines × 2) skills/ppt-master/scripts/image_gen.py:860— skills/ppt-master/scripts/image_gen.py:860-875 | skills/ppt-master/scripts/project_management/cli.py:200-215 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/image_gen.py:860` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (16 lines × 2) skills/ppt-master/scripts/mirror_template_materialize.py:1368— skills/ppt-master/scripts/mirror_template_materialize.py:1368-1383 | skills/ppt-master/scripts/svg_authoring_view.py:390-405 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (16 lines × 2) skills/ppt-master/scripts/narration_sync.py:254— skills/ppt-master/scripts/narration_sync.py:254-269 | skills/ppt-master/scripts/video_subtitles.py:98-113 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (16 lines × 2) skills/ppt-master/scripts/pptx_to_svg/converter.py:692— skills/ppt-master/scripts/pptx_to_svg/converter.py:692-707 | skills/ppt-master/scripts/pptx_to_svg/converter.py:742-757 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/pptx_to_svg/converter.py:689` calls `path_map` and `skills/ppt-master/scripts/pptx_to_svg/converter.py:739` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16 lines × 2) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:475— skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:475-490 | skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:606-621 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:474` calls `_validate_adjustments` and `skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:605` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16 lines × 2) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1732— skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1732-1747 | skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1763-1778 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. Note first that the copies are not typed on the same thing: the declarations holding them bind `run` to `TextRun | None` in one and `TextRun` 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 (16 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:745— skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:745-760 | skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:767-782 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (16 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:565— skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:565-580 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:710-725 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:726` calls `_style_attr` and `skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:581` 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.
Repeated repair: skills/ppt-master/scripts/visual_review.py skills/ppt-master/scripts/visual_review.py:306— skills/ppt-master/scripts/visual_review.py 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 14 (its worst body is visual_review.main at line 306), 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: editorial_bleed fades hold behind their own text slots; visual_review --pages takes comma lists”; “fix(canvas): honor dynamic dimensions across review and typography UI”; “fix(ui-runtime): make local server ports project-aware”; “fix(slide-order): sort SVG rosters numerically”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/visual_review.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.
Repeated repair: skills/ppt-master/scripts/server_common.py skills/ppt-master/scripts/server_common.py:192— skills/ppt-master/scripts/server_common.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is server_common.process_alive at line 192), 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(servers): keep ANSI styling out of detached server logs”; “fix: open preview URLs in Windows browser under WSL”; “fix(ui-runtime): make local server ports project-aware”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/server_common.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.
Repeated repair: skills/ppt-master/scripts/pptx_ooxml/analyzer.py skills/ppt-master/scripts/pptx_ooxml/analyzer.py:141— skills/ppt-master/scripts/pptx_ooxml/analyzer.py changed 4 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 10 (its worst body is analyzer._slot_role at line 141), 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(pptx_intake): report grouped shapes in slide space by applying every enclosing grpSp transform”; “fix: PPTX read-back keeps soft line breaks; page types match whole words; beautify keeps run emphasis”; “fix: preset atoms keep their paint through style compaction; beautify intake ranks sizes by text carried”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/pptx_ooxml/analyzer.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.
Repeated repair: skills/ppt-master/scripts/image_backends/backend_qwen.py skills/ppt-master/scripts/image_backends/backend_qwen.py:129— skills/ppt-master/scripts/image_backends/backend_qwen.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 10 (its worst body is backend_qwen._generate_image at line 129), 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(image-backends): correct Qwen 2K ratios, Ark base URL, Replicate 21:9”; “fix(image-generation): stop retrying permanent backend failures”; “fix(image-backends): align provider contracts and defaults”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_qwen.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.
Repeated repair: skills/ppt-master/scripts/image_backends/backend_replicate.py skills/ppt-master/scripts/image_backends/backend_replicate.py:103— skills/ppt-master/scripts/image_backends/backend_replicate.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 backend_replicate._generate_image at line 103), 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(image-backends): correct Qwen 2K ratios, Ark base URL, Replicate 21:9”; “fix(image-generation): stop retrying permanent backend failures”; “fix(image-backends): align provider contracts and defaults”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_replicate.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.
Repeated repair: skills/ppt-master/scripts/image_backends/backend_volcengine.py skills/ppt-master/scripts/image_backends/backend_volcengine.py:159— skills/ppt-master/scripts/image_backends/backend_volcengine.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 8 (its worst body is backend_volcengine.generate at line 159), 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(image-backends): correct Qwen 2K ratios, Ark base URL, Replicate 21:9”; “fix(image-generation): stop retrying permanent backend failures”; “fix(image-backends): align provider contracts and defaults”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_volcengine.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.
Repeated repair: skills/ppt-master/scripts/image_backends/backend_minimax.py skills/ppt-master/scripts/image_backends/backend_minimax.py:157— skills/ppt-master/scripts/image_backends/backend_minimax.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 8 (its worst body is backend_minimax._generate_image at line 157), 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(image-generation): stop retrying permanent backend failures”; “fix(image-gen): handle documented image_urls response shape in MiniMax backend”; “fix(image-backends): align provider contracts and defaults”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-07-26..2026-10-24, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-07-26 15:39:08 +00:00' --until='2026-10-24 15:39:08 +00:00' --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_minimax.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.
Duplicated block (10 lines × 2) skills/ppt-master/scripts/mirror_template_materialize.py:3069— skills/ppt-master/scripts/mirror_template_materialize.py:3069-3078 | skills/ppt-master/scripts/mirror_template_materialize.py:3079-3088 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) skills/ppt-master/scripts/pptx_intake.py:243— skills/ppt-master/scripts/pptx_intake.py:243-252 | skills/ppt-master/scripts/spec_review/store.py:67-76 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1299— skills/ppt-master/scripts/source_to_md/doc_to_md.py:1299-1308 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:1495-1504 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10 lines × 2) skills/ppt-master/scripts/svg_authoring_view.py:1639— skills/ppt-master/scripts/svg_authoring_view.py:1639-1648 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1577-1586 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (10 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:440— skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:440-449 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:454-463 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:440` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:870— skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:870-879 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:894-903 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1835— skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1835-1844 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1894-1903 — both copies are in the same file, so extract the 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.
FunctionTooLong: app.renderTypography skills/ppt-master/scripts/confirm_ui/static/app.js:3058— FunctionTooLong — renderTypography runs 257 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 157 over it, 2.57× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: app.renderImageDirection skills/ppt-master/scripts/confirm_ui/static/app.js:3566— FunctionTooLong — renderImageDirection runs 194 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 94 over it, 1.94× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: app.enumField skills/ppt-master/scripts/confirm_ui/static/app.js:1418— FunctionTooLong — enumField runs 152 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 52 over it, 1.52× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
FunctionTooLong: app.renderColor skills/ppt-master/scripts/confirm_ui/static/app.js:2839— FunctionTooLong — renderColor runs 105 significant lines (blank, comment-only and punctuation-only lines excluded) in one body. The bar is 100 significant lines; this is 5 over it, 1.05× the bar. This is length, not branching: a long straight-line body scores low on complexity and is still read whole to change any part of it, so the complexity numbers beside this row neither confirm nor excuse it. To reduce it, extract each cohesive step of the body — the runs of statements that work on the same values and would earn the same name — into its own named unit, and have this one call them in order.
Change coupling: error_helper.py ↔ svg_quality_checker.py skills/ppt-master/scripts/error_helper.py:1— `skills/ppt-master/scripts/error_helper.py` and `skills/ppt-master/scripts/svg_quality_checker.py` change together 62% of the time (10 of the 16 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 10 shared commits counted here, the most recent 3 are `a41ff009` docs(svg-authoring): allow static local use references; `835ea017` docs(svg-authoring): allow CSS alpha colors; `813505aa` docs(svg-authoring): allow approximate group opacity — run `git show` on any of them.
Change coupling: svg_authoring_view.py ↔ builder.py skills/ppt-master/scripts/svg_authoring_view.py:1— `skills/ppt-master/scripts/svg_authoring_view.py` and `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py` change together 57% of the time (8 of the 14 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `73bc51a3` fix: round-trip quality gate reads a validation/ report bound to the …; `57f76234` fix: round-trip fidelity — inherited slide jumps keep source identity…; `9a02227c` fix(roundtrip): close adversarial-review defects and skip conversion … — run `git show` on any of them.
Change coupling: flatten_tspan.py ↔ elements.py skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:1— `skills/ppt-master/scripts/svg_finalize/flatten_tspan.py` and `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py` change together 57% of the time (13 of the 23 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 13 shared commits counted here, the most recent 3 are `3d1b7dc6` fix(svg-to-pptx): preserve text baselines across SVG and PPTX conversion; `397c5d92` fix(scripts): keep single-child group rotation, carry inline tspan dx…; `5a46c0cf` feat(svg-to-pptx): add native superscript and subscript runs — run `git show` on any of them.
Change coupling: config.py ↔ error_helper.py skills/ppt-master/scripts/config.py:1— `skills/ppt-master/scripts/config.py` and `skills/ppt-master/scripts/error_helper.py` change together 53% of the time (8 of the 15 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency between them. They sit in the same directory, but in this ecosystem each file is its own module — a sibling reference still needs an import — so the missing import edge is real: the coupling runs through shared behaviour, not a declared dependency. If they duplicate structure, extract the common part into one unit; otherwise the coupling is hidden and worth breaking. You can check this without leaving the row: of the 8 shared commits counted here, the most recent 3 are `a41ff009` docs(svg-authoring): allow static local use references; `835ea017` docs(svg-authoring): allow CSS alpha colors; `813505aa` docs(svg-authoring): allow approximate group opacity — run `git show` on any of them.
Duplicated block (19 lines × 2) skills/ppt-master/scripts/authoring_roundtrip.py:818— skills/ppt-master/scripts/authoring_roundtrip.py:818-836 | skills/ppt-master/scripts/authoring_roundtrip.py:880-898 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/authoring_roundtrip.py:816` calls `isinstance`, `AuthoringRoundtripError` and `skills/ppt-master/scripts/authoring_roundtrip.py:879` 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 (19 lines × 2) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:545— skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:545-563 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1601-1619 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:545` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:966— skills/ppt-master/scripts/svg_quality/checker.py:966-984 | skills/ppt-master/scripts/svg_quality/checker.py:989-1007 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1217— skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1217-1235 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1462-1480 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) skills/ppt-master/scripts/register_template.py:830— skills/ppt-master/scripts/register_template.py:830-843 | skills/ppt-master/scripts/register_template.py:957-970 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1257— skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1257-1270 | skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1274-1287 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14 lines × 2) skills/ppt-master/scripts/svg_position_calculator.py:1190— skills/ppt-master/scripts/svg_position_calculator.py:1190-1203 | skills/ppt-master/scripts/svg_position_calculator.py:1207-1220 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2378— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2378-2391 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2527-2540 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2378` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17 lines × 2) skills/ppt-master/scripts/batch_validate.py:236— skills/ppt-master/scripts/batch_validate.py:236-252 | skills/ppt-master/scripts/svg_quality/checker.py:10110-10126 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (17 lines × 2) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1115— skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1115-1131 | skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1228-1244 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1361— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1361-1377 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1608-1624 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1361` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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 × 3) skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:593— skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:593-602 | skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:609-618 | skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:651-660 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (10 lines × 3) skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:445— skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:445-454 | skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:479-488 | skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:511-520 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10 lines × 3) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:260— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:260-269 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:271-280 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:298-307 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:260` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–10 lines × 2) skills/ppt-master/scripts/notes_to_audio.py:533— skills/ppt-master/scripts/notes_to_audio.py:533-542 | skills/ppt-master/scripts/notes_to_audio.py:568-576 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/notes_to_audio.py:533` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–10 lines × 2) skills/ppt-master/scripts/pptx_animations.py:1604— skills/ppt-master/scripts/pptx_animations.py:1604-1613 | skills/ppt-master/scripts/pptx_animations.py:1643-1651 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_animations.py:1604` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (9–10 lines × 2) skills/ppt-master/scripts/svg_quality/svg_contracts.py:740— skills/ppt-master/scripts/svg_quality/svg_contracts.py:740-749 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:952-960 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_quality/svg_contracts.py:740` 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.
X24 · Document value interpolated into markup unescaped· Document value reaches a markup attribute unescaped · ×3
Document value reaches a markup attribute unescaped skills/ppt-master/scripts/svg_quality/checker.py:5581— `elem_id` carries text this program read out of a document — an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again — and it is written straight into the `id` attribute of markup built here with nothing escaping it on the way. The value is chosen by whoever authored that document, not by this program, so it can close the attribute or element it sits in and open another — a crafted document becomes markup in what this code renders. Escape `elem_id` at this site, or validate it against the shape the position accepts before interpolating it.
Document value reaches a markup attribute unescaped skills/ppt-master/scripts/svg_quality/checker.py:5591— `elem_id` carries text this program read out of a document — an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again — and it is written straight into the `id` attribute of markup built here with nothing escaping it on the way. The value is chosen by whoever authored that document, not by this program, so it can close the attribute or element it sits in and open another — a crafted document becomes markup in what this code renders. Escape `elem_id` at this site, or validate it against the shape the position accepts before interpolating it.
Document value reaches a markup attribute unescaped skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5469— `elem_id` carries text this program read out of a document — an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again — and it is written straight into the `id` attribute of markup built here with nothing escaping it on the way. The value is chosen by whoever authored that document, not by this program, so it can close the attribute or element it sits in and open another — a crafted document becomes markup in what this code renders. Escape `elem_id` at this site, or validate it against the shape the position accepts before interpolating it.
AC3 · Page structure· Page without a main landmark · ×2
Page without a main landmark index.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
Page without a main landmark skills/ppt-master/scripts/svg_editor/static/index.html:2— No <main> (or role="main") means no "skip to content" target and a weaker landmark map. Wrap the primary content in <main>.
AC3 · Page structure· Data table has no header cells · ×2
Data table has no header cells REDACTED:2111— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
Data table has no header cells REDACTED:2938— A <table> with data cells but no <th> gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as <th> (with a scope).
TooManyMethods: _LatexParser skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:445— TooManyMethods — 57 methods. The bar is 30 methods; this is 27 over it, 1.90× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: ProjectManager skills/ppt-master/scripts/project_management/cli.py:274— TooManyMethods — 32 methods. The bar is 30 methods; this is 2 over it, 1.07× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (29 lines × 2) skills/ppt-master/scripts/finalize_svg.py:145— skills/ppt-master/scripts/finalize_svg.py:145-173 | skills/ppt-master/scripts/pptx_to_svg/converter.py:1311-1339 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (29 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1592— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1592-1620 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5145-5173 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1592` 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 (20 lines × 2) skills/ppt-master/scripts/image_backends/backend_openai.py:568— skills/ppt-master/scripts/image_backends/backend_openai.py:568-587 | skills/ppt-master/scripts/image_backends/backend_openai.py:670-689 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/image_backends/backend_openai.py:568` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (20 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:731— skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:731-750 | skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:766-785 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–20 lines × 2) skills/ppt-master/scripts/pptx_animations.py:666— skills/ppt-master/scripts/pptx_animations.py:666-683 | skills/ppt-master/scripts/pptx_transitions.py:1085-1104 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_animations.py:666` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (18–20 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7512— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7512-7531 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:8073-8090 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18 lines × 2) skills/ppt-master/scripts/confirm_ui/server.py:2805— skills/ppt-master/scripts/confirm_ui/server.py:2805-2822 | skills/ppt-master/scripts/svg_editor/server.py:1482-1499 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (18 lines × 2) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1370— skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1370-1387 | skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1445-1462 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14–15 lines × 3) skills/ppt-master/scripts/source_to_md/doc_to_md.py:716— skills/ppt-master/scripts/source_to_md/doc_to_md.py:716-730 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:912-926 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:1000-1013 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14–15 lines × 3) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3937— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3937-3951 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4038-4052 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5528-5541 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3937` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12–14 lines × 2) skills/ppt-master/scripts/pptx_effects.py:139— skills/ppt-master/scripts/pptx_effects.py:139-152 | skills/ppt-master/scripts/pptx_gradients.py:102-113 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12–14 lines × 2) skills/ppt-master/scripts/prompt_audit.py:1519— skills/ppt-master/scripts/prompt_audit.py:1519-1532 | skills/ppt-master/scripts/prompt_audit.py:1535-1546 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/prompt_audit.py:1519` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–14 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:3698— skills/ppt-master/scripts/svg_quality/checker.py:3698-3711 | skills/ppt-master/scripts/svg_quality/checker.py:3770-3782 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_quality/checker.py:3698` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–14 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2993— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2993-3006 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4644-4656 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note first that the copies are not typed on the same thing: the declarations holding them bind `slide_num` to `layout_shape) promoted_roles += 1 for` in one and `master_shape) promoted_roles += 1 for` 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 (13 lines × 2) skills/ppt-master/scripts/pptx_animations.py:1392— skills/ppt-master/scripts/pptx_animations.py:1392-1404 | skills/ppt-master/scripts/pptx_animations.py:1416-1428 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2865— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2865-2877 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4487-4499 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10–13 lines × 2) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:996— skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:996-1005 | skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1203-1215 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:996` 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.
Duplicated block (10–13 lines × 2) skills/ppt-master/scripts/source_to_md/web_to_md.py:723— skills/ppt-master/scripts/source_to_md/web_to_md.py:723-732 | skills/ppt-master/scripts/source_to_md/web_to_md.py:734-746 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (9–11 lines × 2) skills/ppt-master/scripts/pptx_animations.py:707— skills/ppt-master/scripts/pptx_animations.py:707-715 | skills/ppt-master/scripts/pptx_transitions.py:1149-1159 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (9–11 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:796— skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:796-806 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:811-819 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (10–11 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:3399— skills/ppt-master/scripts/svg_quality/checker.py:3399-3408 | skills/ppt-master/scripts/svg_quality/checker.py:4540-4550 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (10–11 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2891— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2891-2901 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4501-4510 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2891` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8–10 lines × 2) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2760— skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2760-2767 | skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2839-2848 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2839` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8–10 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2340— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2340-2347 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2569-2578 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2336` calls `set` and `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2568` 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.
X24 · Document value interpolated into markup unescaped· Untrusted text written into markup unescaped · ×2
Untrusted text written into markup unescaped skills/ppt-master/scripts/confirm_ui/static/app.js:968— `label` is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
Untrusted text written into markup unescaped skills/ppt-master/scripts/confirm_ui/static/app.js:3546— `icons[idx]` is text this program did not author, and it is written into the text of an element through markup this function returns with nothing encoding it for that place. Whoever controls the value controls the markup: it can close the element or attribute it sits in and open a script of its own. Encode it for HTML at this site, render it through the framework's escaping output, or sanitise it if it must stay markup.
AC7 · A11y enforcement· Accessibility enforcement below the top rung · ×1
Accessibility enforcement below the top rung — No accessibility enforcement found — no automated accessibility check runs over your pages. Add an accessibility checker (axe-core, pa11y or Lighthouse) over your HTML in CI and fail the build on new violations. What was searched, so you can tell an absence from a miss: the 5 markup file(s) this pass actually assessed, the linter configuration checked in beside them, and this repository's test and CI files — matched by name against the accessibility checkers this dimension carries. An audit run outside the repository, a hosted scanner, or a check whose name is not one of those, is not seen here.
builder.create_pptx_with_native_svg (cyclomatic 348) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6730— builder.create_pptx_with_native_svg has cyclomatic complexity 348 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli.main (cyclomatic 309) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1982— cli.main has cyclomatic complexity 309 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
template_structure.parse_template_slide (cyclomatic 128) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1512— template_structure.parse_template_slide has cyclomatic complexity 128 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
elements.convert_text (cyclomatic 107) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3158— elements.convert_text has cyclomatic complexity 107 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
template_validation.validate_pptx_template_package (cyclomatic 107) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py:868— template_validation.validate_pptx_template_package has cyclomatic complexity 107 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
template_structure.load_pptx_structure_lock (cyclomatic 103) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:697— template_structure.load_pptx_structure_lock has cyclomatic complexity 103 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ProjectManager.import_sources (cyclomatic 90) skills/ppt-master/scripts/project_management/cli.py:857— ProjectManager.import_sources has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
register_template._validate_style_spec (cyclomatic 90) skills/ppt-master/scripts/register_template.py:658— register_template._validate_style_spec has cyclomatic complexity 90 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pdf_to_md.extract_pdf_to_markdown (cyclomatic 87) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1419— pdf_to_md.extract_pdf_to_markdown has cyclomatic complexity 87 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
_LatexParser._parse_command (cyclomatic 85) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:562— _LatexParser._parse_command has cyclomatic complexity 85 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._check_planned_image_closure (cyclomatic 81) skills/ppt-master/scripts/svg_quality/checker.py:8570— SVGQualityChecker._check_planned_image_closure has cyclomatic complexity 81 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.renderTypography (cyclomatic 79) skills/ppt-master/scripts/confirm_ui/static/app.js:3058— app.renderTypography has cyclomatic complexity 79 (threshold 15). Of this number, 17 points are the body's own statements and 62 belong to 18 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
converter.convert_svg_to_slide_shapes (cyclomatic 77) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2018— converter.convert_svg_to_slide_shapes has cyclomatic complexity 77 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
image_search.main (cyclomatic 75) skills/ppt-master/scripts/image_search.py:2617— image_search.main has cyclomatic complexity 75 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
converter.convert_g (cyclomatic 70) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1204— converter.convert_g has cyclomatic complexity 70 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
image_gen.load_manifest (cyclomatic 69) skills/ppt-master/scripts/image_gen.py:588— image_gen.load_manifest has cyclomatic complexity 69 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
manifest.build_manifest (cyclomatic 63) skills/ppt-master/scripts/template_import/manifest.py:501— manifest.build_manifest has cyclomatic complexity 63 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ln_to_svg.resolve_stroke (cyclomatic 62) skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py:75— ln_to_svg.resolve_stroke has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
checker._local_pptx_structure_errors (cyclomatic 62) skills/ppt-master/scripts/svg_quality/checker.py:633— checker._local_pptx_structure_errors has cyclomatic complexity 62 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
notes_to_audio.main (cyclomatic 61) skills/ppt-master/scripts/notes_to_audio.py:439— notes_to_audio.main has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._check_spec_lock_alignment (cyclomatic 61) skills/ppt-master/scripts/svg_quality/checker.py:6727— SVGQualityChecker._check_spec_lock_alignment has cyclomatic complexity 61 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker.check_directory (cyclomatic 60) skills/ppt-master/scripts/svg_quality/checker.py:7265— SVGQualityChecker.check_directory has cyclomatic complexity 60 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
prompt_audit.load_manifest (cyclomatic 59) skills/ppt-master/scripts/prompt_audit.py:124— prompt_audit.load_manifest has cyclomatic complexity 59 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_delivery_check.audit_pptx_delivery (cyclomatic 57) skills/ppt-master/scripts/pptx_delivery_check.py:727— pptx_delivery_check.audit_pptx_delivery has cyclomatic complexity 57 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cli.main (cyclomatic 57) skills/ppt-master/scripts/svg_quality/cli.py:168— cli.main has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
table._build_native_table (cyclomatic 57) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1782— table._build_native_table has cyclomatic complexity 57 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
authoring_roundtrip._load_documents (cyclomatic 56) skills/ppt-master/scripts/authoring_roundtrip.py:325— authoring_roundtrip._load_documents has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mirror_template_materialize.materialize_mirror_template (cyclomatic 56) skills/ppt-master/scripts/mirror_template_materialize.py:2973— mirror_template_materialize.materialize_mirror_template has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_animations.validate_slide_animation_structure (cyclomatic 56) skills/ppt-master/scripts/pptx_animations.py:3033— pptx_animations.validate_slide_animation_structure has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_to_svg._axis_config_from_xml (cyclomatic 56) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1338— chart_to_svg._axis_config_from_xml has cyclomatic complexity 56 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.renderImageDirection (cyclomatic 55) skills/ppt-master/scripts/confirm_ui/static/app.js:3566— app.renderImageDirection has cyclomatic complexity 55 (threshold 15). Of this number, 29 points are the body's own statements and 26 belong to 9 function items inside it that branch. To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
template_structure.load_native_structure_contract (cyclomatic 54) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1183— template_structure.load_native_structure_contract has cyclomatic complexity 54 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
builder._apply_roundtrip_slide_overlay (cyclomatic 53) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1683— builder._apply_roundtrip_slide_overlay has cyclomatic complexity 53 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_data._chart_axes (cyclomatic 52) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:308— chart_data._chart_axes has cyclomatic complexity 52 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
inline_formula.inline_formula_marker_errors (cyclomatic 51) skills/ppt-master/scripts/svg_to_pptx/native_objects/inline_formula.py:84— inline_formula.inline_formula_marker_errors has cyclomatic complexity 51 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ppt_to_md.convert_presentation_to_markdown (cyclomatic 50) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:1219— ppt_to_md.convert_presentation_to_markdown has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
elements._parse_preset_geometry_metadata (cyclomatic 50) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:808— elements._parse_preset_geometry_metadata has cyclomatic complexity 50 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
image_search.promote_candidate (cyclomatic 48) skills/ppt-master/scripts/image_search.py:1515— image_search.promote_candidate has cyclomatic complexity 48 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
SVGQualityChecker._check_native_object_markers (cyclomatic 48) skills/ppt-master/scripts/svg_quality/checker.py:6018— SVGQualityChecker._check_native_object_markers has cyclomatic complexity 48 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
authoring_roundtrip._materialize_document (cyclomatic 47) skills/ppt-master/scripts/authoring_roundtrip.py:1771— authoring_roundtrip._materialize_document has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
preset_authoring._validate_expanded_authored_preset_group (cyclomatic 47) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:357— preset_authoring._validate_expanded_authored_preset_group has cyclomatic complexity 47 (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.
prompt_audit.audit_registries (cyclomatic 47) skills/ppt-master/scripts/prompt_audit.py:1274— prompt_audit.audit_registries has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils.project_filter_errors (cyclomatic 47) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2798— utils.project_filter_errors has cyclomatic complexity 47 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
formula_import._serialize_node_content (cyclomatic 46) skills/ppt-master/scripts/pptx_to_svg/formula_import.py:255— formula_import._serialize_node_content has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
slice_images.slice_sheet (cyclomatic 46) skills/ppt-master/scripts/slice_images.py:937— slice_images.slice_sheet has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
template_structure.template_prototype_errors (cyclomatic 46) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:3241— template_structure.template_prototype_errors has cyclomatic complexity 46 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._positioned_text_lines (cyclomatic 45) skills/ppt-master/scripts/svg_quality/checker.py:3619— SVGQualityChecker._positioned_text_lines has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._check_pptx_structure_contract (cyclomatic 45) skills/ppt-master/scripts/svg_quality/checker.py:7556— SVGQualityChecker._check_pptx_structure_contract has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
elements.parse_project_nested_svg_crop (cyclomatic 45) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5261— elements.parse_project_nested_svg_crop has cyclomatic complexity 45 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
formula_omml._validate_math_structure (cyclomatic 45) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:759— formula_omml._validate_math_structure has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli._roundtrip_passthrough_candidates (cyclomatic 45) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:345— cli._roundtrip_passthrough_candidates has cyclomatic complexity 45 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_to_svg._validate_chart_semantics (cyclomatic 44) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1864— chart_to_svg._validate_chart_semantics has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
animation_config.validate_animation_config (cyclomatic 44) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1570— animation_config.validate_animation_config has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli.main (cyclomatic 43) skills/ppt-master/scripts/project_management/cli.py:1389— cli.main has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils.project_marker_errors (cyclomatic 43) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2042— utils.project_marker_errors has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
builder._build_sequence_targets (cyclomatic 43) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:5844— builder._build_sequence_targets has cyclomatic complexity 43 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.rawMoveAttrs (cyclomatic 43) REDACTED:2591— app.rawMoveAttrs has cyclomatic complexity 43 (threshold 15). Of this number, 24 points are the body's own statements and 19 belong to 3 function items inside it that branch. To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_to_svg._apply_series_formatting (cyclomatic 42) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2014— chart_to_svg._apply_series_formatting has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tbl_to_svg.convert_tbl (cyclomatic 42) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:279— tbl_to_svg.convert_tbl has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_workspace._sniff_resource_format (cyclomatic 42) skills/ppt-master/scripts/pptx_workspace.py:291— pptx_workspace._sniff_resource_format has cyclomatic complexity 42 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
doc_to_md._omml_to_latex (cyclomatic 42) skills/ppt-master/scripts/source_to_md/doc_to_md.py:548— doc_to_md._omml_to_latex has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
builder._promote_common_chrome_shapes_to_masters (cyclomatic 42) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4479— builder._promote_common_chrome_shapes_to_masters has cyclomatic complexity 42 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.boot (cyclomatic 42) skills/ppt-master/scripts/confirm_ui/static/app.js:4528— app.boot has cyclomatic complexity 42 (threshold 15). Most of this is not in the body itself: 1 of the 42 points is its own statement and the rest belongs to 10 function items inside it that branch (a function literal at line 4575, chooseLang, a function literal at line 4559, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
server._validate_template_selection (cyclomatic 41) skills/ppt-master/scripts/confirm_ui/server.py:560— server._validate_template_selection has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
narration_sync.rebuild_animations (cyclomatic 41) skills/ppt-master/scripts/narration_sync.py:1067— narration_sync.rebuild_animations has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_animations.validate_generated_animation_xml (cyclomatic 41) skills/ppt-master/scripts/pptx_animations.py:3318— pptx_animations.validate_generated_animation_xml has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
slide_to_svg._convert_shape (cyclomatic 41) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:532— slide_to_svg._convert_shape has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils.project_gradient_errors (cyclomatic 41) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2462— utils.project_gradient_errors has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_patch._patch_workbook (cyclomatic 41) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:308— chart_patch._patch_workbook has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
video_sound_mix.mix_video_sounds (cyclomatic 41) skills/ppt-master/scripts/video_sound_mix.py:1129— video_sound_mix.mix_video_sounds has cyclomatic complexity 41 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
hyperlink_contract.project_hyperlink_errors (cyclomatic 40) skills/ppt-master/scripts/hyperlink_contract.py:164— hyperlink_contract.project_hyperlink_errors has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
preset_authoring._validate_compact_authored_preset_group (cyclomatic 40) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:208— preset_authoring._validate_compact_authored_preset_group has cyclomatic complexity 40 (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.
SVGQualityChecker._check_module_bounds_contract (cyclomatic 40) skills/ppt-master/scripts/svg_quality/checker.py:4615— SVGQualityChecker._check_module_bounds_contract has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils.project_paint_reference_errors (cyclomatic 40) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2268— utils.project_paint_reference_errors has cyclomatic complexity 40 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_animations._read_effect_options (cyclomatic 39) skills/ppt-master/scripts/pptx_animations.py:2382— pptx_animations._read_effect_options has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tbl_to_svg._text_body_has_unsupported_formatting (cyclomatic 39) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:942— tbl_to_svg._text_body_has_unsupported_formatting has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
flatten_tspan._classify_paragraph_block (cyclomatic 39) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:326— flatten_tspan._classify_paragraph_block has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
svg_position_calculator.main (cyclomatic 39) skills/ppt-master/scripts/svg_position_calculator.py:1378— svg_position_calculator.main has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
animation_config._animation_parameter_errors (cyclomatic 39) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:533— animation_config._animation_parameter_errors has cyclomatic complexity 39 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mirror_template_materialize._compose_template (cyclomatic 38) skills/ppt-master/scripts/mirror_template_materialize.py:2392— mirror_template_materialize._compose_template 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.
pptx_animations._load_native_animations (cyclomatic 38) skills/ppt-master/scripts/pptx_animations.py:219— pptx_animations._load_native_animations 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.
SVGQualityChecker._check_text_bounds (cyclomatic 38) skills/ppt-master/scripts/svg_quality/checker.py:4814— SVGQualityChecker._check_text_bounds 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.
app.initKeyboardShortcuts (cyclomatic 38) REDACTED:1554— app.initKeyboardShortcuts has cyclomatic complexity 38 (threshold 15). Most of this is not in the body itself: 1 of the 38 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1555, 1578). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
server._stage2_design_directions_error (cyclomatic 37) skills/ppt-master/scripts/confirm_ui/server.py:1469— server._stage2_design_directions_error 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.
pptx_workspace.workspace_resource_specs (cyclomatic 37) skills/ppt-master/scripts/pptx_workspace.py:592— pptx_workspace.workspace_resource_specs 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.
app.initStage2State (cyclomatic 37) skills/ppt-master/scripts/confirm_ui/static/app.js:4073— app.initStage2State has cyclomatic complexity 37 (threshold 15). Of this number, 34 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
chart_to_svg._combo_payload (cyclomatic 36) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:264— chart_to_svg._combo_payload has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
normalized_chart_svg._render_xy (cyclomatic 36) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:797— normalized_chart_svg._render_xy has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tbl_to_svg._direct_border_payload (cyclomatic 36) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:750— tbl_to_svg._direct_border_payload has cyclomatic complexity 36 (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.
prompt_audit.audit_schema_grammars (cyclomatic 36) skills/ppt-master/scripts/prompt_audit.py:1769— prompt_audit.audit_schema_grammars has cyclomatic complexity 36 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
marker_status.native_marker_status_errors (cyclomatic 36) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_status.py:89— marker_status.native_marker_status_errors has cyclomatic complexity 36 (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.
cli._roundtrip_slide_patches (cyclomatic 36) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:510— cli._roundtrip_slide_patches has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
app.enumField (cyclomatic 36) skills/ppt-master/scripts/confirm_ui/static/app.js:1418— app.enumField has cyclomatic complexity 36 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages. This shape REPEATS in the file: one other method here (app.enumField::makeChip) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
chart_to_svg._apply_chart_metadata (cyclomatic 35) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2169— chart_to_svg._apply_chart_metadata has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
register_template._validate_brand_spec (cyclomatic 35) skills/ppt-master/scripts/register_template.py:521— register_template._validate_brand_spec has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
svg_position_calculator.interactive_mode (cyclomatic 35) skills/ppt-master/scripts/svg_position_calculator.py:1156— svg_position_calculator.interactive_mode has cyclomatic complexity 35 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
SVGQualityChecker._check_template_contract (cyclomatic 35) skills/ppt-master/scripts/svg_quality/checker.py:9184— SVGQualityChecker._check_template_contract has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli._opaque_roundtrip_dependency_owner_refs (cyclomatic 35) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:810— cli._opaque_roundtrip_dependency_owner_refs has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
semantic_markers.validate_semantic_markers (cyclomatic 35) skills/ppt-master/scripts/svg_to_pptx/semantic_markers.py:126— semantic_markers.validate_semantic_markers has cyclomatic complexity 35 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
image_search.run_search_manifest (cyclomatic 34) skills/ppt-master/scripts/image_search.py:2148— image_search.run_search_manifest has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
image_treat._apply_treatments (cyclomatic 34) skills/ppt-master/scripts/image_treat.py:333— image_treat._apply_treatments has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_to_svg._validate_stock_semantics (cyclomatic 34) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:471— chart_to_svg._validate_stock_semantics has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_to_svg._apply_chart_formatting (cyclomatic 34) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2303— chart_to_svg._apply_chart_formatting has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
register_template._validate_svg_template_spec (cyclomatic 34) skills/ppt-master/scripts/register_template.py:991— register_template._validate_svg_template_spec has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SVGQualityChecker._check_image_references (cyclomatic 34) skills/ppt-master/scripts/svg_quality/checker.py:5257— SVGQualityChecker._check_image_references has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
styles.parse_pattern_colors (cyclomatic 34) skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:211— styles.parse_pattern_colors has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
formula_omml._append_node (cyclomatic 34) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:277— formula_omml._append_node has cyclomatic complexity 34 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_ChemParser.parse (cyclomatic 34) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1815— _ChemParser.parse has cyclomatic complexity 34 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.normTypography (cyclomatic 34) skills/ppt-master/scripts/confirm_ui/static/app.js:1812— app.normTypography has cyclomatic complexity 34 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
language_tags.normalize_language_tag (cyclomatic 33) skills/ppt-master/scripts/language_tags.py:159— language_tags.normalize_language_tag has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mirror_template_materialize._validate_graph_roster (cyclomatic 33) skills/ppt-master/scripts/mirror_template_materialize.py:974— mirror_template_materialize._validate_graph_roster has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_to_svg._data_label_text_style (cyclomatic 33) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2539— chart_to_svg._data_label_text_style has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
converter.convert_pptx_to_svg (cyclomatic 33) skills/ppt-master/scripts/pptx_to_svg/converter.py:482— converter.convert_pptx_to_svg has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
svg_authoring_view._is_semantic_shape_candidate (cyclomatic 33) skills/ppt-master/scripts/svg_authoring_view.py:517— svg_authoring_view._is_semantic_shape_candidate has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
align_embed_images._process_one_image (cyclomatic 33) skills/ppt-master/scripts/svg_finalize/align_embed_images.py:348— align_embed_images._process_one_image has cyclomatic complexity 33 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SVGQualityChecker._check_roundtrip_text_frames (cyclomatic 33) skills/ppt-master/scripts/svg_quality/checker.py:2202— SVGQualityChecker._check_roundtrip_text_frames has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_data._combo_chart_data (cyclomatic 33) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:1212— chart_data._combo_chart_data has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
builder._promote_common_chrome_shapes_to_layouts (cyclomatic 33) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2858— builder._promote_common_chrome_shapes_to_layouts has cyclomatic complexity 33 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_transitions._validate_applied_motion (cyclomatic 32) skills/ppt-master/scripts/pptx_transitions.py:1977— pptx_transitions._validate_applied_motion 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.
crop_images.process_svg_images (cyclomatic 32) skills/ppt-master/scripts/svg_finalize/crop_images.py:143— crop_images.process_svg_images 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.
table._native_table_border_topology_warnings (cyclomatic 32) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1232— table._native_table_border_topology_warnings 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.
app.renderColor (cyclomatic 32) skills/ppt-master/scripts/confirm_ui/static/app.js:2839— app.renderColor has cyclomatic complexity 32 (threshold 15). Most of this is not in the body itself: 10 of the 32 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 2932, a function literal at line 2854, selectCard, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
finalize_svg._process_candidate_directory (cyclomatic 31) skills/ppt-master/scripts/finalize_svg.py:176— finalize_svg._process_candidate_directory 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.
narration_sync._resolve_animation_groups (cyclomatic 31) skills/ppt-master/scripts/narration_sync.py:827— narration_sync._resolve_animation_groups 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.
page_context.build_page_context (cyclomatic 31) skills/ppt-master/scripts/project_management/page_context.py:470— page_context.build_page_context has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
prompt_audit._registry_ids (cyclomatic 31) skills/ppt-master/scripts/prompt_audit.py:1115— prompt_audit._registry_ids 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.
web_to_md.element_to_markdown (cyclomatic 31) skills/ppt-master/scripts/source_to_md/web_to_md.py:945— web_to_md.element_to_markdown has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
svg_authoring_view.main (cyclomatic 31) skills/ppt-master/scripts/svg_authoring_view.py:2724— svg_authoring_view.main has cyclomatic complexity 31 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
server.main (cyclomatic 31) skills/ppt-master/scripts/svg_editor/server.py:1481— server.main 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.
slot_capacity.slot_capacity_report (cyclomatic 31) skills/ppt-master/scripts/svg_quality/slot_capacity.py:131— slot_capacity.slot_capacity_report 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.
chart_xml._chart_plot_xml (cyclomatic 31) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:1212— chart_xml._chart_plot_xml 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.
backend_cosyvoice._word_boundaries (cyclomatic 31) skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:129— backend_cosyvoice._word_boundaries 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.
app.renderDesignDirections (cyclomatic 31) skills/ppt-master/scripts/confirm_ui/static/app.js:2277— app.renderDesignDirections has cyclomatic complexity 31 (threshold 15). Most of this is not in the body itself: 5 of the 31 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 2284, 2366, 2333, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
image_gen._run_manifest (cyclomatic 30) skills/ppt-master/scripts/image_gen.py:901— image_gen._run_manifest 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.
image_gen.main (cyclomatic 30) skills/ppt-master/scripts/image_gen.py:1245— image_gen.main has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_to_svg._canonical_title_paragraph (cyclomatic 30) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2412— chart_to_svg._canonical_title_paragraph has cyclomatic complexity 30 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
pptx_transitions.validate_pptx_morph_pairs (cyclomatic 30) skills/ppt-master/scripts/pptx_transitions.py:2712— pptx_transitions.validate_pptx_morph_pairs 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.
pptx_transitions.validate_slide_transition_structure (cyclomatic 30) skills/ppt-master/scripts/pptx_transitions.py:2899— pptx_transitions.validate_slide_transition_structure 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.
flatten_tspan.flatten_text_with_tspans (cyclomatic 30) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:565— flatten_tspan.flatten_text_with_tspans 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.
SVGQualityChecker._check_preset_geometry_metadata (cyclomatic 30) skills/ppt-master/scripts/svg_quality/checker.py:5512— SVGQualityChecker._check_preset_geometry_metadata 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.
checker._compact_preset_ancestor_paint (cyclomatic 30) skills/ppt-master/scripts/svg_quality/checker.py:488— checker._compact_preset_ancestor_paint 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.
elements._clip_preset_geometry_error (cyclomatic 30) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3864— elements._clip_preset_geometry_error 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.
formula_ast._node_vertical_extent (cyclomatic 30) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:299— formula_ast._node_vertical_extent 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.
formula_omml._validate_xml_tree (cyclomatic 30) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:888— formula_omml._validate_xml_tree 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.
image_search.search_and_download (cyclomatic 29) skills/ppt-master/scripts/image_search.py:1066— image_search.search_and_download 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.
pptx_animations.normalize_animation_effect_options (cyclomatic 29) skills/ppt-master/scripts/pptx_animations.py:558— pptx_animations.normalize_animation_effect_options 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.
chart_to_svg._payload_from_chart_xml (cyclomatic 29) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:126— chart_to_svg._payload_from_chart_xml has cyclomatic complexity 29 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_to_svg._effective_scatter_style (cyclomatic 29) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1754— chart_to_svg._effective_scatter_style 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.
source_to_md.dispatch_single (cyclomatic 29) skills/ppt-master/scripts/source_to_md.py:282— source_to_md.dispatch_single 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.
excel_to_md._convert_excel (cyclomatic 29) skills/ppt-master/scripts/source_to_md/excel_to_md.py:322— excel_to_md._convert_excel 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.
formula_omml._append_run (cyclomatic 29) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:181— formula_omml._append_run 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.
template_structure.template_prototype_lock_errors (cyclomatic 29) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2202— template_structure.template_prototype_lock_errors 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.
server.main (cyclomatic 28) skills/ppt-master/scripts/confirm_ui/server.py:2804— server.main 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.
clone._remap_slide_jump_relationships (cyclomatic 28) skills/ppt-master/scripts/pptx_ooxml/clone.py:266— clone._remap_slide_jump_relationships 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.
source_to_md.dispatch_many (cyclomatic 28) skills/ppt-master/scripts/source_to_md.py:492— source_to_md.dispatch_many 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.
doc_to_md._docx_inject_tables_markdown (cyclomatic 28) skills/ppt-master/scripts/source_to_md/doc_to_md.py:835— doc_to_md._docx_inject_tables_markdown 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.
SVGQualityChecker._check_illustration_resource_contract (cyclomatic 28) skills/ppt-master/scripts/svg_quality/checker.py:8013— SVGQualityChecker._check_illustration_resource_contract 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.
extract_svg_assets.extract_file (cyclomatic 27) skills/ppt-master/scripts/extract_svg_assets.py:791— extract_svg_assets.extract_file has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
extract_svg_pictures._run (cyclomatic 27) skills/ppt-master/scripts/extract_svg_pictures.py:890— extract_svg_pictures._run 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.
native_payloads._load_store (cyclomatic 27) skills/ppt-master/scripts/native_payloads.py:421— native_payloads._load_store has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_animations._row_offset_ms (cyclomatic 27) skills/ppt-master/scripts/pptx_animations.py:2716— pptx_animations._row_offset_ms has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_delivery_check._motion_and_hidden_summary (cyclomatic 27) skills/ppt-master/scripts/pptx_delivery_check.py:510— pptx_delivery_check._motion_and_hidden_summary has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
converter._write_artifact_tree (cyclomatic 27) skills/ppt-master/scripts/pptx_to_svg/converter.py:1342— converter._write_artifact_tree has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
project_utils.validate_project_structure (cyclomatic 27) skills/ppt-master/scripts/project_utils.py:599— project_utils.validate_project_structure has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
web_to_md.find_main_content (cyclomatic 27) skills/ppt-master/scripts/source_to_md/web_to_md.py:881— web_to_md.find_main_content has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_xml._axis_pair_xml (cyclomatic 27) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:931— chart_xml._axis_pair_xml 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.
formula_ast.formula_node_count (cyclomatic 27) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:498— formula_ast.formula_node_count has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli._recorded_narration_on_click_slides (cyclomatic 27) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1863— cli._recorded_narration_on_click_slides has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
template_structure._placement_lint_errors (cyclomatic 27) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:3675— template_structure._placement_lint_errors has cyclomatic complexity 27 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.directionStateSignature (cyclomatic 27) skills/ppt-master/scripts/confirm_ui/static/app.js:1901— app.directionStateSignature has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body's own statements and 4 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
app.selectSlide (cyclomatic 27) REDACTED:723— app.selectSlide has cyclomatic complexity 27 (threshold 15). Most of this is not in the body itself: 3 of the 27 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 749, 807, 833). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
app.promoteTspanDom (cyclomatic 27) REDACTED:2512— app.promoteTspanDom has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body's own statements and 4 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
beautify_inventory.main (cyclomatic 26) skills/ppt-master/scripts/beautify_inventory.py:366— beautify_inventory.main has cyclomatic complexity 26 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
image_search.load_search_manifest (cyclomatic 26) skills/ppt-master/scripts/image_search.py:1887— image_search.load_search_manifest has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mirror_template_materialize._load_authoring_documents (cyclomatic 26) skills/ppt-master/scripts/mirror_template_materialize.py:615— mirror_template_materialize._load_authoring_documents has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
native_payloads.hydrate_native_payload_refs (cyclomatic 26) skills/ppt-master/scripts/native_payloads.py:553— native_payloads.hydrate_native_payload_refs has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
notes_to_audio._expected_note_roster (cyclomatic 26) skills/ppt-master/scripts/notes_to_audio.py:148— notes_to_audio._expected_note_roster has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
tbl_to_svg._canonical_native_merge_status (cyclomatic 26) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:637— tbl_to_svg._canonical_native_merge_status has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
ppt_to_md.text_frame_to_markdown (cyclomatic 26) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:502— ppt_to_md.text_frame_to_markdown has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils._transform_semantic_error (cyclomatic 26) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1167— utils._transform_semantic_error has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_patch._patch_cache (cyclomatic 26) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:194— chart_patch._patch_cache has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
text_measure.main (cyclomatic 26) skills/ppt-master/scripts/text_measure.py:905— text_measure.main has cyclomatic complexity 26 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
authoring_roundtrip._load_page_plan (cyclomatic 25) skills/ppt-master/scripts/authoring_roundtrip.py:627— authoring_roundtrip._load_page_plan 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.
extract_svg_assets._optimize_definitions (cyclomatic 25) skills/ppt-master/scripts/extract_svg_assets.py:299— extract_svg_assets._optimize_definitions 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.
pptx_animations._set_effect_option_value (cyclomatic 25) skills/ppt-master/scripts/pptx_animations.py:1379— pptx_animations._set_effect_option_value 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.
pptx_template_import.main (cyclomatic 25) skills/ppt-master/scripts/pptx_template_import.py:194— pptx_template_import.main has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
converter._managed_report_artifact_paths (cyclomatic 25) skills/ppt-master/scripts/pptx_to_svg/converter.py:1021— converter._managed_report_artifact_paths 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.
normalized_chart_svg._render_lines_or_areas (cyclomatic 25) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:604— normalized_chart_svg._render_lines_or_areas 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.
slide_to_svg._roundtrip_chart_package (cyclomatic 25) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1949— slide_to_svg._roundtrip_chart_package has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
fix_image_aspect.fix_image_aspect_in_svg (cyclomatic 25) skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py:210— fix_image_aspect.fix_image_aspect_in_svg 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.
SVGQualityChecker._roundtrip_text_frame (cyclomatic 25) skills/ppt-master/scripts/svg_quality/checker.py:2443— SVGQualityChecker._roundtrip_text_frame has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
animation_config._morph_scope_errors (cyclomatic 25) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:826— animation_config._morph_scope_errors 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.
elements.project_clip_path_errors (cyclomatic 25) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4102— elements.project_clip_path_errors 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.
native_objects._decode_source_chart_package (cyclomatic 25) skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py:145— native_objects._decode_source_chart_package has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
table._table_run (cyclomatic 25) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:314— table._table_run 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.
builder._apply_explicit_layout_structure (cyclomatic 25) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4193— builder._apply_explicit_layout_structure 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.
app.initRubberBand (cyclomatic 25) REDACTED:1346— app.initRubberBand has cyclomatic complexity 25 (threshold 15). Most of this is not in the body itself: 1 of the 25 points is its own statement and the rest belongs to 5 function literals inside it that branch (lines 1418, 1371, 1473, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
compact_svg_styles._promote_common_group_defaults (cyclomatic 24) skills/ppt-master/scripts/compact_svg_styles.py:350— compact_svg_styles._promote_common_group_defaults has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_animations._normalize_target_mapping (cyclomatic 24) skills/ppt-master/scripts/pptx_animations.py:850— pptx_animations._normalize_target_mapping has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_to_svg._resolved_line (cyclomatic 24) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:731— chart_to_svg._resolved_line has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_to_svg._validate_legacy_axes (cyclomatic 24) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1581— chart_to_svg._validate_legacy_axes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
converter._write_roundtrip_manifest (cyclomatic 24) skills/ppt-master/scripts/pptx_to_svg/converter.py:1602— converter._write_roundtrip_manifest has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
normalized_chart_svg._render_combo (cyclomatic 24) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:305— normalized_chart_svg._render_combo has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
preset_authoring._validate_style (cyclomatic 24) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:690— preset_authoring._validate_style has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_transitions.validate_generated_transition_xml (cyclomatic 24) skills/ppt-master/scripts/pptx_transitions.py:2317— pptx_transitions.validate_generated_transition_xml has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
pptx_transitions._validate_transition_sound_package_parts (cyclomatic 24) skills/ppt-master/scripts/pptx_transitions.py:2521— pptx_transitions._validate_transition_sound_package_parts has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
resource_paths._svg_image_payload_error (cyclomatic 24) skills/ppt-master/scripts/resource_paths.py:177— resource_paths._svg_image_payload_error has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
svg_authoring_view.project_svg_batch (cyclomatic 24) skills/ppt-master/scripts/svg_authoring_view.py:2524— svg_authoring_view.project_svg_batch has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._text_width_diagnostic (cyclomatic 24) skills/ppt-master/scripts/svg_quality/checker.py:4129— SVGQualityChecker._text_width_diagnostic has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._check_placeholder_carrier_flattening (cyclomatic 24) skills/ppt-master/scripts/svg_quality/checker.py:6284— SVGQualityChecker._check_placeholder_carrier_flattening has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
svg_contracts.check_forbidden_elements (cyclomatic 24) skills/ppt-master/scripts/svg_quality/svg_contracts.py:197— svg_contracts.check_forbidden_elements has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
elements._nested_crop_clip_preset_geometry_error (cyclomatic 24) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3969— elements._nested_crop_clip_preset_geometry_error has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
native_objects._validate_native_object_marker_payload (cyclomatic 24) skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py:555— native_objects._validate_native_object_marker_payload has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_data._category_series (cyclomatic 24) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:878— chart_data._category_series has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_style._chart_companion_shapes (cyclomatic 24) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1578— chart_style._chart_companion_shapes has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_xml._series_xml (cyclomatic 24) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:471— chart_xml._series_xml has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
text_measure._run_calibrate (cyclomatic 24) skills/ppt-master/scripts/text_measure.py:740— text_measure._run_calibrate has cyclomatic complexity 24 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
video_sound_mix._resolve_sound_cues (cyclomatic 24) skills/ppt-master/scripts/video_sound_mix.py:679— video_sound_mix._resolve_sound_cues has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.renderDirectionComponentCandidates (cyclomatic 24) skills/ppt-master/scripts/confirm_ui/static/app.js:2472— app.renderDirectionComponentCandidates has cyclomatic complexity 24 (threshold 15). Most of this is not in the body itself: 2 of the 24 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 2532, 2481, 2473, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
authoring_roundtrip.normalized_authoring_subtree_sha256 (cyclomatic 23) skills/ppt-master/scripts/authoring_roundtrip.py:1014— authoring_roundtrip.normalized_authoring_subtree_sha256 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.
narration_sync._load_timing_plan (cyclomatic 23) skills/ppt-master/scripts/narration_sync.py:360— narration_sync._load_timing_plan 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.
pptx_animations.create_sequence_timing_xml (cyclomatic 23) skills/ppt-master/scripts/pptx_animations.py:1845— pptx_animations.create_sequence_timing_xml 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.
formula_import._preview_node (cyclomatic 23) skills/ppt-master/scripts/pptx_to_svg/formula_import.py:533— formula_import._preview_node has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
preset_authoring.render_preset_shape_fragment (cyclomatic 23) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:83— preset_authoring.render_preset_shape_fragment has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
tbl_to_svg._table_has_unsupported_direct_formatting (cyclomatic 23) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:860— tbl_to_svg._table_has_unsupported_direct_formatting 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.
tbl_to_svg._legacy_text_body_has_unsupported_formatting (cyclomatic 23) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1092— tbl_to_svg._legacy_text_body_has_unsupported_formatting 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.
txbody_to_svg._parse_paragraph (cyclomatic 23) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:667— txbody_to_svg._parse_paragraph 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.
txbody_to_svg._emit_paragraph (cyclomatic 23) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1596— txbody_to_svg._emit_paragraph 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.
project_utils.validate_communication_trace (cyclomatic 23) skills/ppt-master/scripts/project_utils.py:239— project_utils.validate_communication_trace 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.
ImageRotator.apply_fixes (cyclomatic 23) skills/ppt-master/scripts/rotate_images.py:348— ImageRotator.apply_fixes 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.
doc_to_md._docx_inject_math_latex (cyclomatic 23) skills/ppt-master/scripts/source_to_md/doc_to_md.py:657— doc_to_md._docx_inject_math_latex 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.
pdf_to_md._extend_ruled_table (cyclomatic 23) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1057— pdf_to_md._extend_ruled_table 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.
ppt_to_md._xy_chart_to_markdown (cyclomatic 23) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:721— ppt_to_md._xy_chart_to_markdown 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.
svg_authoring_contract.canonical_authoring_errors (cyclomatic 23) skills/ppt-master/scripts/svg_authoring_contract.py:284— svg_authoring_contract.canonical_authoring_errors has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
svg_authoring_view.adopt_authoring_object (cyclomatic 23) skills/ppt-master/scripts/svg_authoring_view.py:2236— svg_authoring_view.adopt_authoring_object has cyclomatic complexity 23 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
svg_position_calculator.analyze_svg_file (cyclomatic 23) skills/ppt-master/scripts/svg_position_calculator.py:1061— svg_position_calculator.analyze_svg_file 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.
SVGQualityChecker._check_sourced_image_attribution (cyclomatic 23) skills/ppt-master/scripts/svg_quality/checker.py:7057— SVGQualityChecker._check_sourced_image_attribution 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.
svg_contracts.check_stroke_style_values (cyclomatic 23) skills/ppt-master/scripts/svg_quality/svg_contracts.py:777— svg_contracts.check_stroke_style_values 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.
chart_xml._data_labels_xml (cyclomatic 23) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:246— chart_xml._data_labels_xml 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.
text_measure._outline_candidates (cyclomatic 23) skills/ppt-master/scripts/text_measure.py:461— text_measure._outline_candidates 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.
app.normalizedFontRole (cyclomatic 23) skills/ppt-master/scripts/confirm_ui/static/app.js:1780— app.normalizedFontRole has cyclomatic complexity 23 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
app.loadSlides (cyclomatic 23) REDACTED:620— app.loadSlides has cyclomatic complexity 23 (threshold 15). Most of this is not in the body itself: 1 of the 23 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 623, 648). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
pptx_embedded_fonts.load_embedded_font_bundle (cyclomatic 22) skills/ppt-master/scripts/pptx_embedded_fonts.py:282— pptx_embedded_fonts.load_embedded_font_bundle 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.
clone.clone_presentation_slides (cyclomatic 22) skills/ppt-master/scripts/pptx_ooxml/clone.py:736— clone.clone_presentation_slides 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.
pptx_opc_validation.verify_internal_relationships (cyclomatic 22) skills/ppt-master/scripts/pptx_opc_validation.py:265— pptx_opc_validation.verify_internal_relationships 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.
converter._managed_vector_asset_paths (cyclomatic 22) skills/ppt-master/scripts/pptx_to_svg/converter.py:961— converter._managed_vector_asset_paths 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.
txbody_to_svg._wrap_paragraph_into_lines (cyclomatic 22) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1410— txbody_to_svg._wrap_paragraph_into_lines 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.
prompt_audit.audit_load_sets (cyclomatic 22) skills/ppt-master/scripts/prompt_audit.py:419— prompt_audit.audit_load_sets 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.
doc_to_md._convert_docx (cyclomatic 22) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1035— doc_to_md._convert_docx has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
doc_to_md._sanitize_epub_manifest (cyclomatic 22) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1315— doc_to_md._sanitize_epub_manifest 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.
ppt_to_md._category_chart_to_markdown (cyclomatic 22) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:818— ppt_to_md._category_chart_to_markdown has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._record_carrier_receipt (cyclomatic 22) skills/ppt-master/scripts/svg_quality/checker.py:2712— SVGQualityChecker._record_carrier_receipt 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.
utils.parse_project_filter_params (cyclomatic 22) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2636— utils.parse_project_filter_params 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.
builder._placeholder_text_body (cyclomatic 22) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3838— builder._placeholder_text_body 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.
template_structure.load_template_source_themes (cyclomatic 22) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:580— template_structure.load_template_source_themes 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.
app.fontScriptTokens (cyclomatic 22) skills/ppt-master/scripts/confirm_ui/static/app.js:1701— app.fontScriptTokens has cyclomatic complexity 22 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
server._read_template_options_input (cyclomatic 21) skills/ppt-master/scripts/confirm_ui/server.py:310— server._read_template_options_input has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
backend_openai._edit_image (cyclomatic 21) skills/ppt-master/scripts/image_backends/backend_openai.py:590— backend_openai._edit_image has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
image_search._save_candidate_thumbnails (cyclomatic 21) skills/ppt-master/scripts/image_search.py:882— image_search._save_candidate_thumbnails 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.
mirror_template_materialize._slot_wrapper (cyclomatic 21) skills/ppt-master/scripts/mirror_template_materialize.py:2216— mirror_template_materialize._slot_wrapper 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.
formula._apply_operator (cyclomatic 21) skills/ppt-master/scripts/pptx_shapes/formula.py:291— formula._apply_operator has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_to_svg._pie_visual_styles (cyclomatic 21) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:909— chart_to_svg._pie_visual_styles 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.
chart_to_svg._source_chart_text_style (cyclomatic 21) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2668— chart_to_svg._source_chart_text_style 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.
fill_to_svg._resolve_grad_fill (cyclomatic 21) skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py:183— fill_to_svg._resolve_grad_fill 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.
normalized_chart_svg._render_bars (cyclomatic 21) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:519— normalized_chart_svg._render_bars 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.
pic_to_svg.convert_blip_fill (cyclomatic 21) skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py:88— pic_to_svg.convert_blip_fill 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.
pic_to_svg._apply_blip_image_effects (cyclomatic 21) skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py:523— pic_to_svg._apply_blip_image_effects has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
txbody_to_svg._convert_east_asian_vertical (cyclomatic 21) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:383— txbody_to_svg._convert_east_asian_vertical 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.
register_template._extract_entry (cyclomatic 21) skills/ppt-master/scripts/register_template.py:1155— register_template._extract_entry has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
doc_to_md._docx_image_occurrences (cyclomatic 21) skills/ppt-master/scripts/source_to_md/doc_to_md.py:335— doc_to_md._docx_image_occurrences 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.
web_to_md.download_and_rewrite_images (cyclomatic 21) skills/ppt-master/scripts/source_to_md/web_to_md.py:653— web_to_md.download_and_rewrite_images has cyclomatic complexity 21 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
web_to_md.extract_metadata (cyclomatic 21) skills/ppt-master/scripts/source_to_md/web_to_md.py:797— web_to_md.extract_metadata 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.
web_to_md.process_url (cyclomatic 21) skills/ppt-master/scripts/source_to_md/web_to_md.py:1391— web_to_md.process_url has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
svg_authoring_view._compact_semantic_shapes (cyclomatic 21) skills/ppt-master/scripts/svg_authoring_view.py:840— svg_authoring_view._compact_semantic_shapes 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.
SVGQualityChecker._imported_model_text_lines (cyclomatic 21) skills/ppt-master/scripts/svg_quality/checker.py:3866— SVGQualityChecker._imported_model_text_lines 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.
SVGQualityChecker._check_animation_group_ids (cyclomatic 21) skills/ppt-master/scripts/svg_quality/checker.py:5784— SVGQualityChecker._check_animation_group_ids 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.
converter._geometry_trace_metadata (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1758— converter._geometry_trace_metadata 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.
elements._valid_emf_payload (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:158— elements._valid_emf_payload 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.
elements.validate_preset_geometry_metadata (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:971— elements.validate_preset_geometry_metadata 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.
elements.convert_circle (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1470— elements.convert_circle 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.
elements._resolve_clip_geometry (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4217— elements._resolve_clip_geometry 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.
formula_omml._validate_drawing_element (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:709— formula_omml._validate_drawing_element 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.
marker_common._element_local_bbox (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:442— marker_common._element_local_bbox has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
table._table_fallback_grid (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:727— table._table_fallback_grid 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.
builder._ensure_notes_master (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:5556— builder._ensure_notes_master 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.
template_structure._is_full_canvas_solid_rect (cyclomatic 21) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:456— template_structure._is_full_canvas_solid_rect has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
total_md_split.parse_total_md (cyclomatic 21) skills/ppt-master/scripts/total_md_split.py:137— total_md_split.parse_total_md 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.
video_motion_plan.build_video_motion_plan (cyclomatic 21) skills/ppt-master/scripts/video_motion_plan.py:410— video_motion_plan.build_video_motion_plan 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.
animation_config.main (cyclomatic 20) skills/ppt-master/scripts/animation_config.py:77— animation_config.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.
image_search._search_one_item (cyclomatic 20) skills/ppt-master/scripts/image_search.py:2000— image_search._search_one_item 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.
provider_common.score_candidate (cyclomatic 20) skills/ppt-master/scripts/image_sources/provider_common.py:467— provider_common.score_candidate has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
latex_render._process_item (cyclomatic 20) skills/ppt-master/scripts/latex_render.py:408— latex_render._process_item has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
mirror_template_materialize._mark_explicit_breaks (cyclomatic 20) skills/ppt-master/scripts/mirror_template_materialize.py:1263— mirror_template_materialize._mark_explicit_breaks 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.
mirror_template_materialize._copy_text_carrier (cyclomatic 20) skills/ppt-master/scripts/mirror_template_materialize.py:1859— mirror_template_materialize._copy_text_carrier 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.
native_payloads.externalize_native_payloads (cyclomatic 20) skills/ppt-master/scripts/native_payloads.py:245— native_payloads.externalize_native_payloads 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.
pptx_animations._scale_animation_row_duration (cyclomatic 20) skills/ppt-master/scripts/pptx_animations.py:1182— pptx_animations._scale_animation_row_duration 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.
pptx_animations._timing_summary (cyclomatic 20) skills/ppt-master/scripts/pptx_animations.py:2504— pptx_animations._timing_summary 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.
pptx_animations.validate_pptx_animation_package (cyclomatic 20) skills/ppt-master/scripts/pptx_animations.py:3587— pptx_animations.validate_pptx_animation_package 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.
ooxml._container_geometry (cyclomatic 20) skills/ppt-master/scripts/pptx_ooxml/ooxml.py:198— ooxml._container_geometry 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.
pptx_opc_validation.verify_hyperlink_relationships (cyclomatic 20) skills/ppt-master/scripts/pptx_opc_validation.py:185— pptx_opc_validation.verify_hyperlink_relationships 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.
chart_to_svg._resolved_solid_fill (cyclomatic 20) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:680— chart_to_svg._resolved_solid_fill 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.
chart_to_svg._normalized_chart_visual_styles (cyclomatic 20) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1129— chart_to_svg._normalized_chart_visual_styles 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.
chart_to_svg._point_data_label_payload (cyclomatic 20) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2730— chart_to_svg._point_data_label_payload 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.
converter._extract_theme_info (cyclomatic 20) skills/ppt-master/scripts/pptx_to_svg/converter.py:139— converter._extract_theme_info 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.
slide_to_svg._build_geometry_xml (cyclomatic 20) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1217— slide_to_svg._build_geometry_xml has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
txbody_to_svg.convert_txbody (cyclomatic 20) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:126— txbody_to_svg.convert_txbody has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
pptx_workspace.inventory_package_resources (cyclomatic 20) skills/ppt-master/scripts/pptx_workspace.py:794— pptx_workspace.inventory_package_resources 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.
pdf_to_md.should_keep_image (cyclomatic 20) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:498— pdf_to_md.should_keep_image has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SVGQualityChecker._roundtrip_text_diff_ids (cyclomatic 20) skills/ppt-master/scripts/svg_quality/checker.py:1848— SVGQualityChecker._roundtrip_text_diff_ids 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.
SVGQualityChecker._carrier_effect_receipt (cyclomatic 20) skills/ppt-master/scripts/svg_quality/checker.py:2819— SVGQualityChecker._carrier_effect_receipt 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.
SVGQualityChecker._carrier_image_receipt (cyclomatic 20) skills/ppt-master/scripts/svg_quality/checker.py:2996— SVGQualityChecker._carrier_image_receipt 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.
SVGQualityChecker._check_pattern_fills (cyclomatic 20) skills/ppt-master/scripts/svg_quality/checker.py:5944— SVGQualityChecker._check_pattern_fills 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.
animation_config._animation_effect_entry_errors (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1212— animation_config._animation_effect_entry_errors 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.
converter._roundtrip_graphic_frame (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1094— converter._roundtrip_graphic_frame has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
converter._extract_background_candidate (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1642— converter._extract_background_candidate 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.
elements._resolve_nested_svg_clip_geometry (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5493— elements._resolve_nested_svg_clip_geometry 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.
paths.project_gradient_geometry_errors (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:394— paths.project_gradient_geometry_errors 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. This is NOT this file's highest cyclomatic complexity: paths.svg_path_to_absolute (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
styles.build_gradient_fill (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:44— styles.build_gradient_fill 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.
utils.parse_svg_color (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1715— utils.parse_svg_color 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.
native_objects._build_native_chart (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py:359— native_objects._build_native_chart has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_data._chart_data_labels (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:108— chart_data._chart_data_labels 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.
chart_data._chartex_chart_data (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:1428— chart_data._chartex_chart_data 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.
chart_patch._patch_chart (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:255— chart_patch._patch_chart 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.
marker_common._fallback_text_records (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:694— marker_common._fallback_text_records has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
builder._solid_background_xml_from_shape (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3291— builder._solid_background_xml_from_shape has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
cli._write_postflight_report (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1410— cli._write_postflight_report has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
shape_boolean._validate_geometry_presentation (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:411— shape_boolean._validate_geometry_presentation 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.
_LocalUseExpander._materialize_use (cyclomatic 20) skills/ppt-master/scripts/svg_to_pptx/use_expander.py:243— _LocalUseExpander._materialize_use has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
template_preview_pptx.main (cyclomatic 20) skills/ppt-master/scripts/template_preview_pptx.py:334— template_preview_pptx.main has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
apply_template._plan (cyclomatic 19) skills/ppt-master/scripts/apply_template.py:312— apply_template._plan 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.
extract_svg_assets._load_reusable_assets (cyclomatic 19) skills/ppt-master/scripts/extract_svg_assets.py:676— extract_svg_assets._load_reusable_assets 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.
backend_gemini._generate_image (cyclomatic 19) skills/ppt-master/scripts/image_backends/backend_gemini.py:152— backend_gemini._generate_image 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.
provider_wikimedia.parse_results (cyclomatic 19) skills/ppt-master/scripts/image_sources/provider_wikimedia.py:91— provider_wikimedia.parse_results has cyclomatic complexity 19 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
mirror_template_materialize._slot_plans (cyclomatic 19) skills/ppt-master/scripts/mirror_template_materialize.py:1776— mirror_template_materialize._slot_plans 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.
pptx_to_svg.main (cyclomatic 19) skills/ppt-master/scripts/pptx_to_svg.py:151— pptx_to_svg.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.
chart_to_svg._apply_plot_data_labels (cyclomatic 19) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2090— chart_to_svg._apply_plot_data_labels 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.
chartex_to_svg._payload_from_chartex_xml (cyclomatic 19) skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py:93— chartex_to_svg._payload_from_chartex_xml 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.
converter.publish_staged_workspace (cyclomatic 19) skills/ppt-master/scripts/pptx_to_svg/converter.py:1239— converter.publish_staged_workspace 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.
slide_to_svg._wrap_shape_group (cyclomatic 19) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2462— slide_to_svg._wrap_shape_group has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
txbody_to_svg._build_run (cyclomatic 19) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:842— txbody_to_svg._build_run 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.
prompt_audit.run_audit (cyclomatic 19) skills/ppt-master/scripts/prompt_audit.py:2006— prompt_audit.run_audit 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.
slice_images._keying_findings (cyclomatic 19) skills/ppt-master/scripts/slice_images.py:629— slice_images._keying_findings 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.
ppt_to_md._paragraph_bullet (cyclomatic 19) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:413— ppt_to_md._paragraph_bullet 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.
web_to_md.main (cyclomatic 19) skills/ppt-master/scripts/source_to_md/web_to_md.py:1542— web_to_md.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.
svg_authoring_view._normalize_semantic_text_lines (cyclomatic 19) skills/ppt-master/scripts/svg_authoring_view.py:692— svg_authoring_view._normalize_semantic_text_lines 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.
embed_images._optimize_image_bytes (cyclomatic 19) skills/ppt-master/scripts/svg_finalize/embed_images.py:77— embed_images._optimize_image_bytes has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
svg_rect_to_path.main (cyclomatic 19) skills/ppt-master/scripts/svg_finalize/svg_rect_to_path.py:236— svg_rect_to_path.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.
SVGQualityChecker._classify_preserved_mirror_geometry (cyclomatic 19) skills/ppt-master/scripts/svg_quality/checker.py:1484— SVGQualityChecker._classify_preserved_mirror_geometry 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.
SVGQualityChecker._load_project_svg_image_references (cyclomatic 19) skills/ppt-master/scripts/svg_quality/checker.py:8328— SVGQualityChecker._load_project_svg_image_references 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.
SVGQualityChecker._check_sourced_image_provenance (cyclomatic 19) skills/ppt-master/scripts/svg_quality/checker.py:9062— SVGQualityChecker._check_sourced_image_provenance 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.
converter._convert_semantic_shape (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:847— converter._convert_semantic_shape 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.
elements._override_run_attrs (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2651— elements._override_run_attrs 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.
elements._build_run_properties_xml (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2945— elements._build_run_properties_xml 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.
paths._parse_svg_path_tokens (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:186— paths._parse_svg_path_tokens 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. This is NOT this file's highest cyclomatic complexity: paths.svg_path_to_absolute (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
_LatexParser._parse_environment (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1486— _LatexParser._parse_environment 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.
table._table_text_run (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:45— table._table_text_run 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.
table._resolve_table_merge_layout (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:457— table._resolve_table_merge_layout 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.
builder._apply_template_text_language (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6301— builder._apply_template_text_language 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.
template_structure.parse_optional_layout_slides (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2023— template_structure.parse_optional_layout_slides 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.
template_structure.template_lock_errors (cyclomatic 19) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2363— template_structure.template_lock_errors 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.
app.initTemplateOptions (cyclomatic 19) skills/ppt-master/scripts/confirm_ui/static/app.js:1060— app.initTemplateOptions has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body's own statements and 7 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
app.attachPropEditors::commitGeo (cyclomatic 19) REDACTED:2791— app.attachPropEditors::commitGeo 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.
apply_template._write (cyclomatic 18) skills/ppt-master/scripts/apply_template.py:508— apply_template._write 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.
authoring_roundtrip._load_current_assets (cyclomatic 18) skills/ppt-master/scripts/authoring_roundtrip.py:789— authoring_roundtrip._load_current_assets 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.
authoring_roundtrip._prune_unreferenced_definitions (cyclomatic 18) skills/ppt-master/scripts/authoring_roundtrip.py:1373— authoring_roundtrip._prune_unreferenced_definitions has cyclomatic complexity 18 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
backend_openai._generate_image (cyclomatic 18) skills/ppt-master/scripts/image_backends/backend_openai.py:492— backend_openai._generate_image has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
image_gen.render_manifest_md (cyclomatic 18) skills/ppt-master/scripts/image_gen.py:1148— image_gen.render_manifest_md 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.
image_search.fetch_url_replace (cyclomatic 18) skills/ppt-master/scripts/image_search.py:1743— image_search.fetch_url_replace has cyclomatic complexity 18 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
mirror_template_materialize._load_vector_assets (cyclomatic 18) skills/ppt-master/scripts/mirror_template_materialize.py:758— mirror_template_materialize._load_vector_assets 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.
pptx_animations._apply_timing_options (cyclomatic 18) skills/ppt-master/scripts/pptx_animations.py:1513— pptx_animations._apply_timing_options 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.
pptx_delivery_check._content_type_maps (cyclomatic 18) skills/ppt-master/scripts/pptx_delivery_check.py:160— pptx_delivery_check._content_type_maps 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.
pptx_delivery_check._font_faces_for_advisory (cyclomatic 18) skills/ppt-master/scripts/pptx_delivery_check.py:462— pptx_delivery_check._font_faces_for_advisory 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.
clone._report_all_dangling_slide_jumps (cyclomatic 18) skills/ppt-master/scripts/pptx_ooxml/clone.py:669— clone._report_all_dangling_slide_jumps 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.
diagram_read.smartart_to_markdown (cyclomatic 18) skills/ppt-master/scripts/pptx_ooxml/diagram_read.py:528— diagram_read.smartart_to_markdown has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
animation_import.read_animation_config (cyclomatic 18) skills/ppt-master/scripts/pptx_to_svg/animation_import.py:64— animation_import.read_animation_config 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.
chart_to_svg._data_labels_payload (cyclomatic 18) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2802— chart_to_svg._data_labels_payload has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
converter._annotate_roundtrip_slide_roots (cyclomatic 18) skills/ppt-master/scripts/pptx_to_svg/converter.py:389— converter._annotate_roundtrip_slide_roots 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.
effect_to_svg._validate_color (cyclomatic 18) skills/ppt-master/scripts/pptx_to_svg/effect_to_svg.py:245— effect_to_svg._validate_color 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.
tbl_to_svg._native_run_payload (cyclomatic 18) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1380— tbl_to_svg._native_run_payload 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.
tbl_to_svg._convert_cell_text (cyclomatic 18) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1682— tbl_to_svg._convert_cell_text 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.
txbody_to_svg.convert_vertical_txbody (cyclomatic 18) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:273— txbody_to_svg.convert_vertical_txbody 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.
preset_shape_svg.main (cyclomatic 18) skills/ppt-master/scripts/preset_shape_svg.py:236— preset_shape_svg.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.
page_context.page_context_usage_report (cyclomatic 18) skills/ppt-master/scripts/project_management/page_context.py:884— page_context.page_context_usage_report 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.
semantic_table.compact_semantic_table_payload (cyclomatic 18) skills/ppt-master/scripts/semantic_table.py:454— semantic_table.compact_semantic_table_payload has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_batch.run_path_batch (cyclomatic 18) skills/ppt-master/scripts/source_to_md/_batch.py:102— _batch.run_path_batch 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.
doc_to_md._docx_inject_charts_markdown (cyclomatic 18) skills/ppt-master/scripts/source_to_md/doc_to_md.py:943— doc_to_md._docx_inject_charts_markdown 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.
pdf_to_md.get_heading_level (cyclomatic 18) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:100— pdf_to_md.get_heading_level has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
SVGQualityChecker._roundtrip_changed_font_families (cyclomatic 18) skills/ppt-master/scripts/svg_quality/checker.py:2121— SVGQualityChecker._roundtrip_changed_font_families 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.
slot_capacity._text_targets (cyclomatic 18) skills/ppt-master/scripts/svg_quality/slot_capacity.py:82— slot_capacity._text_targets 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.
svg_contracts.check_authoring_property_contract (cyclomatic 18) skills/ppt-master/scripts/svg_quality/svg_contracts.py:499— svg_contracts.check_authoring_property_contract 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.
animation_config._resolved_animation_parameter_errors (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1325— animation_config._resolved_animation_parameter_errors 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.
text_properties._diagnose_text_declaration (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:614— text_properties._diagnose_text_declaration 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.
chart_data._combo_plot_entry (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:1134— chart_data._combo_plot_entry has cyclomatic complexity 18 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_style._native_chart_export_payload (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:591— chart_style._native_chart_export_payload 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.
chart_style._legend_candidate_texts (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:675— chart_style._legend_candidate_texts 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.
chart_style._fallback_bar_clusters (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:989— chart_style._fallback_bar_clusters 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.
formula_ast.merge_run_styles (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:429— formula_ast.merge_run_styles 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.
_LatexParser._parse_cd_environment (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1539— _LatexParser._parse_cd_environment 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.
marker_common._fallback_shape_records (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:557— marker_common._fallback_shape_records 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.
table._table_cell_paragraphs (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:227— table._table_cell_paragraphs 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.
table._native_table_fill_warnings (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1045— table._native_table_fill_warnings 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.
builder._prune_unreferenced_definition_payload_parts (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4917— builder._prune_unreferenced_definition_payload_parts 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.
shape_boolean._connected_components (cyclomatic 18) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:1080— shape_boolean._connected_components 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.
manifest.parse_theme (cyclomatic 18) skills/ppt-master/scripts/template_import/manifest.py:424— manifest.parse_theme 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.
native_structure.build_native_structure (cyclomatic 18) skills/ppt-master/scripts/template_import/native_structure.py:75— native_structure.build_native_structure has cyclomatic complexity 18 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
backend_minimax._word_boundaries (cyclomatic 18) skills/ppt-master/scripts/tts_backends/backend_minimax.py:61— backend_minimax._word_boundaries 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.
apply_template.read_template_install (cyclomatic 17) skills/ppt-master/scripts/apply_template.py:449— apply_template.read_template_install has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
server._submission_stage_error (cyclomatic 17) skills/ppt-master/scripts/confirm_ui/server.py:1616— server._submission_stage_error has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
server._build_session_state (cyclomatic 17) skills/ppt-master/scripts/confirm_ui/server.py:1807— server._build_session_state has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
backend_common.save_image_bytes (cyclomatic 17) skills/ppt-master/scripts/image_backends/backend_common.py:234— backend_common.save_image_bytes has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
mirror_template_materialize._flatten_fixed_group (cyclomatic 17) skills/ppt-master/scripts/mirror_template_materialize.py:1524— mirror_template_materialize._flatten_fixed_group has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
edit_safety._chart_edit_capability (cyclomatic 17) skills/ppt-master/scripts/pptx_ooxml/edit_safety.py:75— edit_safety._chart_edit_capability has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_to_svg.extract_native_chart_payload (cyclomatic 17) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:58— chart_to_svg.extract_native_chart_payload has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
effect_to_svg.convert_effects (cyclomatic 17) skills/ppt-master/scripts/pptx_to_svg/effect_to_svg.py:112— effect_to_svg.convert_effects has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
fill_to_svg._pattern_foreground (cyclomatic 17) skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py:716— fill_to_svg._pattern_foreground has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
formula_import._serialize_run (cyclomatic 17) skills/ppt-master/scripts/pptx_to_svg/formula_import.py:422— formula_import._serialize_run has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
shape_walker._walk_container (cyclomatic 17) skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:250— shape_walker._walk_container has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
slide_to_svg._convert_graphic_fallback (cyclomatic 17) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1767— slide_to_svg._convert_graphic_fallback has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
web_to_md._decode_response_text (cyclomatic 17) skills/ppt-master/scripts/source_to_md/web_to_md.py:418— web_to_md._decode_response_text has cyclomatic complexity 17 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
stamp_native_fallbacks.main (cyclomatic 17) skills/ppt-master/scripts/stamp_native_fallbacks.py:301— stamp_native_fallbacks.main has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
annotations.promote_tspan_to_text (cyclomatic 17) skills/ppt-master/scripts/svg_editor/annotations.py:150— annotations.promote_tspan_to_text has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
server._validate_edit_attrs (cyclomatic 17) skills/ppt-master/scripts/svg_editor/server.py:297— server._validate_edit_attrs has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._check_viewbox (cyclomatic 17) skills/ppt-master/scripts/svg_quality/checker.py:2613— SVGQualityChecker._check_viewbox has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._check_icon_placeholders (cyclomatic 17) skills/ppt-master/scripts/svg_quality/checker.py:5401— SVGQualityChecker._check_icon_placeholders has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
SVGQualityChecker._apply_aggregated_issue_counts (cyclomatic 17) skills/ppt-master/scripts/svg_quality/checker.py:9977— SVGQualityChecker._apply_aggregated_issue_counts has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
svg_contracts.check_paint_compatibility (cyclomatic 17) skills/ppt-master/scripts/svg_quality/svg_contracts.py:292— svg_contracts.check_paint_compatibility has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
svg_contracts.check_font_size_values (cyclomatic 17) skills/ppt-master/scripts/svg_quality/svg_contracts.py:1060— svg_contracts.check_font_size_values has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
animation_config._transition_scope_errors (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:750— animation_config._transition_scope_errors has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
elements._valid_wmf_payload (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:224— elements._valid_wmf_payload has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
elements.convert_rect (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1267— elements.convert_rect has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
styles.build_stroke_xml (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:494— styles.build_stroke_xml has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
utils._is_imported_preset_preview_filter_target (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3005— utils._is_imported_preset_preview_filter_target has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
utils.parse_font_family (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3234— utils.parse_font_family has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils.detect_text_lang (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3411— utils.detect_text_lang has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_data._category_chart_data (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:970— chart_data._category_chart_data has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_style._native_chart_area_warnings (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:894— chart_style._native_chart_area_warnings has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_style._native_chart_category_order_warnings (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:945— chart_style._native_chart_category_order_warnings has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
_LatexParser._parse_owned_body (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1042— _LatexParser._parse_owned_body has cyclomatic complexity 17 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
table._table_cell_parity_style_gaps (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:869— table._table_cell_parity_style_gaps has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
table._native_table_header_warnings (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:967— table._native_table_header_warnings has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
builder._merge_roundtrip_relationships (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1225— builder._merge_roundtrip_relationships has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
builder._prepare_flat_structure (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:5135— builder._prepare_flat_structure has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli._source_resource_audit (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1174— cli._source_resource_audit has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
discovery.find_notes_files (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/discovery.py:61— discovery.find_notes_files has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
narration.find_narration_files (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py:92— narration.find_narration_files has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
template_structure._scope_visual_resources_signature (cyclomatic 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2785— template_structure._scope_visual_resources_signature has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
visualization_catalog.resolve_visualization_reference (cyclomatic 17) skills/ppt-master/scripts/visualization_catalog.py:262— visualization_catalog.resolve_visualization_reference has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
app.legacyRecId (cyclomatic 17) skills/ppt-master/scripts/confirm_ui/static/app.js:1372— app.legacyRecId has cyclomatic complexity 17 (threshold 15). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
app.applyDesignDirection (cyclomatic 17) skills/ppt-master/scripts/confirm_ui/static/app.js:2236— app.applyDesignDirection has cyclomatic complexity 17 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
analyze_images.print_results (cyclomatic 16) skills/ppt-master/scripts/analyze_images.py:308— analyze_images.print_results 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.
server._template_kind_from_spec (cyclomatic 16) skills/ppt-master/scripts/confirm_ui/server.py:246— server._template_kind_from_spec 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.
server._typography_error (cyclomatic 16) skills/ppt-master/scripts/confirm_ui/server.py:1368— server._typography_error 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.
extract_svg_assets._existing_placeholder_entries (cyclomatic 16) skills/ppt-master/scripts/extract_svg_assets.py:592— extract_svg_assets._existing_placeholder_entries 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.
mirror_template_materialize._resolved_placeholder_decorations (cyclomatic 16) skills/ppt-master/scripts/mirror_template_materialize.py:2075— mirror_template_materialize._resolved_placeholder_decorations 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.
diagram_read._ordered_nodes (cyclomatic 16) skills/ppt-master/scripts/pptx_ooxml/diagram_read.py:285— diagram_read._ordered_nodes has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
chart_to_svg._resolved_shape_paint (cyclomatic 16) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:783— chart_to_svg._resolved_shape_paint 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.
ColorPalette._load_scheme (cyclomatic 16) skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:302— ColorPalette._load_scheme has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: color_resolver._apply_modifiers (cyclomatic 17) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
ln_to_svg._build_arrow_marker (cyclomatic 16) skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py:373— ln_to_svg._build_arrow_marker 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.
normalized_chart_svg._render_category (cyclomatic 16) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:201— normalized_chart_svg._render_category 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.
normalized_chart_svg._render_pie (cyclomatic 16) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:704— normalized_chart_svg._render_pie 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.
slide_to_svg.assemble_slide (cyclomatic 16) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:229— slide_to_svg.assemble_slide 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.
tbl_to_svg._build_cell_grid (cyclomatic 16) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:544— tbl_to_svg._build_cell_grid 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.
tbl_to_svg._cell_rich_paragraph_payloads (cyclomatic 16) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1481— tbl_to_svg._cell_rich_paragraph_payloads 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.
ProjectManager.init_project (cyclomatic 16) skills/ppt-master/scripts/project_management/cli.py:286— ProjectManager.init_project 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.
prompt_audit.render_text (cyclomatic 16) skills/ppt-master/scripts/prompt_audit.py:2219— prompt_audit.render_text 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.
sound_sync._load_sounds (cyclomatic 16) skills/ppt-master/scripts/sound_sync.py:58— sound_sync._load_sounds 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.
sound_sync.sync_sounds (cyclomatic 16) skills/ppt-master/scripts/sound_sync.py:126— sound_sync.sync_sounds 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.
doc_to_md._convert_ipynb (cyclomatic 16) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1511— doc_to_md._convert_ipynb 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.
svg_authoring_view._load_authoring_summary_manifest (cyclomatic 16) skills/ppt-master/scripts/svg_authoring_view.py:1635— svg_authoring_view._load_authoring_summary_manifest 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.
flatten_tspan._emit_mergeable_paragraph (cyclomatic 16) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:488— flatten_tspan._emit_mergeable_paragraph has cyclomatic complexity 16 (threshold 15). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SVGQualityChecker._resolved_text_runs (cyclomatic 16) skills/ppt-master/scripts/svg_quality/checker.py:3371— SVGQualityChecker._resolved_text_runs 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.
animation_config._resolve_morph_pairs (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:935— animation_config._resolve_morph_pairs 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.
paths._project_path_like_bounds (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:338— paths._project_path_like_bounds has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This is NOT this file's highest cyclomatic complexity: paths.svg_path_to_absolute (cyclomatic 21) is higher and carries no row of its own — it was excluded as a flat dispatcher (a long switch/match over independent cases: many branches, almost no nesting), which this dimension does not treat as a refactor obligation. It is named here so the ranking you see in this file is not mistaken for the whole of it; the excluded method is counted neither in this dimension's figures nor in its score.
theme_fonts.load_theme_font_spec_from_pages (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py:210— theme_fonts.load_theme_font_spec_from_pages has cyclomatic complexity 16 (threshold 15). To reduce it, separate the branches: extract each independent case into its own named function so the top-level body reads as a short sequence of named decisions.
theme_fonts.apply_master_text_style_spec (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py:410— theme_fonts.apply_master_text_style_spec 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.
utils.is_picture_effect_carrier (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3075— utils.is_picture_effect_carrier 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.
chart_data._xy_chart_data (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:1560— chart_data._xy_chart_data has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
chart_style._native_chart_line_marker_warnings (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:837— chart_style._native_chart_line_marker_warnings 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.
_LatexParser._parse_sequence (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:472— _LatexParser._parse_sequence 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.
_LatexParser._parse_atom (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:531— _LatexParser._parse_atom 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.
_LatexParser._find_matching_character (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1350— _LatexParser._find_matching_character 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.
formula_parser._collect_macros (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:241— formula_parser._collect_macros 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.
marker_common._fallback_fill_candidates (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:804— marker_common._fallback_fill_candidates 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.
builder._replace_roundtrip_transition_advance (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1364— builder._replace_roundtrip_transition_advance 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.
builder._remove_all_notes_parts (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2023— builder._remove_all_notes_parts 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.
builder._materialize_slide_sound (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6105— builder._materialize_slide_sound 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.
builder._create_preserved_base_pptx (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6450— builder._create_preserved_base_pptx has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli._roundtrip_animation_config_for_pages (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:241— cli._roundtrip_animation_config_for_pages has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli._report_roundtrip_omitted_opaque_payloads (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:685— cli._report_roundtrip_omitted_opaque_payloads has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
cli._opaque_roundtrip_slide_dependencies (cyclomatic 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:750— cli._opaque_roundtrip_slide_dependencies 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.
text_measure._lexical_units (cyclomatic 16) skills/ppt-master/scripts/text_measure.py:194— text_measure._lexical_units 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.
app.enumField::makeChip (cyclomatic 16) skills/ppt-master/scripts/confirm_ui/static/app.js:1474— app.enumField::makeChip has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top. This shape REPEATS in the file: one other method here (app.enumField) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
app.setupSvgInteraction (cyclomatic 16) REDACTED:846— app.setupSvgInteraction has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 2 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 861, 854). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
app.renderEditableProps (cyclomatic 16) REDACTED:2103— app.renderEditableProps has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body's own statements and 1 belongs to one function literal inside it that branches. To reduce it, 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.
builder.create_pptx_with_native_svg (cognitive 700) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6730— builder.create_pptx_with_native_svg has cognitive complexity 700 (threshold 15). Drivers by points: if/else 193 (417 pts), ternaries 41 (107 pts), boolean chains 86, loops 30 (74 pts), error handling 8 (16 pts) (nesting depth added 342). 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.
cli.main (cognitive 502) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1982— cli.main has cognitive complexity 502 (threshold 15). Drivers by points: if/else 157 (277 pts), error handling 31 (64 pts), boolean chains 61, ternaries 42 (58 pts), loops 15 (42 pts) (nesting depth added 196). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pdf_to_md.extract_pdf_to_markdown (cognitive 270) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1419— pdf_to_md.extract_pdf_to_markdown has cognitive complexity 270 (threshold 15). Drivers by points: if/else 51 (185 pts), loops 12 (32 pts), ternaries 6 (30 pts), boolean chains 12, error handling 3 (11 pts) (nesting depth added 186). 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.
template_validation.validate_pptx_template_package (cognitive 217) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py:868— template_validation.validate_pptx_template_package has cognitive complexity 217 (threshold 15). Drivers by points: if/else 62 (154 pts), boolean chains 20, loops 12 (19 pts), ternaries 6 (18 pts), error handling 3 (6 pts) (nesting depth added 114). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure.parse_template_slide (cognitive 216) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1512— template_structure.parse_template_slide has cognitive complexity 216 (threshold 15). Drivers by points: if/else 61 (136 pts), boolean chains 53, loops 6 (13 pts), ternaries 4 (11 pts), error handling 3 (nesting depth added 89). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ProjectManager.import_sources (cognitive 194) skills/ppt-master/scripts/project_management/cli.py:857— ProjectManager.import_sources has cognitive complexity 194 (threshold 15). Drivers by points: if/else 58 (151 pts), error handling 7 (21 pts), boolean chains 15, loops 4 (7 pts) (nesting depth added 110). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements.convert_text (cognitive 165) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3158— elements.convert_text has cognitive complexity 165 (threshold 15). Drivers by points: if/else 52 (86 pts), boolean chains 35, ternaries 16 (29 pts), loops 6 (15 pts) (nesting depth added 56). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_planned_image_closure (cognitive 160) skills/ppt-master/scripts/svg_quality/checker.py:8570— SVGQualityChecker._check_planned_image_closure has cognitive complexity 160 (threshold 15). Drivers by points: if/else 35 (86 pts), loops 13 (29 pts), boolean chains 27, ternaries 3 (10 pts), error handling 2 (8 pts) (nesting depth added 80). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure.load_pptx_structure_lock (cognitive 152) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:697— template_structure.load_pptx_structure_lock has cognitive complexity 152 (threshold 15). Drivers by points: if/else 63 (112 pts), boolean chains 23, loops 6 (9 pts), ternaries 4 (7 pts), error handling 1 (nesting depth added 55). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
table._build_native_table (cognitive 137) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1782— table._build_native_table has cognitive complexity 137 (threshold 15). Drivers by points: ternaries 20 (68 pts), if/else 17 (41 pts), boolean chains 21, loops 3 (7 pts) (nesting depth added 76). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
checker._local_pptx_structure_errors (cognitive 130) skills/ppt-master/scripts/svg_quality/checker.py:633— checker._local_pptx_structure_errors has cognitive complexity 130 (threshold 15). Drivers by points: if/else 39 (107 pts), boolean chains 21, loops 2 (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit.audit_registries (cognitive 128) skills/ppt-master/scripts/prompt_audit.py:1274— prompt_audit.audit_registries has cognitive complexity 128 (threshold 15). Drivers by points: if/else 23 (74 pts), loops 13 (40 pts), ternaries 4 (8 pts), boolean chains 6 (nesting depth added 82). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
register_template._validate_style_spec (cognitive 128) skills/ppt-master/scripts/register_template.py:658— register_template._validate_style_spec has cognitive complexity 128 (threshold 15). Drivers by points: if/else 53 (88 pts), boolean chains 26, loops 6 (8 pts), ternaries 4 (6 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ppt_to_md.convert_presentation_to_markdown (cognitive 128) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:1219— ppt_to_md.convert_presentation_to_markdown has cognitive complexity 128 (threshold 15). Drivers by points: if/else 35 (93 pts), ternaries 3 (13 pts), loops 6 (10 pts), error handling 3 (7 pts), boolean chains 5 (nesting depth added 76). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_gen.load_manifest (cognitive 126) skills/ppt-master/scripts/image_gen.py:588— image_gen.load_manifest has cognitive complexity 126 (threshold 15). Drivers by points: if/else 38 (85 pts), boolean chains 17, loops 7 (13 pts), ternaries 3 (10 pts), error handling 1 (nesting depth added 60). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_spec_lock_alignment (cognitive 114) skills/ppt-master/scripts/svg_quality/checker.py:6727— SVGQualityChecker._check_spec_lock_alignment has cognitive complexity 114 (threshold 15). Drivers by points: if/else 36 (77 pts), loops 13 (21 pts), boolean chains 10, ternaries 3 (6 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LatexParser._parse_command (cognitive 114) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:562— _LatexParser._parse_command has cognitive complexity 114 (threshold 15). Drivers by points: if/else 74 (99 pts), ternaries 4 (9 pts), boolean chains 6 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker.check_directory (cognitive 109) skills/ppt-master/scripts/svg_quality/checker.py:7265— SVGQualityChecker.check_directory has cognitive complexity 109 (threshold 15). Drivers by points: if/else 34 (60 pts), error handling 7 (20 pts), boolean chains 10, loops 5 (10 pts), ternaries 4 (9 pts) (nesting depth added 49). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.project_marker_errors (cognitive 109) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2042— utils.project_marker_errors has cognitive complexity 109 (threshold 15). Drivers by points: if/else 21 (72 pts), boolean chains 12, error handling 2 (9 pts), ternaries 3 (9 pts), loops 3 (7 pts) (nesting depth added 68). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
manifest.build_manifest (cognitive 108) skills/ppt-master/scripts/template_import/manifest.py:501— manifest.build_manifest has cognitive complexity 108 (threshold 15). Drivers by points: if/else 28 (60 pts), loops 15 (22 pts), ternaries 8 (15 pts), boolean chains 11 (nesting depth added 46). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_search.main (cognitive 104) skills/ppt-master/scripts/image_search.py:2617— image_search.main has cognitive complexity 104 (threshold 15). Drivers by points: if/else 34 (49 pts), boolean chains 21, ternaries 11 (19 pts), error handling 8 (13 pts), loops 1 (2 pts) (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._chart_axes (cognitive 103) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:308— chart_data._chart_axes has cognitive complexity 103 (threshold 15). Drivers by points: if/else 36 (85 pts), boolean chains 10, loops 3 (5 pts), ternaries 1 (3 pts) (nesting depth added 53). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure.template_prototype_errors (cognitive 101) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:3241— template_structure.template_prototype_errors has cognitive complexity 101 (threshold 15). Drivers by points: if/else 30 (62 pts), ternaries 7 (21 pts), error handling 4 (9 pts), boolean chains 8, loops 1 (nesting depth added 51). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._promote_common_chrome_shapes_to_masters (cognitive 100) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4479— builder._promote_common_chrome_shapes_to_masters has cognitive complexity 100 (threshold 15). Drivers by points: if/else 24 (64 pts), loops 15 (34 pts), boolean chains 2 (nesting depth added 59). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter.convert_svg_to_slide_shapes (cognitive 99) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2018— converter.convert_svg_to_slide_shapes has cognitive complexity 99 (threshold 15). Drivers by points: if/else 40 (55 pts), ternaries 10 (15 pts), boolean chains 14, error handling 11 (14 pts), loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit.load_manifest (cognitive 98) skills/ppt-master/scripts/prompt_audit.py:124— prompt_audit.load_manifest has cognitive complexity 98 (threshold 15). Drivers by points: if/else 23 (45 pts), ternaries 8 (23 pts), boolean chains 16, loops 10 (13 pts), error handling 1 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.project_gradient_errors (cognitive 95) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2462— utils.project_gradient_errors has cognitive complexity 95 (threshold 15). Drivers by points: if/else 20 (53 pts), error handling 4 (14 pts), loops 5 (11 pts), boolean chains 9, ternaries 3 (8 pts) (nesting depth added 54). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.project_filter_errors (cognitive 95) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2798— utils.project_filter_errors has cognitive complexity 95 (threshold 15). Drivers by points: if/else 24 (64 pts), boolean chains 12, error handling 2 (7 pts), loops 4 (7 pts), ternaries 1 (5 pts) (nesting depth added 52). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter.convert_g (cognitive 94) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1204— converter.convert_g has cognitive complexity 94 (threshold 15). Drivers by points: if/else 36 (58 pts), boolean chains 23, ternaries 9 (11 pts), loops 2 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit.audit_schema_grammars (cognitive 92) skills/ppt-master/scripts/prompt_audit.py:1769— prompt_audit.audit_schema_grammars has cognitive complexity 92 (threshold 15). Drivers by points: if/else 16 (56 pts), loops 7 (19 pts), boolean chains 10, ternaries 2 (7 pts) (nesting depth added 57). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
inline_formula.inline_formula_marker_errors (cognitive 92) skills/ppt-master/scripts/svg_to_pptx/native_objects/inline_formula.py:84— inline_formula.inline_formula_marker_errors has cognitive complexity 92 (threshold 15). Drivers by points: if/else 32 (73 pts), boolean chains 11, loops 3 (5 pts), error handling 1 (3 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slice_images.slice_sheet (cognitive 91) skills/ppt-master/scripts/slice_images.py:937— slice_images.slice_sheet has cognitive complexity 91 (threshold 15). Drivers by points: if/else 23 (59 pts), ternaries 6 (12 pts), boolean chains 11, loops 6 (9 pts) (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli.main (cognitive 91) skills/ppt-master/scripts/svg_quality/cli.py:168— cli.main has cognitive complexity 91 (threshold 15). Drivers by points: if/else 40 (62 pts), boolean chains 12, error handling 2 (6 pts), ternaries 3 (6 pts), loops 2 (5 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip._load_documents (cognitive 89) skills/ppt-master/scripts/authoring_roundtrip.py:325— authoring_roundtrip._load_documents has cognitive complexity 89 (threshold 15). Drivers by points: if/else 35 (64 pts), boolean chains 15, error handling 2 (5 pts), loops 3 (5 pts) (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
notes_to_audio.main (cognitive 89) skills/ppt-master/scripts/notes_to_audio.py:439— notes_to_audio.main has cognitive complexity 89 (threshold 15). Drivers by points: if/else 30 (52 pts), error handling 11 (21 pts), boolean chains 10, loops 3 (5 pts), ternaries 1 (nesting depth added 34). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ln_to_svg.resolve_stroke (cognitive 88) skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py:75— ln_to_svg.resolve_stroke has cognitive complexity 88 (threshold 15). Drivers by points: if/else 36 (59 pts), boolean chains 14, error handling 2 (6 pts), loops 3 (6 pts), ternaries 3 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
narration_sync.rebuild_animations (cognitive 86) skills/ppt-master/scripts/narration_sync.py:1067— narration_sync.rebuild_animations has cognitive complexity 86 (threshold 15). Drivers by points: if/else 30 (64 pts), loops 5 (9 pts), ternaries 3 (8 pts), boolean chains 5 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations._load_native_animations (cognitive 86) skills/ppt-master/scripts/pptx_animations.py:219— pptx_animations._load_native_animations has cognitive complexity 86 (threshold 15). Drivers by points: if/else 24 (65 pts), error handling 3 (8 pts), loops 3 (7 pts), boolean chains 6 (nesting depth added 50). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli.main (cognitive 86) skills/ppt-master/scripts/project_management/cli.py:1389— cli.main has cognitive complexity 86 (threshold 15). Drivers by points: if/else 26 (42 pts), loops 10 (30 pts), ternaries 5 (10 pts), error handling 2 (3 pts), boolean chains 1 (nesting depth added 42). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations._read_effect_options (cognitive 85) skills/ppt-master/scripts/pptx_animations.py:2382— pptx_animations._read_effect_options has cognitive complexity 85 (threshold 15). Drivers by points: if/else 19 (48 pts), ternaries 4 (12 pts), loops 4 (10 pts), boolean chains 8, error handling 2 (7 pts) (nesting depth added 48). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations.validate_slide_animation_structure (cognitive 85) skills/ppt-master/scripts/pptx_animations.py:3033— pptx_animations.validate_slide_animation_structure has cognitive complexity 85 (threshold 15). Drivers by points: if/else 37 (63 pts), boolean chains 11, loops 6 (9 pts), ternaries 1 (2 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize.materialize_mirror_template (cognitive 84) skills/ppt-master/scripts/mirror_template_materialize.py:2973— mirror_template_materialize.materialize_mirror_template has cognitive complexity 84 (threshold 15). Drivers by points: if/else 19 (36 pts), loops 22 (29 pts), error handling 6 (11 pts), boolean chains 6, ternaries 2 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._positioned_text_lines (cognitive 84) skills/ppt-master/scripts/svg_quality/checker.py:3619— SVGQualityChecker._positioned_text_lines has cognitive complexity 84 (threshold 15). Drivers by points: if/else 21 (45 pts), error handling 7 (17 pts), boolean chains 11, ternaries 2 (6 pts), loops 3 (5 pts) (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_native_object_markers (cognitive 83) skills/ppt-master/scripts/svg_quality/checker.py:6018— SVGQualityChecker._check_native_object_markers has cognitive complexity 83 (threshold 15). Drivers by points: if/else 20 (36 pts), loops 9 (17 pts), error handling 5 (13 pts), boolean chains 10, ternaries 3 (7 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._build_sequence_targets (cognitive 81) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:5844— builder._build_sequence_targets has cognitive complexity 81 (threshold 15). Drivers by points: if/else 24 (50 pts), ternaries 6 (15 pts), boolean chains 11, loops 4 (5 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._stage2_design_directions_error (cognitive 79) skills/ppt-master/scripts/confirm_ui/server.py:1469— server._stage2_design_directions_error has cognitive complexity 79 (threshold 15). Drivers by points: if/else 25 (63 pts), loops 5 (10 pts), boolean chains 6 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._parse_preset_geometry_metadata (cognitive 78) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:808— elements._parse_preset_geometry_metadata has cognitive complexity 78 (threshold 15). Drivers by points: if/else 29 (53 pts), boolean chains 13, error handling 3 (7 pts), loops 3 (5 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._opaque_roundtrip_dependency_owner_refs (cognitive 78) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:810— cli._opaque_roundtrip_dependency_owner_refs has cognitive complexity 78 (threshold 15). Drivers by points: if/else 16 (43 pts), loops 8 (20 pts), ternaries 3 (8 pts), boolean chains 6, error handling 1 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._apply_series_formatting (cognitive 77) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2014— chart_to_svg._apply_series_formatting has cognitive complexity 77 (threshold 15). Drivers by points: if/else 19 (46 pts), boolean chains 18, ternaries 3 (10 pts), loops 2 (3 pts) (nesting depth added 35). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slot_capacity.slot_capacity_report (cognitive 77) skills/ppt-master/scripts/svg_quality/slot_capacity.py:131— slot_capacity.slot_capacity_report has cognitive complexity 77 (threshold 15). Drivers by points: if/else 14 (42 pts), ternaries 4 (12 pts), error handling 2 (9 pts), boolean chains 7, loops 3 (7 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config.validate_animation_config (cognitive 77) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1570— animation_config.validate_animation_config has cognitive complexity 77 (threshold 15). Drivers by points: if/else 24 (56 pts), loops 10 (15 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
hyperlink_contract.project_hyperlink_errors (cognitive 76) skills/ppt-master/scripts/hyperlink_contract.py:164— hyperlink_contract.project_hyperlink_errors has cognitive complexity 76 (threshold 15). Drivers by points: if/else 26 (58 pts), boolean chains 8, loops 4 (6 pts), error handling 2 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure.load_native_structure_contract (cognitive 76) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1183— template_structure.load_native_structure_contract has cognitive complexity 76 (threshold 15). Drivers by points: if/else 25 (42 pts), boolean chains 18, error handling 5 (8 pts), loops 3 (4 pts), ternaries 2 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._axis_config_from_xml (cognitive 75) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1338— chart_to_svg._axis_config_from_xml has cognitive complexity 75 (threshold 15). Drivers by points: if/else 37 (56 pts), boolean chains 14, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_patch._patch_workbook (cognitive 75) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:308— chart_patch._patch_workbook has cognitive complexity 75 (threshold 15). Drivers by points: if/else 23 (48 pts), ternaries 7 (15 pts), boolean chains 7, loops 4 (5 pts) (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
builder._apply_roundtrip_slide_overlay (cognitive 73) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1683— builder._apply_roundtrip_slide_overlay has cognitive complexity 73 (threshold 15). Drivers by points: if/else 37 (53 pts), loops 10 (12 pts), boolean chains 5, ternaries 1 (2 pts), error handling 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.
pptx_transitions.validate_slide_transition_structure (cognitive 72) skills/ppt-master/scripts/pptx_transitions.py:2899— pptx_transitions.validate_slide_transition_structure has cognitive complexity 72 (threshold 15). Drivers by points: if/else 21 (60 pts), loops 5 (10 pts), boolean chains 2 (nesting depth added 44). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_position_calculator.main (cognitive 72) skills/ppt-master/scripts/svg_position_calculator.py:1378— svg_position_calculator.main has cognitive complexity 72 (threshold 15). Drivers by points: if/else 19 (43 pts), ternaries 4 (11 pts), loops 4 (9 pts), error handling 3 (6 pts), boolean chains 3 (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.
builder._promote_common_chrome_shapes_to_layouts (cognitive 72) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2858— builder._promote_common_chrome_shapes_to_layouts has cognitive complexity 72 (threshold 15). Drivers by points: if/else 16 (42 pts), loops 12 (26 pts), boolean chains 4 (nesting depth added 40). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._roundtrip_passthrough_candidates (cognitive 71) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:345— cli._roundtrip_passthrough_candidates has cognitive complexity 71 (threshold 15). Drivers by points: if/else 25 (47 pts), boolean chains 11, loops 5 (8 pts), error handling 2 (4 pts), ternaries 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._compose_template (cognitive 70) skills/ppt-master/scripts/mirror_template_materialize.py:2392— mirror_template_materialize._compose_template has cognitive complexity 70 (threshold 15). Drivers by points: if/else 23 (52 pts), loops 6 (8 pts), boolean chains 7, ternaries 2 (3 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.
chart_to_svg._validate_chart_semantics (cognitive 70) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1864— chart_to_svg._validate_chart_semantics has cognitive complexity 70 (threshold 15). Drivers by points: if/else 30 (52 pts), boolean chains 7, loops 4 (7 pts), ternaries 1 (3 pts), error handling 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.project_paint_reference_errors (cognitive 68) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2268— utils.project_paint_reference_errors has cognitive complexity 68 (threshold 15). Drivers by points: if/else 14 (35 pts), boolean chains 16, error handling 2 (7 pts), ternaries 2 (7 pts), loops 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip._materialize_document (cognitive 67) skills/ppt-master/scripts/authoring_roundtrip.py:1771— authoring_roundtrip._materialize_document has cognitive complexity 67 (threshold 15). Drivers by points: if/else 32 (49 pts), boolean chains 8, loops 6 (8 pts), ternaries 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_search.search_and_download (cognitive 67) skills/ppt-master/scripts/image_search.py:1066— image_search.search_and_download has cognitive complexity 67 (threshold 15). Drivers by points: if/else 15 (41 pts), loops 5 (12 pts), error handling 3 (9 pts), boolean chains 3, ternaries 2 (nesting depth added 39). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations.validate_generated_animation_xml (cognitive 67) skills/ppt-master/scripts/pptx_animations.py:3318— pptx_animations.validate_generated_animation_xml has cognitive complexity 67 (threshold 15). Drivers by points: if/else 27 (49 pts), ternaries 8 (12 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_module_bounds_contract (cognitive 67) skills/ppt-master/scripts/svg_quality/checker.py:4615— SVGQualityChecker._check_module_bounds_contract has cognitive complexity 67 (threshold 15). Drivers by points: if/else 24 (47 pts), boolean chains 6, loops 5 (6 pts), ternaries 3 (6 pts), error handling 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.
_ChemParser.parse (cognitive 67) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1815— _ChemParser.parse has cognitive complexity 67 (threshold 15). Drivers by points: if/else 20 (41 pts), loops 4 (10 pts), ternaries 3 (9 pts), boolean chains 7 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_opc_validation.verify_hyperlink_relationships (cognitive 66) skills/ppt-master/scripts/pptx_opc_validation.py:185— pptx_opc_validation.verify_hyperlink_relationships has cognitive complexity 66 (threshold 15). Drivers by points: if/else 12 (54 pts), loops 3 (6 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 47). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._apply_chart_formatting (cognitive 66) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2303— chart_to_svg._apply_chart_formatting has cognitive complexity 66 (threshold 15). Drivers by points: if/else 19 (41 pts), loops 7 (11 pts), ternaries 3 (10 pts), boolean chains 4 (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_delivery_check.audit_pptx_delivery (cognitive 65) skills/ppt-master/scripts/pptx_delivery_check.py:727— pptx_delivery_check.audit_pptx_delivery has cognitive complexity 65 (threshold 15). Drivers by points: if/else 34 (40 pts), boolean chains 10, ternaries 6, error handling 5, loops 3 (4 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
chart_to_svg._apply_chart_metadata (cognitive 65) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2169— chart_to_svg._apply_chart_metadata has cognitive complexity 65 (threshold 15). Drivers by points: if/else 27 (51 pts), ternaries 2 (6 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit._registry_ids (cognitive 65) skills/ppt-master/scripts/prompt_audit.py:1115— prompt_audit._registry_ids has cognitive complexity 65 (threshold 15). Drivers by points: if/else 22 (51 pts), loops 2 (6 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
SVGQualityChecker._check_template_contract (cognitive 65) skills/ppt-master/scripts/svg_quality/checker.py:9184— SVGQualityChecker._check_template_contract has cognitive complexity 65 (threshold 15). Drivers by points: if/else 18 (42 pts), loops 5 (9 pts), boolean chains 6, error handling 2 (5 pts), ternaries 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.renderTypography (cognitive 65) skills/ppt-master/scripts/confirm_ui/static/app.js:3058— app.renderTypography has cognitive complexity 65 (threshold 15). Drivers by points: boolean chains 34, if/else 23 (28 pts), ternaries 3 (nesting depth added 5). Of this number, 16 points are the body's own statements and 49 belong to 18 function items inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
tbl_to_svg._text_body_has_unsupported_formatting (cognitive 64) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:942— tbl_to_svg._text_body_has_unsupported_formatting has cognitive complexity 64 (threshold 15). Drivers by points: if/else 23 (47 pts), boolean chains 12, loops 3 (5 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
finalize_svg._process_candidate_directory (cognitive 63) skills/ppt-master/scripts/finalize_svg.py:176— finalize_svg._process_candidate_directory has cognitive complexity 63 (threshold 15). Drivers by points: if/else 22 (43 pts), loops 6 (11 pts), error handling 3 (8 pts), boolean chains 1 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flatten_tspan.flatten_text_with_tspans (cognitive 63) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:565— flatten_tspan.flatten_text_with_tspans has cognitive complexity 63 (threshold 15). Drivers by points: if/else 17 (43 pts), loops 5 (9 pts), boolean chains 6, error handling 1 (3 pts), ternaries 1 (2 pts) (nesting depth added 33). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalized_chart_svg._render_bars (cognitive 62) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:519— normalized_chart_svg._render_bars has cognitive complexity 62 (threshold 15). Drivers by points: ternaries 9 (35 pts), if/else 7 (20 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 40). 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.
flatten_tspan._classify_paragraph_block (cognitive 62) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:326— flatten_tspan._classify_paragraph_block has cognitive complexity 62 (threshold 15). Drivers by points: if/else 23 (41 pts), ternaries 4 (9 pts), boolean chains 8, loops 4 (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.
image_search.run_search_manifest (cognitive 61) skills/ppt-master/scripts/image_search.py:2148— image_search.run_search_manifest has cognitive complexity 61 (threshold 15). Drivers by points: if/else 21 (42 pts), error handling 4 (11 pts), loops 4 (5 pts), boolean chains 3 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clone._remap_slide_jump_relationships (cognitive 61) skills/ppt-master/scripts/pptx_ooxml/clone.py:266— clone._remap_slide_jump_relationships has cognitive complexity 61 (threshold 15). Drivers by points: if/else 19 (46 pts), boolean chains 6, ternaries 2 (6 pts), loops 2 (3 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_import._serialize_node_content (cognitive 61) skills/ppt-master/scripts/pptx_to_svg/formula_import.py:255— formula_import._serialize_node_content has cognitive complexity 61 (threshold 15). Drivers by points: if/else 31 (41 pts), ternaries 6 (13 pts), boolean chains 5, loops 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_omml._validate_math_structure (cognitive 61) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:759— formula_omml._validate_math_structure has cognitive complexity 61 (threshold 15). Drivers by points: if/else 26 (39 pts), boolean chains 14, ternaries 3 (6 pts), loops 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_text_bounds (cognitive 60) skills/ppt-master/scripts/svg_quality/checker.py:4814— SVGQualityChecker._check_text_bounds has cognitive complexity 60 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 11, loops 4 (6 pts), ternaries 2 (5 pts), error handling 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.
svg_contracts.check_stroke_style_values (cognitive 60) skills/ppt-master/scripts/svg_quality/svg_contracts.py:777— svg_contracts.check_stroke_style_values has cognitive complexity 60 (threshold 15). Drivers by points: if/else 14 (41 pts), error handling 3 (9 pts), ternaries 1 (5 pts), boolean chains 3, loops 2 (nesting depth added 37). 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.
table._native_table_border_topology_warnings (cognitive 60) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1232— table._native_table_border_topology_warnings has cognitive complexity 60 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 5 (15 pts), boolean chains 11, ternaries 1 (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_pptx_structure_contract (cognitive 59) skills/ppt-master/scripts/svg_quality/checker.py:7556— SVGQualityChecker._check_pptx_structure_contract has cognitive complexity 59 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 13, error handling 7 (11 pts), loops 1, ternaries 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tbl_to_svg._table_has_unsupported_direct_formatting (cognitive 58) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:860— tbl_to_svg._table_has_unsupported_direct_formatting has cognitive complexity 58 (threshold 15). Drivers by points: if/else 15 (45 pts), error handling 1 (5 pts), boolean chains 4, loops 2 (4 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_workspace.workspace_resource_specs (cognitive 58) skills/ppt-master/scripts/pptx_workspace.py:592— pptx_workspace.workspace_resource_specs has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 11, error handling 2 (4 pts), ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
crop_images.process_svg_images (cognitive 57) skills/ppt-master/scripts/svg_finalize/crop_images.py:143— crop_images.process_svg_images has cognitive complexity 57 (threshold 15). Drivers by points: if/else 23 (44 pts), error handling 3 (5 pts), ternaries 1 (4 pts), boolean chains 3, loops 1 (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fix_image_aspect.fix_image_aspect_in_svg (cognitive 57) skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py:210— fix_image_aspect.fix_image_aspect_in_svg has cognitive complexity 57 (threshold 15). Drivers by points: if/else 12 (32 pts), ternaries 4 (13 pts), boolean chains 4, error handling 2 (4 pts), loops 3 (4 pts) (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_patch._patch_chart (cognitive 57) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:255— chart_patch._patch_chart has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (40 pts), ternaries 3 (10 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 37). 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.
builder._apply_explicit_layout_structure (cognitive 57) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4193— builder._apply_explicit_layout_structure has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 12 (17 pts), ternaries 1 (2 pts) (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._recorded_narration_on_click_slides (cognitive 57) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1863— cli._recorded_narration_on_click_slides has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (34 pts), loops 4 (8 pts), ternaries 2 (8 pts), boolean chains 7 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._validate_template_selection (cognitive 56) skills/ppt-master/scripts/confirm_ui/server.py:560— server._validate_template_selection has cognitive complexity 56 (threshold 15). Drivers by points: if/else 27 (42 pts), boolean chains 9, loops 3 (4 pts), error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract_svg_assets._optimize_definitions (cognitive 56) skills/ppt-master/scripts/extract_svg_assets.py:299— extract_svg_assets._optimize_definitions has cognitive complexity 56 (threshold 15). Drivers by points: if/else 11 (31 pts), loops 10 (22 pts), boolean chains 3 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalized_chart_svg._render_lines_or_areas (cognitive 56) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:604— normalized_chart_svg._render_lines_or_areas has cognitive complexity 56 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 5 (10 pts), ternaries 2 (9 pts), boolean chains 7 (nesting depth added 32). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalized_chart_svg._render_xy (cognitive 56) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:797— normalized_chart_svg._render_xy has cognitive complexity 56 (threshold 15). Drivers by points: ternaries 10 (19 pts), boolean chains 17, if/else 7 (16 pts), loops 2 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_image_references (cognitive 56) skills/ppt-master/scripts/svg_quality/checker.py:5257— SVGQualityChecker._check_image_references has cognitive complexity 56 (threshold 15). Drivers by points: if/else 14 (30 pts), error handling 5 (12 pts), boolean chains 11, ternaries 1 (2 pts), loops 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
checker._compact_preset_ancestor_paint (cognitive 56) skills/ppt-master/scripts/svg_quality/checker.py:488— checker._compact_preset_ancestor_paint has cognitive complexity 56 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 5 (12 pts), boolean chains 10, error handling 1 (5 pts) (nesting depth added 30). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._combo_chart_data (cognitive 56) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:1212— chart_data._combo_chart_data has cognitive complexity 56 (threshold 15). Drivers by points: if/else 20 (34 pts), ternaries 4 (10 pts), boolean chains 7, loops 3 (5 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tbl_to_svg.convert_tbl (cognitive 55) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:279— tbl_to_svg.convert_tbl has cognitive complexity 55 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 14, loops 7 (12 pts), ternaries 6 (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.
pptx_transitions.validate_generated_transition_xml (cognitive 55) skills/ppt-master/scripts/pptx_transitions.py:2317— pptx_transitions.validate_generated_transition_xml has cognitive complexity 55 (threshold 15). Drivers by points: if/else 15 (34 pts), ternaries 8 (14 pts), loops 1 (5 pts), boolean chains 2 (nesting depth added 29). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
doc_to_md._omml_to_latex (cognitive 55) skills/ppt-master/scripts/source_to_md/doc_to_md.py:548— doc_to_md._omml_to_latex has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (27 pts), ternaries 9 (19 pts), boolean chains 9 (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.
image_search.promote_candidate (cognitive 54) skills/ppt-master/scripts/image_search.py:1515— image_search.promote_candidate has cognitive complexity 54 (threshold 15). Drivers by points: boolean chains 26, if/else 16 (20 pts), error handling 5 (7 pts), ternaries 1 (nesting depth added 6). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
chart_to_svg._combo_payload (cognitive 54) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:264— chart_to_svg._combo_payload has cognitive complexity 54 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 7, loops 4 (7 pts), ternaries 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slide_to_svg._convert_shape (cognitive 54) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:532— slide_to_svg._convert_shape has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (30 pts), boolean chains 9, ternaries 6 (8 pts), error handling 4 (7 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config._animation_parameter_errors (cognitive 54) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:533— animation_config._animation_parameter_errors has cognitive complexity 54 (threshold 15). Drivers by points: if/else 21 (30 pts), boolean chains 11, error handling 3 (8 pts), loops 3 (5 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_gen._run_manifest (cognitive 53) skills/ppt-master/scripts/image_gen.py:901— image_gen._run_manifest has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (29 pts), ternaries 4 (14 pts), boolean chains 4, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
narration_sync._resolve_animation_groups (cognitive 53) skills/ppt-master/scripts/narration_sync.py:827— narration_sync._resolve_animation_groups has cognitive complexity 53 (threshold 15). Drivers by points: if/else 17 (36 pts), loops 6 (9 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
excel_to_md._convert_excel (cognitive 53) skills/ppt-master/scripts/source_to_md/excel_to_md.py:322— excel_to_md._convert_excel has cognitive complexity 53 (threshold 15). Drivers by points: if/else 15 (33 pts), loops 6 (12 pts), boolean chains 4, ternaries 2 (3 pts), error handling 1 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_position_calculator.interactive_mode (cognitive 53) skills/ppt-master/scripts/svg_position_calculator.py:1156— svg_position_calculator.interactive_mode has cognitive complexity 53 (threshold 15). Drivers by points: if/else 7 (18 pts), boolean chains 14, error handling 5 (12 pts), loops 3 (9 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_roundtrip_text_frames (cognitive 53) skills/ppt-master/scripts/svg_quality/checker.py:2202— SVGQualityChecker._check_roundtrip_text_frames has cognitive complexity 53 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 9, ternaries 2 (5 pts), loops 2, error handling 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_measure._outline_candidates (cognitive 53) skills/ppt-master/scripts/text_measure.py:461— text_measure._outline_candidates has cognitive complexity 53 (threshold 15). Drivers by points: if/else 12 (34 pts), ternaries 3 (9 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_transitions._validate_applied_motion (cognitive 52) skills/ppt-master/scripts/pptx_transitions.py:1977— pptx_transitions._validate_applied_motion has cognitive complexity 52 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 3 (9 pts), boolean chains 7, ternaries 5 (7 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip.normalized_authoring_subtree_sha256 (cognitive 51) skills/ppt-master/scripts/authoring_roundtrip.py:1014— authoring_roundtrip.normalized_authoring_subtree_sha256 has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (37 pts), loops 3 (7 pts), boolean chains 6, ternaries 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doc_to_md._docx_inject_tables_markdown (cognitive 51) skills/ppt-master/scripts/source_to_md/doc_to_md.py:835— doc_to_md._docx_inject_tables_markdown has cognitive complexity 51 (threshold 15). Drivers by points: if/else 13 (29 pts), loops 7 (11 pts), ternaries 2 (5 pts), boolean chains 3, error handling 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native_payloads.hydrate_native_payload_refs (cognitive 50) skills/ppt-master/scripts/native_payloads.py:553— native_payloads.hydrate_native_payload_refs has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (40 pts), boolean chains 7, loops 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
notes_to_audio._expected_note_roster (cognitive 50) skills/ppt-master/scripts/notes_to_audio.py:148— notes_to_audio._expected_note_roster has cognitive complexity 50 (threshold 15). Drivers by points: if/else 13 (28 pts), loops 4 (8 pts), ternaries 2 (6 pts), boolean chains 4, error handling 2 (4 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._validate_stock_semantics (cognitive 50) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:471— chart_to_svg._validate_stock_semantics has cognitive complexity 50 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 9, loops 5 (7 pts), ternaries 2 (4 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_omml._append_run (cognitive 50) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:181— formula_omml._append_run has cognitive complexity 50 (threshold 15). Drivers by points: if/else 14 (26 pts), ternaries 4 (12 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_cosyvoice._word_boundaries (cognitive 50) skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:129— backend_cosyvoice._word_boundaries has cognitive complexity 50 (threshold 15). Drivers by points: if/else 15 (34 pts), boolean chains 12, loops 3 (4 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preset_authoring._validate_expanded_authored_preset_group (cognitive 49) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:357— preset_authoring._validate_expanded_authored_preset_group has cognitive complexity 49 (threshold 15). Drivers by points: if/else 34 (38 pts), boolean chains 7, error handling 2, loops 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
prompt_audit.audit_load_sets (cognitive 49) skills/ppt-master/scripts/prompt_audit.py:419— prompt_audit.audit_load_sets has cognitive complexity 49 (threshold 15). Drivers by points: if/else 12 (36 pts), boolean chains 5, ternaries 2 (5 pts), loops 2 (3 pts) (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ppt_to_md.text_frame_to_markdown (cognitive 49) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:502— ppt_to_md.text_frame_to_markdown has cognitive complexity 49 (threshold 15). Drivers by points: if/else 14 (27 pts), ternaries 4 (10 pts), boolean chains 8, loops 2 (4 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
web_to_md.download_and_rewrite_images (cognitive 49) skills/ppt-master/scripts/source_to_md/web_to_md.py:653— web_to_md.download_and_rewrite_images has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 4 (14 pts), error handling 3 (10 pts), ternaries 2 (5 pts), boolean chains 3 (nesting depth added 27). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_preset_geometry_metadata (cognitive 49) skills/ppt-master/scripts/svg_quality/checker.py:5512— SVGQualityChecker._check_preset_geometry_metadata has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (24 pts), boolean chains 8, loops 4 (7 pts), ternaries 3 (7 pts), error handling 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
table._resolve_table_merge_layout (cognitive 49) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:457— table._resolve_table_merge_layout has cognitive complexity 49 (threshold 15). Drivers by points: if/else 10 (35 pts), loops 5 (11 pts), boolean chains 3 (nesting depth added 31). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_search.load_search_manifest (cognitive 48) skills/ppt-master/scripts/image_search.py:1887— image_search.load_search_manifest has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (29 pts), error handling 5 (10 pts), loops 3 (5 pts), boolean chains 4 (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.
txbody_to_svg._convert_east_asian_vertical (cognitive 48) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:383— txbody_to_svg._convert_east_asian_vertical has cognitive complexity 48 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 7 (14 pts), boolean chains 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ppt_to_md._xy_chart_to_markdown (cognitive 48) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:721— ppt_to_md._xy_chart_to_markdown has cognitive complexity 48 (threshold 15). Drivers by points: if/else 13 (26 pts), ternaries 4 (13 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_omml._validate_xml_tree (cognitive 48) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:888— formula_omml._validate_xml_tree has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 10, loops 2 (3 pts), ternaries 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.
app.renderImageDirection (cognitive 48) skills/ppt-master/scripts/confirm_ui/static/app.js:3566— app.renderImageDirection has cognitive complexity 48 (threshold 15). Drivers by points: if/else 23 (28 pts), boolean chains 16, loops 3, ternaries 1 (nesting depth added 5). Of this number, 24 points are the body's own statements and 24 belong to 9 function items inside it that branch. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
mirror_template_materialize._validate_graph_roster (cognitive 47) skills/ppt-master/scripts/mirror_template_materialize.py:974— mirror_template_materialize._validate_graph_roster has cognitive complexity 47 (threshold 15). Drivers by points: if/else 21 (35 pts), loops 7 (8 pts), boolean chains 4 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._validate_legacy_axes (cognitive 47) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1581— chart_to_svg._validate_legacy_axes has cognitive complexity 47 (threshold 15). Drivers by points: if/else 16 (38 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
source_to_md.dispatch_single (cognitive 47) skills/ppt-master/scripts/source_to_md.py:282— source_to_md.dispatch_single has cognitive complexity 47 (threshold 15). Drivers by points: if/else 22 (38 pts), boolean chains 4, error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config._morph_scope_errors (cognitive 47) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:826— animation_config._morph_scope_errors has cognitive complexity 47 (threshold 15). Drivers by points: if/else 15 (33 pts), boolean chains 7, loops 2 (5 pts), error handling 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations.normalize_animation_effect_options (cognitive 46) skills/ppt-master/scripts/pptx_animations.py:558— pptx_animations.normalize_animation_effect_options has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 7, ternaries 1 (3 pts), loops 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server.main (cognitive 46) skills/ppt-master/scripts/svg_editor/server.py:1481— server.main has cognitive complexity 46 (threshold 15). Drivers by points: if/else 16 (24 pts), error handling 7 (11 pts), ternaries 5 (9 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._prune_unreferenced_definition_payload_parts (cognitive 46) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4917— builder._prune_unreferenced_definition_payload_parts has cognitive complexity 46 (threshold 15). Drivers by points: if/else 10 (32 pts), loops 5 (10 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 29). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server.main (cognitive 45) skills/ppt-master/scripts/confirm_ui/server.py:2804— server.main has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (28 pts), error handling 5 (9 pts), ternaries 3 (6 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.
pptx_delivery_check._font_faces_for_advisory (cognitive 45) skills/ppt-master/scripts/pptx_delivery_check.py:462— pptx_delivery_check._font_faces_for_advisory has cognitive complexity 45 (threshold 15). Drivers by points: if/else 9 (28 pts), loops 5 (14 pts), boolean chains 3 (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.
converter._extract_theme_info (cognitive 45) skills/ppt-master/scripts/pptx_to_svg/converter.py:139— converter._extract_theme_info has cognitive complexity 45 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 3 (7 pts), boolean chains 4, error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_workspace._sniff_resource_format (cognitive 45) skills/ppt-master/scripts/pptx_workspace.py:291— pptx_workspace._sniff_resource_format has cognitive complexity 45 (threshold 15). Drivers by points: if/else 30 (34 pts), boolean chains 10, error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
register_template._validate_svg_template_spec (cognitive 45) skills/ppt-master/scripts/register_template.py:991— register_template._validate_svg_template_spec has cognitive complexity 45 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 10, error handling 3 (7 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ppt_to_md._paragraph_bullet (cognitive 45) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:413— ppt_to_md._paragraph_bullet has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (36 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 26). 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.
web_to_md.find_main_content (cognitive 45) skills/ppt-master/scripts/source_to_md/web_to_md.py:881— web_to_md.find_main_content has cognitive complexity 45 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 7 (10 pts), boolean chains 5, ternaries 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._roundtrip_text_diff_ids (cognitive 45) skills/ppt-master/scripts/svg_quality/checker.py:1848— SVGQualityChecker._roundtrip_text_diff_ids has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (38 pts), loops 3 (4 pts), boolean chains 3 (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.
SVGQualityChecker._check_illustration_resource_contract (cognitive 45) skills/ppt-master/scripts/svg_quality/checker.py:8013— SVGQualityChecker._check_illustration_resource_contract has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 4 (5 pts), boolean chains 3, error handling 1, ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.initKeyboardShortcuts (cognitive 45) REDACTED:1554— app.initKeyboardShortcuts has cognitive complexity 45 (threshold 15). Drivers by points: if/else 17 (23 pts), ternaries 5 (12 pts), boolean chains 10 (nesting depth added 13). None of this is in the body itself: all 45 points belong to 2 function literals inside it that branch (lines 1555, 1578). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
extract_svg_assets.extract_file (cognitive 44) skills/ppt-master/scripts/extract_svg_assets.py:791— extract_svg_assets.extract_file has cognitive complexity 44 (threshold 15). Drivers by points: if/else 11 (23 pts), loops 7 (12 pts), boolean chains 6, ternaries 2 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_treat._apply_treatments (cognitive 44) skills/ppt-master/scripts/image_treat.py:333— image_treat._apply_treatments has cognitive complexity 44 (threshold 15). Drivers by points: if/else 22 (30 pts), ternaries 5 (7 pts), boolean chains 6, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._effective_scatter_style (cognitive 44) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1754— chart_to_svg._effective_scatter_style has cognitive complexity 44 (threshold 15). Drivers by points: if/else 15 (26 pts), ternaries 5 (10 pts), boolean chains 7, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_transitions.validate_pptx_morph_pairs (cognitive 44) skills/ppt-master/scripts/pptx_transitions.py:2712— pptx_transitions.validate_pptx_morph_pairs has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 6, loops 5, error handling 2 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
resource_paths._svg_image_payload_error (cognitive 44) skills/ppt-master/scripts/resource_paths.py:177— resource_paths._svg_image_payload_error has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (32 pts), loops 4 (8 pts), boolean chains 3, error handling 1 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements.parse_project_nested_svg_crop (cognitive 44) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5261— elements.parse_project_nested_svg_crop has cognitive complexity 44 (threshold 15). Drivers by points: if/else 23 (24 pts), boolean chains 16, error handling 2 (3 pts), loops 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_xml._series_xml (cognitive 44) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:471— chart_xml._series_xml has cognitive complexity 44 (threshold 15). Drivers by points: ternaries 11 (26 pts), if/else 5 (12 pts), boolean chains 5, loops 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations._row_offset_ms (cognitive 43) skills/ppt-master/scripts/pptx_animations.py:2716— pptx_animations._row_offset_ms has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 12, loops 1 (nesting depth added 16). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
txbody_to_svg._wrap_paragraph_into_lines (cognitive 43) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1410— txbody_to_svg._wrap_paragraph_into_lines has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (36 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
project_utils.validate_project_structure (cognitive 43) skills/ppt-master/scripts/project_utils.py:599— project_utils.validate_project_structure has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (32 pts), boolean chains 7, loops 1 (3 pts), error handling 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
align_embed_images._process_one_image (cognitive 43) skills/ppt-master/scripts/svg_finalize/align_embed_images.py:348— align_embed_images._process_one_image has cognitive complexity 43 (threshold 15). Drivers by points: if/else 25 (33 pts), ternaries 3 (5 pts), boolean chains 4, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements.project_clip_path_errors (cognitive 43) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4102— elements.project_clip_path_errors has cognitive complexity 43 (threshold 15). Drivers by points: if/else 17 (35 pts), boolean chains 7, loops 1 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
styles.parse_pattern_colors (cognitive 43) skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:211— styles.parse_pattern_colors has cognitive complexity 43 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 11, ternaries 5 (9 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.
utils._transform_semantic_error (cognitive 43) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1167— utils._transform_semantic_error has cognitive complexity 43 (threshold 15). Drivers by points: if/else 19 (37 pts), boolean chains 6 (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.
_LatexParser._parse_cd_environment (cognitive 43) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1539— _LatexParser._parse_cd_environment has cognitive complexity 43 (threshold 15). Drivers by points: if/else 11 (25 pts), ternaries 2 (9 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.rawMoveAttrs (cognitive 43) REDACTED:2591— app.rawMoveAttrs has cognitive complexity 43 (threshold 15). Drivers by points: if/else 20 (29 pts), boolean chains 8, ternaries 3 (6 pts) (nesting depth added 12). Of this number, 31 points are the body's own statements and 12 belong to 3 function items inside it that branch. To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_gen.main (cognitive 42) skills/ppt-master/scripts/image_gen.py:1245— image_gen.main has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (24 pts), error handling 8 (12 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._copy_text_carrier (cognitive 42) skills/ppt-master/scripts/mirror_template_materialize.py:1859— mirror_template_materialize._copy_text_carrier has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (33 pts), loops 2 (6 pts), boolean chains 3 (nesting depth added 24). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations._set_effect_option_value (cognitive 42) skills/ppt-master/scripts/pptx_animations.py:1379— pptx_animations._set_effect_option_value has cognitive complexity 42 (threshold 15). Drivers by points: if/else 16 (30 pts), boolean chains 4, loops 2 (4 pts), ternaries 2 (4 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._managed_vector_asset_paths (cognitive 42) skills/ppt-master/scripts/pptx_to_svg/converter.py:961— converter._managed_vector_asset_paths has cognitive complexity 42 (threshold 15). Drivers by points: if/else 8 (20 pts), ternaries 5 (12 pts), boolean chains 5, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tbl_to_svg._build_cell_grid (cognitive 42) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:544— tbl_to_svg._build_cell_grid has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (21 pts), loops 5 (14 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tbl_to_svg._direct_border_payload (cognitive 42) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:750— tbl_to_svg._direct_border_payload has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (30 pts), boolean chains 10, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
page_context.page_context_usage_report (cognitive 42) skills/ppt-master/scripts/project_management/page_context.py:884— page_context.page_context_usage_report has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (32 pts), loops 2 (5 pts), error handling 1 (3 pts), boolean chains 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.
svg_position_calculator.analyze_svg_file (cognitive 42) skills/ppt-master/scripts/svg_position_calculator.py:1061— svg_position_calculator.analyze_svg_file has cognitive complexity 42 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 6 (11 pts), ternaries 3 (9 pts), boolean chains 2 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._chartex_chart_data (cognitive 42) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:1428— chart_data._chartex_chart_data has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (34 pts), loops 2 (5 pts), boolean chains 3 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_xml._data_labels_xml (cognitive 42) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:246— chart_xml._data_labels_xml has cognitive complexity 42 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 8 (17 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
semantic_markers.validate_semantic_markers (cognitive 42) skills/ppt-master/scripts/svg_to_pptx/semantic_markers.py:126— semantic_markers.validate_semantic_markers has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (27 pts), boolean chains 13, loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
video_sound_mix._resolve_sound_cues (cognitive 42) skills/ppt-master/scripts/video_sound_mix.py:679— video_sound_mix._resolve_sound_cues has cognitive complexity 42 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 5 (9 pts), boolean chains 4 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
video_sound_mix.mix_video_sounds (cognitive 42) skills/ppt-master/scripts/video_sound_mix.py:1129— video_sound_mix.mix_video_sounds has cognitive complexity 42 (threshold 15). Drivers by points: if/else 26 (28 pts), boolean chains 10, loops 3, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
app.boot (cognitive 42) skills/ppt-master/scripts/confirm_ui/static/app.js:4528— app.boot has cognitive complexity 42 (threshold 15). Drivers by points: if/else 23 (25 pts), boolean chains 14, ternaries 2, error handling 1 (nesting depth added 2). None of this is in the body itself: all 42 points belong to 10 function items inside it that branch (a function literal at line 4575, chooseLang, setMenuOpen, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
pptx_delivery_check._motion_and_hidden_summary (cognitive 41) skills/ppt-master/scripts/pptx_delivery_check.py:510— pptx_delivery_check._motion_and_hidden_summary has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (22 pts), error handling 6 (10 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._normalized_chart_visual_styles (cognitive 41) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1129— chart_to_svg._normalized_chart_visual_styles has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 5 (13 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter.convert_pptx_to_svg (cognitive 41) skills/ppt-master/scripts/pptx_to_svg/converter.py:482— converter.convert_pptx_to_svg has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 7 (12 pts), boolean chains 9, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preset_authoring._validate_compact_authored_preset_group (cognitive 41) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:208— preset_authoring._validate_compact_authored_preset_group has cognitive complexity 41 (threshold 15). Drivers by points: if/else 26 (29 pts), boolean chains 10, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
txbody_to_svg._emit_paragraph (cognitive 41) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1596— txbody_to_svg._emit_paragraph has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (26 pts), ternaries 4 (10 pts), loops 2 (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.
register_template._validate_brand_spec (cognitive 41) skills/ppt-master/scripts/register_template.py:521— register_template._validate_brand_spec has cognitive complexity 41 (threshold 15). Drivers by points: if/else 17 (26 pts), boolean chains 9, loops 4, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._is_semantic_shape_candidate (cognitive 41) skills/ppt-master/scripts/svg_authoring_view.py:517— svg_authoring_view._is_semantic_shape_candidate has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (26 pts), boolean chains 9, error handling 2 (4 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._compact_semantic_shapes (cognitive 41) skills/ppt-master/scripts/svg_authoring_view.py:840— svg_authoring_view._compact_semantic_shapes has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (30 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view.project_svg_batch (cognitive 41) skills/ppt-master/scripts/svg_authoring_view.py:2524— svg_authoring_view.project_svg_batch has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 5 (8 pts), boolean chains 6, error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._clip_preset_geometry_error (cognitive 41) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3864— elements._clip_preset_geometry_error has cognitive complexity 41 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 11, ternaries 6 (10 pts), error handling 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_patch._patch_cache (cognitive 41) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:194— chart_patch._patch_cache has cognitive complexity 41 (threshold 15). Drivers by points: if/else 16 (28 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_ast.formula_node_count (cognitive 41) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:498— formula_ast.formula_node_count has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (37 pts), loops 2 (4 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
video_motion_plan.build_video_motion_plan (cognitive 41) skills/ppt-master/scripts/video_motion_plan.py:410— video_motion_plan.build_video_motion_plan has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (32 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
compact_svg_styles._promote_common_group_defaults (cognitive 40) skills/ppt-master/scripts/compact_svg_styles.py:350— compact_svg_styles._promote_common_group_defaults has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 4 (6 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
language_tags.normalize_language_tag (cognitive 40) skills/ppt-master/scripts/language_tags.py:159— language_tags.normalize_language_tag has cognitive complexity 40 (threshold 15). Drivers by points: if/else 16 (20 pts), boolean chains 11, loops 5 (7 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
tbl_to_svg._canonical_native_merge_status (cognitive 40) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:637— tbl_to_svg._canonical_native_merge_status has cognitive complexity 40 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 7 (11 pts), boolean chains 7, ternaries 2 (4 pts), error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._load_project_svg_image_references (cognitive 40) skills/ppt-master/scripts/svg_quality/checker.py:8328— SVGQualityChecker._load_project_svg_image_references has cognitive complexity 40 (threshold 15). Drivers by points: if/else 10 (29 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config._resolved_animation_parameter_errors (cognitive 40) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1325— animation_config._resolved_animation_parameter_errors has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 3 (6 pts), error handling 1 (3 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_ast._node_vertical_extent (cognitive 40) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:299— formula_ast._node_vertical_extent has cognitive complexity 40 (threshold 15). Drivers by points: if/else 28 (37 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._apply_template_text_language (cognitive 40) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6301— builder._apply_template_text_language has cognitive complexity 40 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 6 (14 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._roundtrip_slide_patches (cognitive 40) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:510— cli._roundtrip_slide_patches has cognitive complexity 40 (threshold 15). Drivers by points: if/else 14 (19 pts), boolean chains 17, ternaries 2, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
mirror_template_materialize._load_authoring_documents (cognitive 39) skills/ppt-master/scripts/mirror_template_materialize.py:615— mirror_template_materialize._load_authoring_documents has cognitive complexity 39 (threshold 15). Drivers by points: if/else 17 (30 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._slot_plans (cognitive 39) skills/ppt-master/scripts/mirror_template_materialize.py:1776— mirror_template_materialize._slot_plans has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 4, loops 2 (4 pts), ternaries 2 (3 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_opc_validation.verify_internal_relationships (cognitive 39) skills/ppt-master/scripts/pptx_opc_validation.py:265— pptx_opc_validation.verify_internal_relationships has cognitive complexity 39 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 5, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ImageRotator.apply_fixes (cognitive 39) skills/ppt-master/scripts/rotate_images.py:348— ImageRotator.apply_fixes has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (28 pts), error handling 2 (5 pts), boolean chains 4, loops 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
source_to_md.dispatch_many (cognitive 39) skills/ppt-master/scripts/source_to_md.py:492— source_to_md.dispatch_many has cognitive complexity 39 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 10, loops 3 (7 pts), ternaries 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._category_series (cognitive 39) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:878— chart_data._category_series has cognitive complexity 39 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract_svg_assets._existing_placeholder_entries (cognitive 38) skills/ppt-master/scripts/extract_svg_assets.py:592— extract_svg_assets._existing_placeholder_entries has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (29 pts), error handling 2 (5 pts), loops 3 (4 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ooxml._container_geometry (cognitive 38) skills/ppt-master/scripts/pptx_ooxml/ooxml.py:198— ooxml._container_geometry has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (22 pts), ternaries 6 (10 pts), error handling 2 (4 pts), loops 1 (2 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doc_to_md._docx_image_occurrences (cognitive 38) skills/ppt-master/scripts/source_to_md/doc_to_md.py:335— doc_to_md._docx_image_occurrences has cognitive complexity 38 (threshold 15). Drivers by points: if/else 11 (28 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doc_to_md._docx_inject_math_latex (cognitive 38) skills/ppt-master/scripts/source_to_md/doc_to_md.py:657— doc_to_md._docx_inject_math_latex has cognitive complexity 38 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 3 (8 pts), loops 5 (6 pts), boolean chains 2, error handling 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.
SVGQualityChecker._roundtrip_changed_font_families (cognitive 38) skills/ppt-master/scripts/svg_quality/checker.py:2121— SVGQualityChecker._roundtrip_changed_font_families has cognitive complexity 38 (threshold 15). Drivers by points: if/else 10 (28 pts), loops 3 (5 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native_objects._decode_source_chart_package (cognitive 38) skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py:145— native_objects._decode_source_chart_package has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (27 pts), error handling 3 (4 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_omml._append_node (cognitive 38) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:277— formula_omml._append_node has cognitive complexity 38 (threshold 15). Drivers by points: if/else 25 (29 pts), loops 3 (7 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
marker_status.native_marker_status_errors (cognitive 38) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_status.py:89— marker_status.native_marker_status_errors has cognitive complexity 38 (threshold 15). Drivers by points: if/else 19 (24 pts), boolean chains 11, error handling 1, 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.
chart_to_svg._data_label_text_style (cognitive 37) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2539— chart_to_svg._data_label_text_style has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 10, ternaries 4 (5 pts), error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
converter._write_artifact_tree (cognitive 37) skills/ppt-master/scripts/pptx_to_svg/converter.py:1342— converter._write_artifact_tree has cognitive complexity 37 (threshold 15). Drivers by points: if/else 14 (23 pts), loops 7 (8 pts), boolean chains 3, ternaries 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view.main (cognitive 37) skills/ppt-master/scripts/svg_authoring_view.py:2724— svg_authoring_view.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 19 (24 pts), error handling 4 (6 pts), boolean chains 4, ternaries 2, loops 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
SVGQualityChecker._record_carrier_receipt (cognitive 37) skills/ppt-master/scripts/svg_quality/checker.py:2712— SVGQualityChecker._record_carrier_receipt has cognitive complexity 37 (threshold 15). Drivers by points: if/else 9 (20 pts), ternaries 3 (8 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
paths.project_gradient_geometry_errors (cognitive 37) skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:394— paths.project_gradient_geometry_errors has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (18 pts), ternaries 6 (12 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_xml._chart_plot_xml (cognitive 37) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:1212— chart_xml._chart_plot_xml has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 12, ternaries 7 (11 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LatexParser._find_matching_character (cognitive 37) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1350— _LatexParser._find_matching_character has cognitive complexity 37 (threshold 15). Drivers by points: if/else 11 (31 pts), ternaries 1 (4 pts), boolean chains 1, loops 1 (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure.template_prototype_lock_errors (cognitive 37) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2202— template_structure.template_prototype_lock_errors has cognitive complexity 37 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 7, error handling 4 (6 pts), loops 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_measure.main (cognitive 37) skills/ppt-master/scripts/text_measure.py:905— text_measure.main has cognitive complexity 37 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 8, ternaries 2 (4 pts), loops 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config.main (cognitive 36) skills/ppt-master/scripts/animation_config.py:77— animation_config.main has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 5 (12 pts), error handling 3 (6 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_search._save_candidate_thumbnails (cognitive 36) skills/ppt-master/scripts/image_search.py:882— image_search._save_candidate_thumbnails has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (21 pts), error handling 3 (7 pts), boolean chains 4, loops 2, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._mark_explicit_breaks (cognitive 36) skills/ppt-master/scripts/mirror_template_materialize.py:1263— mirror_template_materialize._mark_explicit_breaks has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (26 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
narration_sync._load_timing_plan (cognitive 36) skills/ppt-master/scripts/narration_sync.py:360— narration_sync._load_timing_plan has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (26 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations.validate_pptx_animation_package (cognitive 36) skills/ppt-master/scripts/pptx_animations.py:3587— pptx_animations.validate_pptx_animation_package has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (22 pts), error handling 4 (7 pts), loops 3 (5 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.
slide_to_svg._roundtrip_chart_package (cognitive 36) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1949— slide_to_svg._roundtrip_chart_package has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 6, error handling 2 (3 pts), loops 2 (3 pts), ternaries 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.
tbl_to_svg._legacy_text_body_has_unsupported_formatting (cognitive 36) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1092— tbl_to_svg._legacy_text_body_has_unsupported_formatting has cognitive complexity 36 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 6, ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slice_images._keying_findings (cognitive 36) skills/ppt-master/scripts/slice_images.py:629— slice_images._keying_findings has cognitive complexity 36 (threshold 15). Drivers by points: if/else 15 (28 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_contracts.check_authoring_property_contract (cognitive 36) skills/ppt-master/scripts/svg_quality/svg_contracts.py:499— svg_contracts.check_authoring_property_contract has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (26 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.enumField (cognitive 36) skills/ppt-master/scripts/confirm_ui/static/app.js:1418— app.enumField has cognitive complexity 36 (threshold 15). Drivers by points: if/else 41 (51 pts), boolean chains 33, ternaries 7 (9 pts) (nesting depth added 12). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (app.enumField::makeChip) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
authoring_roundtrip._load_page_plan (cognitive 35) skills/ppt-master/scripts/authoring_roundtrip.py:627— authoring_roundtrip._load_page_plan has cognitive complexity 35 (threshold 15). Drivers by points: if/else 18 (29 pts), boolean chains 5, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip._text_body_state (cognitive 35) skills/ppt-master/scripts/authoring_roundtrip.py:1572— authoring_roundtrip._text_body_state has cognitive complexity 35 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 5 (11 pts), error handling 1 (5 pts) (nesting depth added 23). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations.create_sequence_timing_xml (cognitive 35) skills/ppt-master/scripts/pptx_animations.py:1845— pptx_animations.create_sequence_timing_xml has cognitive complexity 35 (threshold 15). Drivers by points: if/else 17 (25 pts), loops 3 (5 pts), boolean chains 4, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
txbody_to_svg._parse_paragraph (cognitive 35) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:667— txbody_to_svg._parse_paragraph has cognitive complexity 35 (threshold 15). Drivers by points: if/else 8 (19 pts), ternaries 3 (7 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
project_utils.validate_communication_trace (cognitive 35) skills/ppt-master/scripts/project_utils.py:239— project_utils.validate_communication_trace has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (23 pts), ternaries 3 (6 pts), error handling 2 (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.
SVGQualityChecker._check_animation_group_ids (cognitive 35) skills/ppt-master/scripts/svg_quality/checker.py:5784— SVGQualityChecker._check_animation_group_ids has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 4, ternaries 2 (4 pts), loops 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
styles.build_gradient_fill (cognitive 35) skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:44— styles.build_gradient_fill has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 3 (6 pts), ternaries 1 (4 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.
template_structure.template_lock_errors (cognitive 35) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2363— template_structure.template_lock_errors has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure._placement_lint_errors (cognitive 35) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:3675— template_structure._placement_lint_errors has cognitive complexity 35 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 8, error handling 2, loops 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native_payloads.externalize_native_payloads (cognitive 34) skills/ppt-master/scripts/native_payloads.py:245— native_payloads.externalize_native_payloads has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 7, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native_payloads._load_store (cognitive 34) skills/ppt-master/scripts/native_payloads.py:421— native_payloads._load_store has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 8, loops 3 (4 pts), error handling 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.
pptx_animations._scale_animation_row_duration (cognitive 34) skills/ppt-master/scripts/pptx_animations.py:1182— pptx_animations._scale_animation_row_duration has cognitive complexity 34 (threshold 15). Drivers by points: if/else 9 (19 pts), ternaries 2 (6 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._resolved_line (cognitive 34) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:731— chart_to_svg._resolved_line has cognitive complexity 34 (threshold 15). Drivers by points: if/else 16 (28 pts), boolean chains 5, 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.
chart_to_svg._canonical_title_paragraph (cognitive 34) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2412— chart_to_svg._canonical_title_paragraph has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 11, error handling 1 (2 pts), ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
converter._managed_report_artifact_paths (cognitive 34) skills/ppt-master/scripts/pptx_to_svg/converter.py:1021— converter._managed_report_artifact_paths has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (24 pts), loops 4 (5 pts), boolean chains 4, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_transitions._validate_transition_sound_package_parts (cognitive 34) skills/ppt-master/scripts/pptx_transitions.py:2521— pptx_transitions._validate_transition_sound_package_parts has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 4, loops 2, error handling 1, ternaries 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.
svg_rect_to_path.main (cognitive 34) skills/ppt-master/scripts/svg_finalize/svg_rect_to_path.py:236— svg_rect_to_path.main has cognitive complexity 34 (threshold 15). Drivers by points: if/else 15 (29 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._carrier_effect_receipt (cognitive 34) skills/ppt-master/scripts/svg_quality/checker.py:2819— SVGQualityChecker._carrier_effect_receipt has cognitive complexity 34 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 7, loops 3 (5 pts), ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._extract_background_candidate (cognitive 34) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1642— converter._extract_background_candidate has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 5, ternaries 1 (2 pts), loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
table._table_run (cognitive 34) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:314— table._table_run has cognitive complexity 34 (threshold 15). Drivers by points: if/else 18 (28 pts), boolean chains 4, loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._ensure_notes_master (cognitive 34) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:5556— builder._ensure_notes_master has cognitive complexity 34 (threshold 15). Drivers by points: if/else 13 (24 pts), loops 3 (5 pts), boolean chains 4, error handling 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_boolean._connected_components (cognitive 34) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:1080— shape_boolean._connected_components has cognitive complexity 34 (threshold 15). Drivers by points: if/else 11 (26 pts), loops 4 (6 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.
pptx_workspace.inventory_package_resources (cognitive 33) skills/ppt-master/scripts/pptx_workspace.py:794— pptx_workspace.inventory_package_resources has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.parse_project_filter_params (cognitive 33) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2636— utils.parse_project_filter_params has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 2 (5 pts), boolean chains 3, loops 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native_objects._validate_native_object_marker_payload (cognitive 33) skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py:555— native_objects._validate_native_object_marker_payload has cognitive complexity 33 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 6, error handling 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_parser._collect_macros (cognitive 33) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:241— formula_parser._collect_macros has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 4, loops 2 (4 pts), error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
total_md_split.parse_total_md (cognitive 33) skills/ppt-master/scripts/total_md_split.py:137— total_md_split.parse_total_md has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (25 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
clone._report_all_dangling_slide_jumps (cognitive 32) skills/ppt-master/scripts/pptx_ooxml/clone.py:669— clone._report_all_dangling_slide_jumps has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (7 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_template_import.main (cognitive 32) skills/ppt-master/scripts/pptx_template_import.py:194— pptx_template_import.main has cognitive complexity 32 (threshold 15). Drivers by points: if/else 13 (15 pts), error handling 6 (10 pts), ternaries 3 (5 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
chart_to_svg._payload_from_chart_xml (cognitive 32) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:126— chart_to_svg._payload_from_chart_xml has cognitive complexity 32 (threshold 15). Drivers by points: if/else 17 (23 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
page_context.build_page_context (cognitive 32) skills/ppt-master/scripts/project_management/page_context.py:470— page_context.build_page_context has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6, ternaries 5 (6 pts), error handling 2, 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.
doc_to_md._convert_ipynb (cognitive 32) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1511— doc_to_md._convert_ipynb has cognitive complexity 32 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 4 (9 pts), ternaries 3 (6 pts), error handling 2 (5 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.
SVGQualityChecker._roundtrip_text_frame (cognitive 32) skills/ppt-master/scripts/svg_quality/checker.py:2443— SVGQualityChecker._roundtrip_text_frame has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 8, error handling 3 (6 pts), ternaries 2 (3 pts), loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_placeholder_carrier_flattening (cognitive 32) skills/ppt-master/scripts/svg_quality/checker.py:6284— SVGQualityChecker._check_placeholder_carrier_flattening has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 8, loops 2, error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_sourced_image_attribution (cognitive 32) skills/ppt-master/scripts/svg_quality/checker.py:7057— SVGQualityChecker._check_sourced_image_attribution has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 12, ternaries 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config._resolve_morph_pairs (cognitive 32) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:935— animation_config._resolve_morph_pairs has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements.validate_preset_geometry_metadata (cognitive 32) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:971— elements.validate_preset_geometry_metadata has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (16 pts), error handling 5 (10 pts), boolean chains 5, 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.
elements.convert_circle (cognitive 32) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1470— elements.convert_circle has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (19 pts), ternaries 3 (7 pts), boolean chains 6 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_style._legend_candidate_texts (cognitive 32) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:675— chart_style._legend_candidate_texts has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (8 pts), boolean chains 3, ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._apply_morph_shape_names (cognitive 32) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:691— builder._apply_morph_shape_names has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 5 (8 pts), ternaries 1 (3 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
manifest.parse_theme (cognitive 32) skills/ppt-master/scripts/template_import/manifest.py:424— manifest.parse_theme has cognitive complexity 32 (threshold 15). Drivers by points: if/else 11 (26 pts), boolean chains 4, loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_minimax._word_boundaries (cognitive 32) skills/ppt-master/scripts/tts_backends/backend_minimax.py:61— backend_minimax._word_boundaries has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (20 pts), boolean chains 6, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
latex_render._make_png_background_transparent (cognitive 31) skills/ppt-master/scripts/latex_render.py:347— latex_render._make_png_background_transparent has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 4 (10 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations._apply_timing_options (cognitive 31) skills/ppt-master/scripts/pptx_animations.py:1513— pptx_animations._apply_timing_options has cognitive complexity 31 (threshold 15). Drivers by points: if/else 19 (26 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clone.clone_presentation_slides (cognitive 31) skills/ppt-master/scripts/pptx_ooxml/clone.py:736— clone.clone_presentation_slides has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 8 (11 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter.publish_staged_workspace (cognitive 31) skills/ppt-master/scripts/pptx_to_svg/converter.py:1239— converter.publish_staged_workspace has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 6, error handling 3 (6 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._write_roundtrip_manifest (cognitive 31) skills/ppt-master/scripts/pptx_to_svg/converter.py:1602— converter._write_roundtrip_manifest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 6, ternaries 4 (5 pts), loops 3 (4 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preset_shape_svg.main (cognitive 31) skills/ppt-master/scripts/preset_shape_svg.py:236— preset_shape_svg.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), error handling 3 (6 pts), ternaries 2 (4 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit.extract_references (cognitive 31) skills/ppt-master/scripts/prompt_audit.py:932— prompt_audit.extract_references has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 3 (6 pts), error handling 1 (4 pts), boolean chains 1 (nesting depth added 20). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doc_to_md._sanitize_epub_manifest (cognitive 31) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1315— doc_to_md._sanitize_epub_manifest has cognitive complexity 31 (threshold 15). Drivers by points: if/else 15 (22 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts), error handling 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
web_to_md.extract_metadata (cognitive 31) skills/ppt-master/scripts/source_to_md/web_to_md.py:797— web_to_md.extract_metadata has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 8, loops 3 (5 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flatten_tspan.main (cognitive 31) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:909— flatten_tspan.main has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (5 pts), ternaries 1 (4 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._text_width_diagnostic (cognitive 31) skills/ppt-master/scripts/svg_quality/checker.py:4129— SVGQualityChecker._text_width_diagnostic has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 6, ternaries 4 (5 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._nested_crop_clip_preset_geometry_error (cognitive 31) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3969— elements._nested_crop_clip_preset_geometry_error has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 10, ternaries 2 (6 pts), error handling 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.
paths._parse_svg_path_tokens (cognitive 31) skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:186— paths._parse_svg_path_tokens has cognitive complexity 31 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
theme_fonts.apply_master_text_style_spec (cognitive 31) skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py:410— theme_fonts.apply_master_text_style_spec has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 5 (10 pts), error handling 2 (4 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_omml._validate_drawing_element (cognitive 31) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:709— formula_omml._validate_drawing_element has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (23 pts), boolean chains 6, loops 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._source_resource_audit (cognitive 31) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1174— cli._source_resource_audit has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 4 (8 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure.load_template_source_themes (cognitive 31) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:580— template_structure.load_template_source_themes has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, error handling 3 (5 pts), loops 1, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_boolean._validate_geometry_presentation (cognitive 31) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:411— shape_boolean._validate_geometry_presentation has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.initStage2State (cognitive 31) skills/ppt-master/scripts/confirm_ui/static/app.js:4073— app.initStage2State has cognitive complexity 31 (threshold 15). Drivers by points: boolean chains 17, if/else 12, ternaries 2. Of this number, 28 points are the body's own statements and 3 belong to one function literal inside it that branches. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
apply_template._plan (cognitive 30) skills/ppt-master/scripts/apply_template.py:312— apply_template._plan has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 5 (10 pts), boolean chains 3, 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.
beautify_identity._sample_observed (cognitive 30) skills/ppt-master/scripts/beautify_identity.py:163— beautify_identity._sample_observed has cognitive complexity 30 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 5 (10 pts), boolean chains 3, ternaries 1 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
beautify_inventory.main (cognitive 30) skills/ppt-master/scripts/beautify_inventory.py:366— beautify_inventory.main has cognitive complexity 30 (threshold 15). Drivers by points: if/else 16 (19 pts), boolean chains 8, ternaries 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
server._build_template_library (cognitive 30) skills/ppt-master/scripts/confirm_ui/server.py:381— server._build_template_library has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (27 pts), loops 2 (3 pts) (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract_svg_pictures._run (cognitive 30) skills/ppt-master/scripts/extract_svg_pictures.py:890— extract_svg_pictures._run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 5, loops 3 (4 pts), ternaries 4, error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
slideshow.custom_show_problems (cognitive 30) skills/ppt-master/scripts/pptx_ooxml/slideshow.py:43— slideshow.custom_show_problems has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 3 (5 pts), ternaries 1 (4 pts), error handling 2 (3 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._pie_visual_styles (cognitive 30) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:909— chart_to_svg._pie_visual_styles has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 5 (9 pts), boolean chains 6, error handling 1 (2 pts), loops 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preset_authoring._validate_style (cognitive 30) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:690— preset_authoring._validate_style has cognitive complexity 30 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 5, loops 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
txbody_to_svg._build_run (cognitive 30) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:842— txbody_to_svg._build_run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (22 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ppt_to_md._category_chart_to_markdown (cognitive 30) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:818— ppt_to_md._category_chart_to_markdown has cognitive complexity 30 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 4 (9 pts), boolean chains 4, loops 3 (4 pts), error handling 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._validate_edit_attrs (cognitive 30) skills/ppt-master/scripts/svg_editor/server.py:297— server._validate_edit_attrs has cognitive complexity 30 (threshold 15). Drivers by points: if/else 12 (26 pts), boolean chains 3, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_contracts.check_forbidden_elements (cognitive 30) skills/ppt-master/scripts/svg_quality/svg_contracts.py:197— svg_contracts.check_forbidden_elements has cognitive complexity 30 (threshold 15). Drivers by points: if/else 20 (22 pts), loops 2 (5 pts), boolean chains 2, 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, 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.
svg_contracts.check_paint_compatibility (cognitive 30) skills/ppt-master/scripts/svg_quality/svg_contracts.py:292— svg_contracts.check_paint_compatibility has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 2 (7 pts), ternaries 1 (4 pts), boolean chains 3, loops 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_style._chart_companion_shapes (cognitive 30) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1578— chart_style._chart_companion_shapes has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 8, ternaries 3 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_xml._axis_pair_xml (cognitive 30) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:931— chart_xml._axis_pair_xml has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 20 (22 pts), if/else 5, boolean chains 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_LatexParser._parse_sequence (cognitive 30) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:472— _LatexParser._parse_sequence has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (24 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._roundtrip_animation_config_for_pages (cognitive 30) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:241— cli._roundtrip_animation_config_for_pages has cognitive complexity 30 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 3 (13 pts), boolean chains 3, loops 1 (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
text_measure._run_calibrate (cognitive 30) skills/ppt-master/scripts/text_measure.py:740— text_measure._run_calibrate has cognitive complexity 30 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 5, error handling 2 (3 pts), ternaries 3, loops 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
app.initRubberBand (cognitive 30) REDACTED:1346— app.initRubberBand has cognitive complexity 30 (threshold 15). Drivers by points: if/else 21 (26 pts), boolean chains 4 (nesting depth added 5). None of this is in the body itself: all 30 points belong to 5 function literals inside it that branch (lines 1418, 1371, 1473, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
apply_template._write (cognitive 29) skills/ppt-master/scripts/apply_template.py:508— apply_template._write has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 6 (8 pts), error handling 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_gemini._generate_image (cognitive 29) skills/ppt-master/scripts/image_backends/backend_gemini.py:152— backend_gemini._generate_image has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 5 (11 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.
mirror_template_materialize._slot_wrapper (cognitive 29) skills/ppt-master/scripts/mirror_template_materialize.py:2216— mirror_template_materialize._slot_wrapper has cognitive complexity 29 (threshold 15). Drivers by points: if/else 14 (21 pts), loops 2 (4 pts), boolean chains 3, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_to_svg.main (cognitive 29) skills/ppt-master/scripts/pptx_to_svg.py:151— pptx_to_svg.main has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 3 (8 pts), loops 2 (4 pts), boolean chains 2, 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.
chart_to_svg._source_chart_text_style (cognitive 29) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2668— chart_to_svg._source_chart_text_style has cognitive complexity 29 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (6 pts), boolean chains 3, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_walker._walk_container (cognitive 29) skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:250— shape_walker._walk_container has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), boolean chains 4, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tbl_to_svg._convert_cell_text (cognitive 29) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1682— tbl_to_svg._convert_cell_text has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3 (6 pts), boolean chains 4, error handling 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doc_to_md._convert_docx (cognitive 29) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1035— doc_to_md._convert_docx has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (17 pts), error handling 4 (7 pts), loops 4, boolean chains 1 (nesting depth added 7). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
excel_to_md._content_bounds (cognitive 29) skills/ppt-master/scripts/source_to_md/excel_to_md.py:171— excel_to_md._content_bounds has cognitive complexity 29 (threshold 15). Drivers by points: ternaries 8 (20 pts), if/else 2 (4 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._imported_model_text_lines (cognitive 29) skills/ppt-master/scripts/svg_quality/checker.py:3866— SVGQualityChecker._imported_model_text_lines has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 6, ternaries 2 (5 pts), error handling 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_pattern_fills (cognitive 29) skills/ppt-master/scripts/svg_quality/checker.py:5944— SVGQualityChecker._check_pattern_fills has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 6, error handling 1 (3 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._valid_emf_payload (cognitive 29) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:158— elements._valid_emf_payload has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 10, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.parse_svg_color (cognitive 29) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1715— utils.parse_svg_color has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 2 (6 pts), ternaries 2 (6 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
table._table_cell_paragraphs (cognitive 29) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:227— table._table_cell_paragraphs has cognitive complexity 29 (threshold 15). Drivers by points: if/else 13 (25 pts), boolean chains 3, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_measure._lexical_units (cognitive 29) skills/ppt-master/scripts/text_measure.py:194— text_measure._lexical_units has cognitive complexity 29 (threshold 15). Drivers by points: if/else 5 (16 pts), loops 3 (6 pts), boolean chains 5, ternaries 1 (2 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.normTypography (cognitive 29) skills/ppt-master/scripts/confirm_ui/static/app.js:1812— app.normTypography has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 19, ternaries 6 (10 pts) (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
app.renderColor (cognitive 29) skills/ppt-master/scripts/confirm_ui/static/app.js:2839— app.renderColor has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 15, if/else 13 (14 pts) (nesting depth added 1). Most of this is not in the body itself: 9 of the 29 points are its own statements and the rest belongs to 9 function items inside it that branch (a function literal at line 2932, a function literal at line 2854, selectCard, …). The named helpers are already separate functions; the literals' work cannot be called, reviewed or tested from outside this body. To reduce it, move the named helpers out of the body to the enclosing scope and lift each literal's work into a named function there, so each is measured, reviewed and tested on its own, and reduce whichever one then reads as the largest.
mirror_template_materialize._rewrite_packaged_assets (cognitive 28) skills/ppt-master/scripts/mirror_template_materialize.py:2686— mirror_template_materialize._rewrite_packaged_assets has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 2 (8 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations._timing_summary (cognitive 28) skills/ppt-master/scripts/pptx_animations.py:2504— pptx_animations._timing_summary has cognitive complexity 28 (threshold 15). Drivers by points: if/else 18 (24 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._resolved_solid_fill (cognitive 28) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:680— chart_to_svg._resolved_solid_fill has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 6, error handling 2 (4 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chartex_to_svg._payload_from_chartex_xml (cognitive 28) skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py:93— chartex_to_svg._payload_from_chartex_xml has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (25 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slide_to_svg._convert_graphic_fallback (cognitive 28) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1767— slide_to_svg._convert_graphic_fallback has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (18 pts), ternaries 4 (8 pts), error handling 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_batch.run_path_batch (cognitive 28) skills/ppt-master/scripts/source_to_md/_batch.py:102— _batch.run_path_batch has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (7 pts), boolean chains 4, error handling 1 (2 pts), ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
web_to_md._curl_http_get (cognitive 28) skills/ppt-master/scripts/source_to_md/web_to_md.py:260— web_to_md._curl_http_get has cognitive complexity 28 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 3 (9 pts), loops 3 (6 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config._declared_animation_sounds (cognitive 28) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1425— animation_config._declared_animation_sounds has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (6 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._resolve_clip_geometry (cognitive 28) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4217— elements._resolve_clip_geometry has cognitive complexity 28 (threshold 15). Drivers by points: if/else 14 (19 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_style._native_chart_export_payload (cognitive 28) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:591— chart_style._native_chart_export_payload has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 6 (12 pts), boolean chains 3, ternaries 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.
builder._renumber_roundtrip_generated_shapes (cognitive 28) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1634— builder._renumber_roundtrip_generated_shapes has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 7 (14 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._placeholder_text_body (cognitive 28) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3838— builder._placeholder_text_body has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 9 (11 pts), boolean chains 3, error handling 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.
app.renderDesignDirections (cognitive 28) skills/ppt-master/scripts/confirm_ui/static/app.js:2277— app.renderDesignDirections has cognitive complexity 28 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 12 (nesting depth added 1). Most of this is not in the body itself: 4 of the 28 points are its own statements and the rest belongs to 4 function literals inside it that branch (lines 2284, 2333, 2352, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
pptx_animations._select_supported_timing_branch (cognitive 27) skills/ppt-master/scripts/pptx_animations.py:2998— pptx_animations._select_supported_timing_branch has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_delivery_check._content_type_maps (cognitive 27) skills/ppt-master/scripts/pptx_delivery_check.py:160— pptx_delivery_check._content_type_maps has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 7, error handling 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_embedded_fonts._font_relationship_ids (cognitive 27) skills/ppt-master/scripts/pptx_embedded_fonts.py:58— pptx_embedded_fonts._font_relationship_ids has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clone._remap_reachable_shared_layer_slide_jumps (cognitive 27) skills/ppt-master/scripts/pptx_ooxml/clone.py:411— clone._remap_reachable_shared_layer_slide_jumps has cognitive complexity 27 (threshold 15). Drivers by points: if/else 8 (20 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._apply_plot_data_labels (cognitive 27) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2090— chart_to_svg._apply_plot_data_labels has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 6, error handling 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pic_to_svg.convert_blip_fill (cognitive 27) skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py:88— pic_to_svg.convert_blip_fill has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view.adopt_authoring_object (cognitive 27) skills/ppt-master/scripts/svg_authoring_view.py:2236— svg_authoring_view.adopt_authoring_object has cognitive complexity 27 (threshold 15). Drivers by points: if/else 17 (20 pts), boolean chains 4, error handling 2 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
SVGQualityChecker._check_icon_placeholders (cognitive 27) skills/ppt-master/scripts/svg_quality/checker.py:5401— SVGQualityChecker._check_icon_placeholders has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (14 pts), ternaries 2 (6 pts), error handling 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._geometry_trace_metadata (cognitive 27) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1758— converter._geometry_trace_metadata has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (18 pts), boolean chains 7, ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_parser._expand_macros (cognitive 27) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:311— formula_parser._expand_macros has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (17 pts), loops 4 (9 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._merge_roundtrip_relationships (cognitive 27) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1225— builder._merge_roundtrip_relationships has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 5 (8 pts), boolean chains 1, error handling 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._native_object_preflight_findings (cognitive 27) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1773— cli._native_object_preflight_findings has cognitive complexity 27 (threshold 15). Drivers by points: if/else 4 (14 pts), loops 3 (6 pts), error handling 2 (5 pts), boolean chains 2 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.renderDirectionComponentCandidates (cognitive 27) skills/ppt-master/scripts/confirm_ui/static/app.js:2472— app.renderDirectionComponentCandidates has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 3 (8 pts), boolean chains 7 (nesting depth added 8). Most of this is not in the body itself: 1 of the 27 points is its own statement and the rest belongs to 4 function literals inside it that branch (lines 2532, 2481, 2473, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
extract_svg_assets._load_reusable_assets (cognitive 26) skills/ppt-master/scripts/extract_svg_assets.py:676— extract_svg_assets._load_reusable_assets has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 3 (4 pts), boolean chains 3, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._load_vector_assets (cognitive 26) skills/ppt-master/scripts/mirror_template_materialize.py:758— mirror_template_materialize._load_vector_assets has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (23 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._flatten_fixed_group (cognitive 26) skills/ppt-master/scripts/mirror_template_materialize.py:1524— mirror_template_materialize._flatten_fixed_group has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (18 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_import._normalize_colors (cognitive 26) skills/ppt-master/scripts/pptx_to_svg/formula_import.py:154— formula_import._normalize_colors has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slide_to_svg._wrap_shape_group (cognitive 26) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2462— slide_to_svg._wrap_shape_group has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (17 pts), boolean chains 6, ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tbl_to_svg._cell_rich_paragraph_payloads (cognitive 26) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1481— tbl_to_svg._cell_rich_paragraph_payloads has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (17 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit.find_near_duplicates (cognitive 26) skills/ppt-master/scripts/prompt_audit.py:848— prompt_audit.find_near_duplicates has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (10 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
sound_sync.sync_sounds (cognitive 26) skills/ppt-master/scripts/sound_sync.py:126— sound_sync.sync_sounds has cognitive complexity 26 (threshold 15). Drivers by points: if/else 12 (23 pts), loops 2, 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.
pdf_to_md.analyze_font_sizes (cognitive 26) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:53— pdf_to_md.analyze_font_sizes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 4 (12 pts) (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pdf_to_md._extend_ruled_table (cognitive 26) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1057— pdf_to_md._extend_ruled_table has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 5, loops 3, ternaries 2, error handling 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.
web_to_md.main (cognitive 26) skills/ppt-master/scripts/source_to_md/web_to_md.py:1542— web_to_md.main has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (19 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
embed_images._optimize_image_bytes (cognitive 26) skills/ppt-master/scripts/svg_finalize/embed_images.py:77— embed_images._optimize_image_bytes has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 5, error handling 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.
checker._parse_placeholders_fallback (cognitive 26) skills/ppt-master/scripts/svg_quality/checker.py:1065— checker._parse_placeholders_fallback has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 1, loops 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements.project_image_errors (cognitive 26) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:416— elements.project_image_errors has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (15 pts), error handling 3 (7 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements.convert_image (cognitive 26) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4952— elements.convert_image has cognitive complexity 26 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 10 (12 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._replace_roundtrip_transition_advance (cognitive 26) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1364— builder._replace_roundtrip_transition_advance has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 2 (3 pts), boolean chains 2, ternaries 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure._validate_template_slide_contracts (cognitive 26) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1945— template_structure._validate_template_slide_contracts has cognitive complexity 26 (threshold 15). Drivers by points: if/else 6 (18 pts), loops 6 (8 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip._load_current_assets (cognitive 25) skills/ppt-master/scripts/authoring_roundtrip.py:789— authoring_roundtrip._load_current_assets has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (20 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._read_template_options_input (cognitive 25) skills/ppt-master/scripts/confirm_ui/server.py:310— server._read_template_options_input has cognitive complexity 25 (threshold 15). Drivers by points: if/else 13 (17 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
server._submission_stage_error (cognitive 25) skills/ppt-master/scripts/confirm_ui/server.py:1616— server._submission_stage_error has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), ternaries 4 (7 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_gen.render_manifest_md (cognitive 25) skills/ppt-master/scripts/image_gen.py:1148— image_gen.render_manifest_md has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_embedded_fonts.load_embedded_font_bundle (cognitive 25) skills/ppt-master/scripts/pptx_embedded_fonts.py:282— pptx_embedded_fonts.load_embedded_font_bundle has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 6, error handling 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clone._clone_part_private_deps (cognitive 25) skills/ppt-master/scripts/pptx_ooxml/clone.py:138— clone._clone_part_private_deps has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (18 pts), error handling 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fill_to_svg._resolve_grad_fill (cognitive 25) skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py:183— fill_to_svg._resolve_grad_fill has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, ternaries 3 (4 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula_import._preview_node (cognitive 25) skills/ppt-master/scripts/pptx_to_svg/formula_import.py:533— formula_import._preview_node has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18, ternaries 3 (6 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
normalized_chart_svg._render_combo (cognitive 25) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:305— normalized_chart_svg._render_combo has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 10, ternaries 2, 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.
preset_authoring.render_preset_shape_fragment (cognitive 25) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:83— preset_authoring.render_preset_shape_fragment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), boolean chains 6, 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.
pdf_to_md.merge_adjacent_headings (cognitive 25) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:391— pdf_to_md.merge_adjacent_headings has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pdf_to_md._find_captioned_vector_figures (cognitive 25) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:644— pdf_to_md._find_captioned_vector_figures has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
web_to_md.process_url (cognitive 25) skills/ppt-master/scripts/source_to_md/web_to_md.py:1391— web_to_md.process_url has cognitive complexity 25 (threshold 15). Drivers by points: if/else 18 (20 pts), boolean chains 2, ternaries 2, error handling 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
svg_authoring_view._normalize_semantic_text_lines (cognitive 25) skills/ppt-master/scripts/svg_authoring_view.py:692— svg_authoring_view._normalize_semantic_text_lines has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 5 (7 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._print_anchor_value_summary (cognitive 25) skills/ppt-master/scripts/svg_quality/checker.py:10024— SVGQualityChecker._print_anchor_value_summary has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 3 (10 pts), if/else 5 (7 pts), loops 3 (7 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_contracts.check_font_size_values (cognitive 25) skills/ppt-master/scripts/svg_quality/svg_contracts.py:1060— svg_contracts.check_font_size_values has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (10 pts), ternaries 3 (6 pts), error handling 2 (5 pts), loops 3, boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config._animation_effect_entry_errors (cognitive 25) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1212— animation_config._animation_effect_entry_errors has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LatexParser._parse_owned_body (cognitive 25) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1042— _LatexParser._parse_owned_body has cognitive complexity 25 (threshold 15). Drivers by points: loops 6 (13 pts), if/else 9 (11 pts), boolean chains 1 (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
_LatexParser._parse_environment (cognitive 25) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1486— _LatexParser._parse_environment has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
marker_common._element_local_bbox (cognitive 25) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:442— marker_common._element_local_bbox has cognitive complexity 25 (threshold 15). Drivers by points: if/else 14 (17 pts), boolean chains 4, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
marker_common._fallback_shape_records (cognitive 25) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:557— marker_common._fallback_shape_records has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 6 (9 pts), boolean chains 5, 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.
builder._apply_preserved_structure (cognitive 25) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4409— builder._apply_preserved_structure has cognitive complexity 25 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (5 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
discovery.find_notes_files (cognitive 25) skills/ppt-master/scripts/svg_to_pptx/pptx_package/discovery.py:61— discovery.find_notes_files has cognitive complexity 25 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (4 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.loadSlides (cognitive 25) REDACTED:620— app.loadSlides has cognitive complexity 25 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 6, ternaries 2 (5 pts) (nesting depth added 6). None of this is in the body itself: all 25 points belong to 2 function literals inside it that branch (lines 623, 648). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
app.selectSlide (cognitive 25) REDACTED:723— app.selectSlide has cognitive complexity 25 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 8, loops 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 2 of the 25 points are its own statements and the rest belongs to 3 function literals inside it that branch (lines 749, 807, 833). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
compact_svg_styles._remove_redundant_inherited_styles (cognitive 24) skills/ppt-master/scripts/compact_svg_styles.py:422— compact_svg_styles._remove_redundant_inherited_styles has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), boolean chains 3, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_search._search_one_item (cognitive 24) skills/ppt-master/scripts/image_search.py:2000— image_search._search_one_item has cognitive complexity 24 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), ternaries 4 (6 pts), error handling 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_animations._normalize_target_mapping (cognitive 24) skills/ppt-master/scripts/pptx_animations.py:850— pptx_animations._normalize_target_mapping has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (10 pts), ternaries 9, boolean chains 5 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
PresetShapeSemantics._normalize_group (cognitive 24) skills/ppt-master/scripts/pptx_shapes/semantics.py:271— PresetShapeSemantics._normalize_group has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 4 (7 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.
fill_to_svg._pattern_foreground (cognitive 24) skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py:716— fill_to_svg._pattern_foreground has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 5 (8 pts), error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
formula_import._serialize_run (cognitive 24) skills/ppt-master/scripts/pptx_to_svg/formula_import.py:422— formula_import._serialize_run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 6, ternaries 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pic_to_svg._apply_blip_image_effects (cognitive 24) skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py:523— pic_to_svg._apply_blip_image_effects has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, error handling 2 (3 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
shape_walker._build_placeholder_xfrm_table (cognitive 24) skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:435— shape_walker._build_placeholder_xfrm_table has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_transitions._transition_sound_elements (cognitive 24) skills/ppt-master/scripts/pptx_transitions.py:2480— pptx_transitions._transition_sound_elements has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (14 pts), loops 4 (10 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit.render_text (cognitive 24) skills/ppt-master/scripts/prompt_audit.py:2219— prompt_audit.render_text has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 6 (9 pts), ternaries 2 (4 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.
svg_authoring_contract.canonical_authoring_errors (cognitive 24) skills/ppt-master/scripts/svg_authoring_contract.py:284— svg_authoring_contract.canonical_authoring_errors has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (17 pts), boolean chains 6, 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.
SVGQualityChecker._extract_image_resource_rows (cognitive 24) skills/ppt-master/scripts/svg_quality/checker.py:8183— SVGQualityChecker._extract_image_resource_rows has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter.convert_element (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1869— converter.convert_element has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
theme_fonts.infer_master_text_style_spec (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py:107— theme_fonts.infer_master_text_style_spec has cognitive complexity 24 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 pts), ternaries 3 (5 pts), error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._chart_data_labels (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:108— chart_data._chart_data_labels has cognitive complexity 24 (threshold 15). Drivers by points: if/else 12 (17 pts), boolean chains 6, 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.
formula_ast.merge_run_styles (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:429— formula_ast.merge_run_styles has cognitive complexity 24 (threshold 15). Drivers by points: ternaries 14 (21 pts), if/else 3 (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.
table._native_table_fill_warnings (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1045— table._native_table_fill_warnings has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 7, ternaries 2 (4 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._set_placeholder_theme_font_role (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3966— builder._set_placeholder_theme_font_role has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure.match_native_placeholders (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:3571— template_structure.match_native_placeholders has cognitive complexity 24 (threshold 15). Drivers by points: if/else 4 (13 pts), loops 3 (6 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LocalUseExpander._materialize_use (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/use_expander.py:243— _LocalUseExpander._materialize_use has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (18 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
_LocalUseExpander._validate_fragment_reference_syntax (cognitive 24) skills/ppt-master/scripts/svg_to_pptx/use_expander.py:351— _LocalUseExpander._validate_fragment_reference_syntax has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 3 (6 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_preview_pptx._write_review_svg (cognitive 24) skills/ppt-master/scripts/template_preview_pptx.py:79— template_preview_pptx._write_review_svg has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip._prune_unreferenced_definitions (cognitive 23) skills/ppt-master/scripts/authoring_roundtrip.py:1373— authoring_roundtrip._prune_unreferenced_definitions has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, loops 4 (5 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip._merge_defs (cognitive 23) skills/ppt-master/scripts/authoring_roundtrip.py:1423— authoring_roundtrip._merge_defs has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 3 (8 pts), boolean chains 4, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._typography_error (cognitive 23) skills/ppt-master/scripts/confirm_ui/server.py:1368— server._typography_error has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 3 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._build_session_state (cognitive 23) skills/ppt-master/scripts/confirm_ui/server.py:1807— server._build_session_state has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (8 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
finalize_svg._publish_candidate_directory (cognitive 23) skills/ppt-master/scripts/finalize_svg.py:128— finalize_svg._publish_candidate_directory has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (5 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_delivery_check._relationship_inventory (cognitive 23) skills/ppt-master/scripts/pptx_delivery_check.py:341— pptx_delivery_check._relationship_inventory has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
formula._apply_operator (cognitive 23) skills/ppt-master/scripts/pptx_shapes/formula.py:291— formula._apply_operator has cognitive complexity 23 (threshold 15). Drivers by points: if/else 17, ternaries 3 (6 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
animation_import.read_animation_config (cognitive 23) skills/ppt-master/scripts/pptx_to_svg/animation_import.py:64— animation_import.read_animation_config has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (13 pts), error handling 3 (4 pts), ternaries 2 (3 pts), loops 2, 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.
chart_to_svg._point_data_label_payload (cognitive 23) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2730— chart_to_svg._point_data_label_payload has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 6, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalized_chart_svg._category_segments (cognitive 23) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:480— normalized_chart_svg._category_segments has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 3 (9 pts), loops 4 (8 pts), if/else 4 (6 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalized_chart_svg._render_pie (cognitive 23) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:704— normalized_chart_svg._render_pie has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 6, ternaries 3 (5 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slide_to_svg._build_geometry_xml (cognitive 23) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1217— slide_to_svg._build_geometry_xml has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (16 pts), error handling 4, boolean chains 1, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
tbl_to_svg._native_run_payload (cognitive 23) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1380— tbl_to_svg._native_run_payload has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
txbody_to_svg.convert_vertical_txbody (cognitive 23) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:273— txbody_to_svg.convert_vertical_txbody has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5, loops 3 (4 pts), ternaries 1 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit.run_audit (cognitive 23) skills/ppt-master/scripts/prompt_audit.py:2006— prompt_audit.run_audit has cognitive complexity 23 (threshold 15). Drivers by points: if/else 11 (15 pts), boolean chains 4, loops 3, 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.
doc_to_md._docx_inject_charts_markdown (cognitive 23) skills/ppt-master/scripts/source_to_md/doc_to_md.py:943— doc_to_md._docx_inject_charts_markdown has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (5 pts), error handling 3 (4 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_viewbox (cognitive 23) skills/ppt-master/scripts/svg_quality/checker.py:2613— SVGQualityChecker._check_viewbox has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, error handling 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._carrier_image_receipt (cognitive 23) skills/ppt-master/scripts/svg_quality/checker.py:2996— SVGQualityChecker._carrier_image_receipt has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 10, if/else 4 (8 pts), error handling 1 (2 pts), ternaries 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._resolved_text_runs (cognitive 23) skills/ppt-master/scripts/svg_quality/checker.py:3371— SVGQualityChecker._resolved_text_runs has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (8 pts), loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_sourced_image_provenance (cognitive 23) skills/ppt-master/scripts/svg_quality/checker.py:9062— SVGQualityChecker._check_sourced_image_provenance has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 7, 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.
slot_capacity._text_targets (cognitive 23) skills/ppt-master/scripts/svg_quality/slot_capacity.py:82— slot_capacity._text_targets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 4, error handling 1 (2 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config.scan_svg_targets (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:257— animation_config.scan_svg_targets has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 5, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._build_source_shape_id_map (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1711— converter._build_source_shape_id_map has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._resolve_nested_svg_clip_geometry (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5493— elements._resolve_nested_svg_clip_geometry has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 8, ternaries 2 (4 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
paths._project_path_like_bounds (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:338— paths._project_path_like_bounds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (17 pts), ternaries 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_properties.project_text_property_diagnostics (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:709— text_properties.project_text_property_diagnostics has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (7 pts), boolean chains 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils._parse_transform_operations (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:749— utils._parse_transform_operations has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.parse_font_family (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3234— utils.parse_font_family has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 7, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native_objects._build_native_chart (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py:359— native_objects._build_native_chart has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (12 pts), ternaries 5 (6 pts), boolean chains 4, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
marker_common._fallback_text_records (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:694— marker_common._fallback_text_records has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (11 pts), ternaries 5 (7 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
table._validate_table_cell_formatting (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:597— table._validate_table_cell_formatting has cognitive complexity 23 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 4 (9 pts), boolean chains 2, ternaries 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.
table._table_fallback_grid (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:727— table._table_fallback_grid has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 6, loops 3, ternaries 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
narration.find_narration_files (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py:92— narration.find_narration_files has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 3, loops 2, ternaries 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.
template_structure.parse_optional_layout_slides (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2023— template_structure.parse_optional_layout_slides has cognitive complexity 23 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure._scope_visual_resources_signature (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2785— template_structure._scope_visual_resources_signature has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 5 (6 pts), boolean chains 2, ternaries 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_boolean._close_filled_commands (cognitive 23) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:879— shape_boolean._close_filled_commands has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.directionStateSignature (cognitive 23) skills/ppt-master/scripts/confirm_ui/static/app.js:1901— app.directionStateSignature has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 17, if/else 6. Of this number, 20 points are the body's own statements and 3 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
server._template_kind_from_spec (cognitive 22) skills/ppt-master/scripts/confirm_ui/server.py:246— server._template_kind_from_spec has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 4 (6 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_openai._edit_image (cognitive 22) skills/ppt-master/scripts/image_backends/backend_openai.py:590— backend_openai._edit_image has cognitive complexity 22 (threshold 15). Drivers by points: if/else 15 (17 pts), ternaries 4, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
provider_common.score_candidate (cognitive 22) skills/ppt-master/scripts/image_sources/provider_common.py:467— provider_common.score_candidate has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 7, 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.
provider_wikimedia.parse_results (cognitive 22) skills/ppt-master/scripts/image_sources/provider_wikimedia.py:91— provider_wikimedia.parse_results has cognitive complexity 22 (threshold 15). Drivers by points: boolean chains 13, if/else 4 (8 pts), loops 1 (nesting depth added 4). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
edit_safety._table_merge_topology (cognitive 22) skills/ppt-master/scripts/pptx_ooxml/edit_safety.py:251— edit_safety._table_merge_topology has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 6 (10 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.
PresetShapeSemantics.grouped (cognitive 22) skills/ppt-master/scripts/pptx_shapes/semantics.py:217— PresetShapeSemantics.grouped has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._annotate_roundtrip_slide_roots (cognitive 22) skills/ppt-master/scripts/pptx_to_svg/converter.py:389— converter._annotate_roundtrip_slide_roots has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, ternaries 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preset_authoring.materialize_compact_authored_preset_tree (cognitive 22) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:583— preset_authoring.materialize_compact_authored_preset_tree has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preset_authoring._validate_adjustments (cognitive 22) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:781— preset_authoring._validate_adjustments has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (15 pts), error handling 1 (3 pts), boolean chains 2, loops 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
txbody_to_svg.convert_txbody (cognitive 22) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:126— txbody_to_svg.convert_txbody has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 6, ternaries 4 (5 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
register_template._extract_entry (cognitive 22) skills/ppt-master/scripts/register_template.py:1155— register_template._extract_entry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6, ternaries 3 (4 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.
doc_to_md._convert_epub (cognitive 22) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1438— doc_to_md._convert_epub has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (4 pts), error handling 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.
embed_icons.process_svg_file (cognitive 22) skills/ppt-master/scripts/svg_finalize/embed_icons.py:492— embed_icons.process_svg_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (4 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flatten_tspan._emit_mergeable_paragraph (cognitive 22) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:488— flatten_tspan._emit_mergeable_paragraph has cognitive complexity 22 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (8 pts), error handling 1 (2 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
SVGQualityChecker.check_file (cognitive 22) skills/ppt-master/scripts/svg_quality/checker.py:1268— SVGQualityChecker.check_file has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), ternaries 2 (4 pts), error handling 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.
SVGQualityChecker._classify_preserved_mirror_geometry (cognitive 22) skills/ppt-master/scripts/svg_quality/checker.py:1484— SVGQualityChecker._classify_preserved_mirror_geometry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, loops 3 (4 pts), error handling 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_text_output_geometry (cognitive 22) skills/ppt-master/scripts/svg_quality/checker.py:3538— SVGQualityChecker._check_text_output_geometry has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 3 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._print_result (cognitive 22) skills/ppt-master/scripts/svg_quality/checker.py:9551— SVGQualityChecker._print_result has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._valid_wmf_payload (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:224— elements._valid_wmf_payload has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_properties._diagnose_text_declaration (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:614— text_properties._diagnose_text_declaration has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
geometry_properties.materialize_inline_geometry_properties (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/geometry_properties.py:81— geometry_properties.materialize_inline_geometry_properties has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._xy_chart_data (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:1560— chart_data._xy_chart_data has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 6, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
table._table_padding_attrs (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1511— table._table_padding_attrs has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 5 (13 pts), if/else 3 (5 pts), boolean chains 3, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._extract_baseline_layout_families (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2764— builder._extract_baseline_layout_families has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 4 (8 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._prepare_flat_structure (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:5135— builder._prepare_flat_structure has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 5, ternaries 2 (3 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._prerender_legacy_pngs (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6237— builder._prerender_legacy_pngs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (9 pts), ternaries 2 (7 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._create_preserved_base_pptx (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6450— builder._create_preserved_base_pptx has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (13 pts), loops 3 (4 pts), boolean chains 3, error handling 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure._is_full_canvas_solid_rect (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:456— template_structure._is_full_canvas_solid_rect has cognitive complexity 22 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, error handling 3 (4 pts), ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
template_structure._scope_css_signature (cognitive 22) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2731— template_structure._scope_css_signature has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 4 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
video_sound_mix._publish_outputs (cognitive 22) skills/ppt-master/scripts/video_sound_mix.py:1069— video_sound_mix._publish_outputs has cognitive complexity 22 (threshold 15). Drivers by points: if/else 4 (8 pts), error handling 3 (7 pts), loops 5 (7 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
visualization_catalog.resolve_visualization_reference (cognitive 22) skills/ppt-master/scripts/visualization_catalog.py:262— visualization_catalog.resolve_visualization_reference has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 1, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
analyze_images.print_results (cognitive 21) skills/ppt-master/scripts/analyze_images.py:308— analyze_images.print_results has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (8 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_common.find_data_uri (cognitive 21) skills/ppt-master/scripts/image_backends/backend_common.py:194— backend_common.find_data_uri has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (15 pts), ternaries 1 (4 pts), loops 1 (2 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_search._commit_staged_image (cognitive 21) skills/ppt-master/scripts/image_search.py:668— image_search._commit_staged_image has cognitive complexity 21 (threshold 15). Drivers by points: error handling 5 (10 pts), if/else 6 (10 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
latex_render._process_item (cognitive 21) skills/ppt-master/scripts/latex_render.py:408— latex_render._process_item has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 7, error handling 1, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
mirror_template_materialize._namespace_ids (cognitive 21) skills/ppt-master/scripts/mirror_template_materialize.py:1391— mirror_template_materialize._namespace_ids has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._visible_leaf (cognitive 21) skills/ppt-master/scripts/mirror_template_materialize.py:1458— mirror_template_materialize._visible_leaf has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 1 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clone._validate_internal_relationship_targets (cognitive 21) skills/ppt-master/scripts/pptx_ooxml/clone.py:523— clone._validate_internal_relationship_targets has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
diagram_read.smartart_to_markdown (cognitive 21) skills/ppt-master/scripts/pptx_ooxml/diagram_read.py:528— diagram_read.smartart_to_markdown has cognitive complexity 21 (threshold 15). Drivers by points: boolean chains 9, if/else 7 (9 pts), loops 1 (2 pts), ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
chart_to_svg._resolved_shape_paint (cognitive 21) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:783— chart_to_svg._resolved_shape_paint has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 3, loops 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.
chart_to_svg._data_labels_payload (cognitive 21) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2802— chart_to_svg._data_labels_payload has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
converter._managed_svg_paths (cognitive 21) skills/ppt-master/scripts/pptx_to_svg/converter.py:924— converter._managed_svg_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._referenced_local_paths (cognitive 21) skills/ppt-master/scripts/pptx_to_svg/converter.py:1110— converter._referenced_local_paths has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (11 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
normalized_chart_svg._render_category (cognitive 21) skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:201— normalized_chart_svg._render_category has cognitive complexity 21 (threshold 15). Drivers by points: ternaries 6 (10 pts), if/else 8, boolean chains 3 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
tbl_to_svg._native_table_payload (cognitive 21) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1203— tbl_to_svg._native_table_payload has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
project_utils.validate_outline_hyperlinks (cognitive 21) skills/ppt-master/scripts/project_utils.py:533— project_utils.validate_outline_hyperlinks has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ImageRotator.generate_contact_sheet (cognitive 21) skills/ppt-master/scripts/rotate_images.py:140— ImageRotator.generate_contact_sheet has cognitive complexity 21 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 2 (3 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
sound_sync._load_sounds (cognitive 21) skills/ppt-master/scripts/sound_sync.py:58— sound_sync._load_sounds has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 2, error handling 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pdf_to_md.should_keep_image (cognitive 21) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:498— pdf_to_md.should_keep_image has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 9, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
pdf_to_md.detect_vector_figure_rects (cognitive 21) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:688— pdf_to_md.detect_vector_figure_rects has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 3, boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ppt_to_md._unexposed_chartex_markdown (cognitive 21) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:926— ppt_to_md._unexposed_chartex_markdown has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
stamp_native_fallbacks.main (cognitive 21) skills/ppt-master/scripts/stamp_native_fallbacks.py:301— stamp_native_fallbacks.main has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (5 pts), error handling 3 (4 pts), boolean chains 2, ternaries 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._compact_text_runs (cognitive 21) skills/ppt-master/scripts/svg_authoring_view.py:949— svg_authoring_view._compact_text_runs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._compact_semantic_tables (cognitive 21) skills/ppt-master/scripts/svg_authoring_view.py:1228— svg_authoring_view._compact_semantic_tables has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._rewrite_adopted_fragment_ids (cognitive 21) skills/ppt-master/scripts/svg_authoring_view.py:2037— svg_authoring_view._rewrite_adopted_fragment_ids has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
annotations.promote_tspan_to_text (cognitive 21) skills/ppt-master/scripts/svg_editor/annotations.py:150— annotations.promote_tspan_to_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, loops 2 (3 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
server._inline_icons (cognitive 21) skills/ppt-master/scripts/svg_editor/server.py:174— server._inline_icons has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (4 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
flatten_tspan._create_text_element_from_line (cognitive 21) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:766— flatten_tspan._create_text_element_from_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._check_fragmented_paragraph_text (cognitive 21) skills/ppt-master/scripts/svg_quality/checker.py:5039— SVGQualityChecker._check_fragmented_paragraph_text has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2, error handling 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._fixed_layer_group_errors (cognitive 21) skills/ppt-master/scripts/svg_quality/checker.py:7914— SVGQualityChecker._fixed_layer_group_errors has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (8 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.
SVGQualityChecker._carrier_receipt_summary (cognitive 21) skills/ppt-master/scripts/svg_quality/checker.py:9661— SVGQualityChecker._carrier_receipt_summary has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 2 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_contracts.check_opacity_values (cognitive 21) skills/ppt-master/scripts/svg_quality/svg_contracts.py:414— svg_contracts.check_opacity_values has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (11 pts), error handling 2 (4 pts), loops 3, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._convert_semantic_shape (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:847— converter._convert_semantic_shape has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 5, loops 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
elements.convert_line (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1631— elements.convert_line has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 3 (6 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.
elements._collect_inline_runs (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2753— elements._collect_inline_runs has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_properties.materialize_project_text_metrics (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:568— text_properties.materialize_project_text_metrics has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 2 (3 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._data_label_point_items (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:203— chart_data._data_label_point_items has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_style._fallback_bar_clusters (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:989— chart_style._fallback_bar_clusters has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, ternaries 4 (5 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LatexParser._parse_scripts (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:939— _LatexParser._parse_scripts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LatexParser._parse_environment_rows (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1600— _LatexParser._parse_environment_rows has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._prune_unused_slide_layouts (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4985— builder._prune_unused_slide_layouts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._materialize_slide_sound (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6105— builder._materialize_slide_sound has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 5, 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.
builder._install_source_embedded_fonts (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:6623— builder._install_source_embedded_fonts has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3, ternaries 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._report_roundtrip_omitted_opaque_payloads (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:685— cli._report_roundtrip_omitted_opaque_payloads has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 4, loops 2 (3 pts), 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.
template_validation._validate_unique_creation_ids (cognitive 21) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py:165— template_validation._validate_unique_creation_ids has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.fontScriptTokens (cognitive 21) skills/ppt-master/scripts/confirm_ui/static/app.js:1701— app.fontScriptTokens has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (16 pts), boolean chains 5 (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.
app.attachPropEditors::commitGeo (cognitive 21) REDACTED:2791— app.attachPropEditors::commitGeo has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, error handling 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.
backend_common.save_image_bytes (cognitive 20) skills/ppt-master/scripts/image_backends/backend_common.py:234— backend_common.save_image_bytes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5 (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.
mirror_template_materialize._publish_files (cognitive 20) skills/ppt-master/scripts/mirror_template_materialize.py:2876— mirror_template_materialize._publish_files has cognitive complexity 20 (threshold 15). Drivers by points: error handling 3 (7 pts), loops 5 (7 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_walker._build_placeholder_lst_style_table (cognitive 20) skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:474— shape_walker._build_placeholder_lst_style_table has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slide_to_svg._effective_placeholder_tx_body (cognitive 20) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:769— slide_to_svg._effective_placeholder_tx_body has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (5 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
tbl_to_svg._table_tx_style_run_props (cognitive 20) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:237— tbl_to_svg._table_tx_style_run_props has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
preset_shape_svg._render_batch_items (cognitive 20) skills/ppt-master/scripts/preset_shape_svg.py:451— preset_shape_svg._render_batch_items has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 pts), error handling 1 (2 pts), boolean chains 1, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProjectManager.init_project (cognitive 20) skills/ppt-master/scripts/project_management/cli.py:286— ProjectManager.init_project has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), ternaries 3 (4 pts), boolean chains 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
register_template._print_completion_card (cognitive 20) skills/ppt-master/scripts/register_template.py:1371— register_template._print_completion_card has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
web_to_md._decode_response_text (cognitive 20) skills/ppt-master/scripts/source_to_md/web_to_md.py:418— web_to_md._decode_response_text has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (7 pts), error handling 3 (6 pts), loops 4, boolean chains 3 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._materialize_adopted_context (cognitive 20) skills/ppt-master/scripts/svg_authoring_view.py:1960— svg_authoring_view._materialize_adopted_context has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (5 pts), boolean chains 3, error handling 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._image_crop_mechanisms (cognitive 20) skills/ppt-master/scripts/svg_quality/checker.py:8539— SVGQualityChecker._image_crop_mechanisms has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config._transition_scope_errors (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:750— animation_config._transition_scope_errors has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 3 (5 pts), boolean chains 3, 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.
chart_style._chart_projected_texts (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1258— chart_style._chart_projected_texts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 6 (7 pts), boolean chains 1, ternaries 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.
formula_omml._validate_matrix_dimensions (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py:862— formula_omml._validate_matrix_dimensions has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (5 pts), ternaries 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
table._table_cell_parity_style_gaps (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:869— table._table_cell_parity_style_gaps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._replace_roundtrip_motion (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1303— builder._replace_roundtrip_motion has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._remove_all_notes_parts (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2023— builder._remove_all_notes_parts has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._solid_background_xml_from_shape (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3291— builder._solid_background_xml_from_shape has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 6, error handling 1, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
narration.read_narration_start_delay_xml (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py:718— narration.read_narration_start_delay_xml has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 2, error handling 1 (2 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_outline._resolve_text_style (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/text_outline.py:457— text_outline._resolve_text_style has cognitive complexity 20 (threshold 15). Drivers by points: error handling 3 (7 pts), if/else 4 (7 pts), ternaries 1 (3 pts), boolean chains 2, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_outline._font_candidates (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/text_outline.py:757— text_outline._font_candidates has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 5 (9 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.
_LocalUseExpander._rewrite_clone_ids (cognitive 20) skills/ppt-master/scripts/svg_to_pptx/use_expander.py:402— _LocalUseExpander._rewrite_clone_ids has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (4 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_preview_pptx.main (cognitive 20) skills/ppt-master/scripts/template_preview_pptx.py:334— template_preview_pptx.main has cognitive complexity 20 (threshold 15). Drivers by points: if/else 13, boolean chains 4, ternaries 2, error handling 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
backend_elevenlabs._word_boundaries (cognitive 20) skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py:119— backend_elevenlabs._word_boundaries has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
visualization_recall._score_candidate (cognitive 20) skills/ppt-master/scripts/visualization_recall.py:111— visualization_recall._score_candidate has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.promoteTspanDom (cognitive 20) REDACTED:2512— app.promoteTspanDom has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 12, if/else 4, ternaries 3 (4 pts) (nesting depth added 1). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
beautify_identity._layout_text_sizes (cognitive 19) skills/ppt-master/scripts/beautify_identity.py:116— beautify_identity._layout_text_sizes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 2 (3 pts), ternaries 1 (3 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
beautify_inventory._frozen_strings (cognitive 19) skills/ppt-master/scripts/beautify_inventory.py:234— beautify_inventory._frozen_strings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 5 (6 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._build_template_options (cognitive 19) skills/ppt-master/scripts/confirm_ui/server.py:453— server._build_template_options has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (3 pts), ternaries 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_openai._generate_image (cognitive 19) skills/ppt-master/scripts/image_backends/backend_openai.py:492— backend_openai._generate_image has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), ternaries 3, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
backend_openrouter.generate (cognitive 19) skills/ppt-master/scripts/image_backends/backend_openrouter.py:167— backend_openrouter.generate has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._validate_source_ref_closure (cognitive 19) skills/ppt-master/scripts/mirror_template_materialize.py:867— mirror_template_materialize._validate_source_ref_closure has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 5 (7 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
narration_sync._merge_subtitles_result (cognitive 19) skills/ppt-master/scripts/narration_sync.py:1850— narration_sync._merge_subtitles_result has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 4, loops 2 (3 pts), boolean chains 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_effects.project_effect_status_errors (cognitive 19) skills/ppt-master/scripts/pptx_effects.py:42— pptx_effects.project_effect_status_errors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, error handling 1 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
PackagePartRegistry.register (cognitive 19) skills/ppt-master/scripts/pptx_ooxml/package.py:73— PackagePartRegistry.register has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 6, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
package.unreferenced_slide_relationships (cognitive 19) skills/ppt-master/scripts/pptx_ooxml/package.py:109— package.unreferenced_slide_relationships has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 4, error handling 2 (4 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slideshow.reset_slide_show_selection (cognitive 19) skills/ppt-master/scripts/pptx_ooxml/slideshow.py:18— slideshow.reset_slide_show_selection has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (11 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ColorPalette._load_scheme (cognitive 19) skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:302— ColorPalette._load_scheme has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 6, error handling 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._overlay_staged_tree (cognitive 19) skills/ppt-master/scripts/pptx_to_svg/converter.py:1206— converter._overlay_staged_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 3, loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OoxmlPackage.iter_all_layouts_with_parent (cognitive 19) skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:480— OoxmlPackage.iter_all_layouts_with_parent has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 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.
preset_authoring.validate_authored_preset_tree (cognitive 19) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:528— preset_authoring.validate_authored_preset_tree has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, loops 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slide_to_svg._clip_blip_image (cognitive 19) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1425— slide_to_svg._clip_blip_image has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, error handling 1 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
semantic_table._iter_cells (cognitive 19) skills/ppt-master/scripts/semantic_table.py:305— semantic_table._iter_cells has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 3 (7 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
semantic_table.compact_semantic_table_payload (cognitive 19) skills/ppt-master/scripts/semantic_table.py:454— semantic_table.compact_semantic_table_payload has cognitive complexity 19 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 3, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
web_to_md.element_to_markdown (cognitive 19) skills/ppt-master/scripts/source_to_md/web_to_md.py:945— web_to_md.element_to_markdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (12 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._load_authoring_summary_manifest (cognitive 19) skills/ppt-master/scripts/svg_authoring_view.py:1635— svg_authoring_view._load_authoring_summary_manifest has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), error handling 3 (4 pts), boolean chains 2, ternaries 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._publish_existing_directory (cognitive 19) skills/ppt-master/scripts/svg_authoring_view.py:2471— svg_authoring_view._publish_existing_directory has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4, boolean chains 2, error handling 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.
flatten_tspan.nested_positional_tspan_errors (cognitive 19) skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:229— flatten_tspan.nested_positional_tspan_errors has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (11 pts), loops 3 (6 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.
SVGQualityChecker._check_pptx_structure_metadata (cognitive 19) skills/ppt-master/scripts/svg_quality/checker.py:6220— SVGQualityChecker._check_pptx_structure_metadata has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._configure_prototype_context (cognitive 19) skills/ppt-master/scripts/svg_quality/checker.py:7193— SVGQualityChecker._configure_prototype_context has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 2, loops 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._extract_spec_roster (cognitive 19) skills/ppt-master/scripts/svg_quality/checker.py:9438— SVGQualityChecker._extract_spec_roster has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config.resolve_slide_svg_files (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:364— animation_config.resolve_slide_svg_files has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 2, 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.
converter._require_native_marker_attributes (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:152— converter._require_native_marker_attributes has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
converter._roundtrip_graphic_frame (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1094— converter._roundtrip_graphic_frame has cognitive complexity 19 (threshold 15). Drivers by points: if/else 11, boolean chains 6, error handling 2. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
text_baseline.drawingml_text_baseline_offset (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/text_baseline.py:67— text_baseline.drawingml_text_baseline_offset has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 3 (6 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.iter_project_opacities (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1578— utils.iter_project_opacities has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (utils.iter_project_paints) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
utils.iter_project_paints (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1811— utils.iter_project_paints has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body. This shape REPEATS in the file: one other method here (utils.iter_project_opacities) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
chart_style._native_chart_category_order_warnings (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:945— chart_style._native_chart_category_order_warnings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9, ternaries 4 (6 pts), boolean chains 4 (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.
table._table_text_run (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:45— table._table_text_run has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 12, boolean chains 4, if/else 3. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
table._native_table_inset_graphic_warnings (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1188— table._native_table_inset_graphic_warnings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workbook._minimal_category_chart_workbook (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py:129— workbook._minimal_category_chart_workbook has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (17 pts), boolean chains 1, if/else 1 (nesting depth added 11). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
builder._promote_common_slide_backgrounds_to_masters (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:439— builder._promote_common_slide_backgrounds_to_masters has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 4 (6 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._slide_animation_settings (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:5765— builder._slide_animation_settings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 4 (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.
cli._opaque_roundtrip_slide_dependencies (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:750— cli._opaque_roundtrip_slide_dependencies has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 5, loops 2 (3 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._write_postflight_report (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1410— cli._write_postflight_report has cognitive complexity 19 (threshold 15). Drivers by points: ternaries 11, if/else 4, boolean chains 3, error handling 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
template_structure.template_placeholder_bindings (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:385— template_structure.template_placeholder_bindings has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (5 pts), boolean chains 2, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_outline.text_element_to_path_commands (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/text_outline.py:204— text_outline.text_element_to_path_commands has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
use_expander._symbol_viewport_transform (cognitive 19) skills/ppt-master/scripts/svg_to_pptx/use_expander.py:140— use_expander._symbol_viewport_transform has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, ternaries 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_measure._roles_from_spec_lock (cognitive 19) skills/ppt-master/scripts/text_measure.py:390— text_measure._roles_from_spec_lock has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 3, ternaries 1 (3 pts), error handling 1 (2 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_edge._hard_split_span (cognitive 19) skills/ppt-master/scripts/tts_backends/backend_edge.py:216— backend_edge._hard_split_span has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (17 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
visualization_catalog._load_family (cognitive 19) skills/ppt-master/scripts/visualization_catalog.py:154— visualization_catalog._load_family has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 3, loops 2, error handling 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip.preserve_adopted_source_links (cognitive 18) skills/ppt-master/scripts/authoring_roundtrip.py:1132— authoring_roundtrip.preserve_adopted_source_links has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 3, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._stage2_custom_candidates_error (cognitive 18) skills/ppt-master/scripts/confirm_ui/server.py:1579— server._stage2_custom_candidates_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 3 (4 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._merge_group_inheritance (cognitive 18) skills/ppt-master/scripts/mirror_template_materialize.py:1491— mirror_template_materialize._merge_group_inheritance has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 5, 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.
mirror_template_materialize._preflight_output (cognitive 18) skills/ppt-master/scripts/mirror_template_materialize.py:2771— mirror_template_materialize._preflight_output has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), error handling 2, 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.
pptx_animations.read_slide_animation_sequence (cognitive 18) skills/ppt-master/scripts/pptx_animations.py:3265— pptx_animations.read_slide_animation_sequence has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 3 (4 pts), ternaries 3, boolean chains 2, 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.
diagram_read._ordered_nodes (cognitive 18) skills/ppt-master/scripts/pptx_ooxml/diagram_read.py:285— diagram_read._ordered_nodes has cognitive complexity 18 (threshold 15). Drivers by points: loops 8, if/else 4 (7 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
edit_safety._chart_edit_capability (cognitive 18) skills/ppt-master/scripts/pptx_ooxml/edit_safety.py:75— edit_safety._chart_edit_capability has cognitive complexity 18 (threshold 15). Drivers by points: if/else 13 (15 pts), boolean chains 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
semantic_hash._native_fallback_subtree (cognitive 18) skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:247— semantic_hash._native_fallback_subtree has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 6, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg.extract_native_chart_payload (cognitive 18) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:58— chart_to_svg.extract_native_chart_payload has cognitive complexity 18 (threshold 15). Drivers by points: error handling 6 (8 pts), if/else 8, boolean chains 2 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
color_resolver._compatible_color_element (cognitive 18) skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:550— color_resolver._compatible_color_element has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 2, loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
effect_to_svg._validate_color (cognitive 18) skills/ppt-master/scripts/pptx_to_svg/effect_to_svg.py:245— effect_to_svg._validate_color has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 5, loops 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_walker._build_placeholder_body_property_table (cognitive 18) skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:506— shape_walker._build_placeholder_body_property_table has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 3 (6 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.
slide_to_svg.assemble_part_solo (cognitive 18) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:339— slide_to_svg.assemble_part_solo has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 3, boolean chains 2, error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
slide_to_svg._materialize_inherited_list_styles (cognitive 18) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:814— slide_to_svg._materialize_inherited_list_styles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 2 (3 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.
pptx_transitions.normalize_transition_effect_options (cognitive 18) skills/ppt-master/scripts/pptx_transitions.py:1023— pptx_transitions.normalize_transition_effect_options has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
project_utils._outline_hyperlink_lines (cognitive 18) skills/ppt-master/scripts/project_utils.py:471— project_utils._outline_hyperlink_lines has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 pts), ternaries 2 (3 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
prompt_audit.extract_paragraphs (cognitive 18) skills/ppt-master/scripts/prompt_audit.py:727— prompt_audit.extract_paragraphs has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
register_template.main (cognitive 18) skills/ppt-master/scripts/register_template.py:1423— register_template.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (2 pts), ternaries 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
doc_to_md._write_generic_image_manifest (cognitive 18) skills/ppt-master/scripts/source_to_md/doc_to_md.py:194— doc_to_md._write_generic_image_manifest has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 4 (5 pts), loops 2, 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.
doc_to_md.convert_to_markdown (cognitive 18) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1707— doc_to_md.convert_to_markdown has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 1, ternaries 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.
svg_compatibility.normalize_single_child_group_filters (cognitive 18) skills/ppt-master/scripts/svg_compatibility.py:20— svg_compatibility.normalize_single_child_group_filters has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 3, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
embed_images.embed_images_in_svg (cognitive 18) skills/ppt-master/scripts/svg_finalize/embed_images.py:148— embed_images.embed_images_in_svg has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (4 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fix_image_aspect.main (cognitive 18) skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py:332— fix_image_aspect.main has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGPositionValidator.extract_all_positions (cognitive 18) skills/ppt-master/scripts/svg_position_calculator.py:886— SVGPositionValidator.extract_all_positions has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 4, error handling 2 (4 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._prototype_drift_allowances (cognitive 18) skills/ppt-master/scripts/svg_quality/checker.py:6520— SVGQualityChecker._prototype_drift_allowances has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._page_target (cognitive 18) skills/ppt-master/scripts/svg_quality/cli.py:46— cli._page_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 3, error handling 1 (2 pts), loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_config._animation_group_errors (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1145— animation_config._animation_group_errors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._build_run_properties_xml (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2945— elements._build_run_properties_xml has cognitive complexity 18 (threshold 15). Drivers by points: ternaries 13, boolean chains 5. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
elements._fit_full_image_target (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4558— elements._fit_full_image_target has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 6 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements.project_nested_svg_crop_errors (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5457— elements.project_nested_svg_crop_errors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 4, loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
paths._expand_arc_argument_tokens (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:113— paths._expand_arc_argument_tokens has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (13 pts), boolean chains 4, 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.
styles.build_stroke_xml (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:494— styles.build_stroke_xml has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
theme_fonts.load_theme_font_spec_from_pages (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py:210— theme_fonts.load_theme_font_spec_from_pages has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (8 pts), error handling 1, loops 1 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._category_chart_data (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:970— chart_data._category_chart_data has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 4, ternaries 4 (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.
chart_style._chart_number_formats (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:1225— chart_style._chart_number_formats has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (8 pts), if/else 4 (7 pts), boolean chains 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workbook._minimal_workbook (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py:38— workbook._minimal_workbook has cognitive complexity 18 (threshold 15). Drivers by points: loops 6 (12 pts), if/else 3 (6 pts) (nesting depth added 9). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
workbook._minimal_xy_chart_workbook (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py:160— workbook._minimal_xy_chart_workbook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
workbook._minimal_chart_ex_workbook (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py:185— workbook._minimal_chart_ex_workbook has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (9 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
narration.inject_narration (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py:611— narration.inject_narration has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
template_structure.native_structure_lock_errors (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:3612— template_structure.native_structure_lock_errors has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (2 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.
text_outline._font_catalog (cognitive 18) skills/ppt-master/scripts/svg_to_pptx/text_outline.py:626— text_outline._font_catalog has cognitive complexity 18 (threshold 15). Drivers by points: error handling 2 (5 pts), if/else 2 (4 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
native_structure.build_native_structure (cognitive 18) skills/ppt-master/scripts/template_import/native_structure.py:75— native_structure.build_native_structure has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 8, if/else 5 (6 pts), loops 3, ternaries 1 (nesting depth added 1). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_preview_pptx._roster_spec (cognitive 18) skills/ppt-master/scripts/template_preview_pptx.py:142— template_preview_pptx._roster_spec has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 4 (5 pts), error handling 2, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.initTemplateOptions (cognitive 18) skills/ppt-master/scripts/confirm_ui/static/app.js:1060— app.initTemplateOptions has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (7 pts), ternaries 2 (nesting depth added 1). Of this number, 10 points are the body's own statements and 8 belong to 2 function literals inside it that branch. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
app.tspanBaseline (cognitive 18) REDACTED:2462— app.tspanBaseline has cognitive complexity 18 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 5, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
apply_template.read_template_install (cognitive 17) skills/ppt-master/scripts/apply_template.py:449— apply_template.read_template_install has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), error handling 1, loops 1, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
authoring_roundtrip._rebase_resource_references (cognitive 17) skills/ppt-master/scripts/authoring_roundtrip.py:1483— authoring_roundtrip._rebase_resource_references has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), error handling 1 (3 pts), loops 2 (3 pts), boolean chains 2, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._apply_locked_recommendations (cognitive 17) skills/ppt-master/scripts/confirm_ui/server.py:2033— server._apply_locked_recommendations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (3 pts), loops 3, boolean chains 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
extract_svg_assets.extract_directory (cognitive 17) skills/ppt-master/scripts/extract_svg_assets.py:1041— extract_svg_assets.extract_directory has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 4, boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
generate_examples_index.generate_examples_index (cognitive 17) skills/ppt-master/scripts/generate_examples_index.py:31— generate_examples_index.generate_examples_index has cognitive complexity 17 (threshold 15). Drivers by points: loops 8 (12 pts), if/else 4 (5 pts) (nesting depth added 5). 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.
backend_gemini.generate (cognitive 17) skills/ppt-master/scripts/image_backends/backend_gemini.py:264— backend_gemini.generate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (12 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_openai.generate (cognitive 17) skills/ppt-master/scripts/image_backends/backend_openai.py:696— backend_openai.generate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_tencent.generate (cognitive 17) skills/ppt-master/scripts/image_backends/backend_tencent.py:198— backend_tencent.generate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
image_search.fetch_url_replace (cognitive 17) skills/ppt-master/scripts/image_search.py:1743— image_search.fetch_url_replace has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, error handling 5, if/else 4. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
mirror_template_materialize._resolved_placeholder_decorations (cognitive 17) skills/ppt-master/scripts/mirror_template_materialize.py:2075— mirror_template_materialize._resolved_placeholder_decorations has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, loops 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
pptx_animations._row_timing_profile (cognitive 17) skills/ppt-master/scripts/pptx_animations.py:1266— pptx_animations._row_timing_profile has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), boolean chains 5, loops 2 (3 pts), 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.
pptx_animations._row_matches_powerpoint_behavior (cognitive 17) skills/ppt-master/scripts/pptx_animations.py:2785— pptx_animations._row_matches_powerpoint_behavior has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), ternaries 4 (5 pts), boolean chains 4, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_intake._diagram_summary (cognitive 17) skills/ppt-master/scripts/pptx_intake.py:121— pptx_intake._diagram_summary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 5, loops 2 (3 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
diagram_read._diagram_parts (cognitive 17) skills/ppt-master/scripts/pptx_ooxml/diagram_read.py:97— diagram_read._diagram_parts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
animation_import._relative_delays (cognitive 17) skills/ppt-master/scripts/pptx_to_svg/animation_import.py:240— animation_import._relative_delays has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
effect_to_svg.convert_effects (cognitive 17) skills/ppt-master/scripts/pptx_to_svg/effect_to_svg.py:112— effect_to_svg.convert_effects has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), boolean chains 1, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
tbl_to_svg._native_cell_payload (cognitive 17) skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1262— tbl_to_svg._native_cell_payload has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13 (17 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
pptx_transitions._apply_slide_motion_unchecked (cognitive 17) skills/ppt-master/scripts/pptx_transitions.py:1834— pptx_transitions._apply_slide_motion_unchecked has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), loops 1 (3 pts), boolean chains 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.
pptx_transitions.validate_pptx_transition_package (cognitive 17) skills/ppt-master/scripts/pptx_transitions.py:2627— pptx_transitions.validate_pptx_transition_package has cognitive complexity 17 (threshold 15). Drivers by points: loops 4 (6 pts), error handling 3 (5 pts), if/else 5, boolean chains 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
page_context._page_image_filenames (cognitive 17) skills/ppt-master/scripts/project_management/page_context.py:149— page_context._page_image_filenames has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 3, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
semantic_table._factor_cell_styles (cognitive 17) skills/ppt-master/scripts/semantic_table.py:404— semantic_table._factor_cell_styles has cognitive complexity 17 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (8 pts) (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
pdf_to_md.get_heading_level (cognitive 17) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:100— pdf_to_md.get_heading_level has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
pdf_to_md.detect_headers_footers (cognitive 17) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:313— pdf_to_md.detect_headers_footers has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (6 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pdf_to_md.find_page_tables (cognitive 17) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1235— pdf_to_md.find_page_tables has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 4 (6 pts), boolean chains 1, error handling 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.
ppt_to_md._paragraph_to_markdown (cognitive 17) skills/ppt-master/scripts/source_to_md/ppt_to_md.py:304— ppt_to_md._paragraph_to_markdown has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_authoring_view._definition_closure (cognitive 17) skills/ppt-master/scripts/svg_authoring_view.py:1060— svg_authoring_view._definition_closure has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 4 (7 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
server._apply_edit_record (cognitive 17) skills/ppt-master/scripts/svg_editor/server.py:390— server._apply_edit_record has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 3 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._ungrouped_slide_local_facts (cognitive 17) skills/ppt-master/scripts/svg_quality/checker.py:5892— SVGQualityChecker._ungrouped_slide_local_facts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, ternaries 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._print_template_summary (cognitive 17) skills/ppt-master/scripts/svg_quality/checker.py:9940— SVGQualityChecker._print_template_summary has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
SVGQualityChecker._provenance_categories (cognitive 17) skills/ppt-master/scripts/svg_quality/checker.py:10133— SVGQualityChecker._provenance_categories has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 4 (6 pts), boolean chains 4 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
svg_contracts.check_freeform_geometry_values (cognitive 17) skills/ppt-master/scripts/svg_quality/svg_contracts.py:940— svg_contracts.check_freeform_geometry_values has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), loops 3 (4 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
elements._override_run_attrs (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2651— elements._override_run_attrs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 14 (15 pts), ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
utils.is_picture_effect_carrier (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3075— utils.is_picture_effect_carrier has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 6 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
utils.estimate_text_cluster_widths (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3763— utils.estimate_text_cluster_widths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 6, ternaries 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_data._combo_plot_entry (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:1134— chart_data._combo_plot_entry has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7, boolean chains 5, ternaries 5. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_patch.patch_chart_package (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:415— chart_patch.patch_chart_package has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), loops 4 (5 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_style._native_chart_line_marker_warnings (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:837— chart_style._native_chart_line_marker_warnings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 6, ternaries 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_style._native_chart_area_warnings (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:894— chart_style._native_chart_area_warnings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8, boolean chains 7, ternaries 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_xml._combo_plot_xml (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:1099— chart_xml._combo_plot_xml has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (10 pts), if/else 3 (4 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_LatexParser._parse_atom (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:531— _LatexParser._parse_atom has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (11 pts), ternaries 2 (3 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
marker_common._hex_or_none (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:121— marker_common._hex_or_none has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, error handling 1 (2 pts), loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
table._native_table_header_warnings (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:967— table._native_table_header_warnings has cognitive complexity 17 (threshold 15). Drivers by points: if/else 11 (12 pts), boolean chains 3, ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
narration._animation_timing_branches (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py:567— narration._animation_timing_branches has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 2, loops 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
notes.create_notes_slide_xml (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/notes.py:64— notes.create_notes_slide_xml has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 5 (11 pts), if/else 2 (3 pts), boolean chains 2, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_structure._mirror_element_difference (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:3064— template_structure._mirror_element_difference has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_boolean._require_closed_commands (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:914— shape_boolean._require_closed_commands has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_boolean._fragment_paths (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:1018— shape_boolean._fragment_paths has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (4 pts), loops 2 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
shape_boolean._effective_style (cognitive 17) skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:1218— shape_boolean._effective_style has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
template_preview_pptx._verify_output (cognitive 17) skills/ppt-master/scripts/template_preview_pptx.py:240— template_preview_pptx._verify_output has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 2 (5 pts) (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_measure.wrap_text (cognitive 17) skills/ppt-master/scripts/text_measure.py:277— text_measure.wrap_text has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
total_md_split.main (cognitive 17) skills/ppt-master/scripts/total_md_split.py:278— total_md_split.main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 15 (16 pts), boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
backend_edge._subtitle_cues (cognitive 17) skills/ppt-master/scripts/tts_backends/backend_edge.py:344— backend_edge._subtitle_cues has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 2 (4 pts), boolean chains 2, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
video_subtitles._hard_split_span (cognitive 17) skills/ppt-master/scripts/video_subtitles.py:129— video_subtitles._hard_split_span has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.enumField::makeChip (cognitive 17) skills/ppt-master/scripts/confirm_ui/static/app.js:1474— app.enumField::makeChip has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level. This shape REPEATS in the file: one other method here (app.enumField) has the same decision points, in the same order, at the same nesting depths — so this is one pattern written twice rather than two separate problems. Splitting this body alone leaves the other exactly as it is. Where these are variations on one operation, the change that clears both is the shared one: lift the common shape into a single routine the variants call, parameterised by whatever genuinely differs between them, and keep in each method only the part that is not shared.
analyze_images._analyze_images (cognitive 16) skills/ppt-master/scripts/analyze_images.py:224— analyze_images._analyze_images has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
authoring_roundtrip._roundtrip_source_svg_names (cognitive 16) skills/ppt-master/scripts/authoring_roundtrip.py:279— authoring_roundtrip._roundtrip_source_svg_names has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 3, 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.
authoring_roundtrip._referenced_assets (cognitive 16) skills/ppt-master/scripts/authoring_roundtrip.py:1203— authoring_roundtrip._referenced_assets has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 4, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BatchValidator.validate_project (cognitive 16) skills/ppt-master/scripts/batch_validate.py:82— BatchValidator.validate_project has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (10 pts), loops 2 (4 pts), boolean chains 2 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
BatchValidator.export_report (cognitive 16) skills/ppt-master/scripts/batch_validate.py:216— BatchValidator.export_report has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (4 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
config.load_prefixed_env_file (cognitive 16) skills/ppt-master/scripts/config.py:113— config.load_prefixed_env_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
backend_tencent._generate_image (cognitive 16) skills/ppt-master/scripts/image_backends/backend_tencent.py:137— backend_tencent._generate_image has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (8 pts), boolean chains 5, ternaries 3 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
image_search._retained_pool_candidates (cognitive 16) skills/ppt-master/scripts/image_search.py:832— image_search._retained_pool_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 6, error handling 1, loops 1 (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
provider_openverse.parse_results (cognitive 16) skills/ppt-master/scripts/image_sources/provider_openverse.py:69— provider_openverse.parse_results has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, if/else 2 (4 pts), loops 1 (nesting depth added 2). To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
mirror_template_materialize._text_body_segments (cognitive 16) skills/ppt-master/scripts/mirror_template_materialize.py:1235— mirror_template_materialize._text_body_segments has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (10 pts), loops 2 (3 pts), boolean chains 2, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
mirror_template_materialize._sanitize_connector_references (cognitive 16) skills/ppt-master/scripts/mirror_template_materialize.py:2625— mirror_template_materialize._sanitize_connector_references has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), loops 3 (6 pts), boolean chains 3 (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.
narration_sync._parse_srt (cognitive 16) skills/ppt-master/scripts/narration_sync.py:225— narration_sync._parse_srt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
narration_sync._align_audio_starts_to_video (cognitive 16) skills/ppt-master/scripts/narration_sync.py:1670— narration_sync._align_audio_starts_to_video has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_effects.txbody_has_run_effects (cognitive 16) skills/ppt-master/scripts/pptx_effects.py:187— pptx_effects.txbody_has_run_effects has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (9 pts), loops 3 (6 pts), boolean chains 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
clone._remap_cloned_xml_part_slide_jumps (cognitive 16) skills/ppt-master/scripts/pptx_ooxml/clone.py:468— clone._remap_cloned_xml_part_slide_jumps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), error handling 2 (5 pts), loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
pptx_template_import._managed_resource_paths (cognitive 16) skills/ppt-master/scripts/pptx_template_import.py:153— pptx_template_import._managed_resource_paths has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), boolean chains 2, loops 1 (2 pts), error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._chart_visual_styles (cognitive 16) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:968— chart_to_svg._chart_visual_styles has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), ternaries 2 (4 pts), boolean chains 3, loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
chart_to_svg._validate_normalized_axis_topology (cognitive 16) skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1639— chart_to_svg._validate_normalized_axis_topology has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 5, 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.
ln_to_svg._project_degenerate_stroke_gradients (cognitive 16) skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py:301— ln_to_svg._project_degenerate_stroke_gradients has cognitive complexity 16 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 3 (4 pts), ternaries 4, boolean chains 1 (nesting depth added 5). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
OoxmlPackage._load_presentation (cognitive 16) skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:284— OoxmlPackage._load_presentation has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
slide_to_svg.assemble_slide (cognitive 16) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:229— slide_to_svg.assemble_slide has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (6 pts), ternaries 6, boolean chains 2, 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.
txbody_to_svg._resolve_theme_typeface (cognitive 16) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1138— txbody_to_svg._resolve_theme_typeface has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 6, if/else 6, ternaries 2 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
ProjectManager._merge_image_manifest (cognitive 16) skills/ppt-master/scripts/project_management/cli.py:645— ProjectManager._merge_image_manifest has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ProjectManager._propagate_image_assets (cognitive 16) skills/ppt-master/scripts/project_management/cli.py:732— ProjectManager._propagate_image_assets has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), error handling 2, loops 2 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
rotate_images.main (cognitive 16) skills/ppt-master/scripts/rotate_images.py:752— rotate_images.main has cognitive complexity 16 (threshold 15). Drivers by points: error handling 4 (8 pts), if/else 5 (6 pts), ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
doc_to_md._convert_with_pandoc (cognitive 16) skills/ppt-master/scripts/source_to_md/doc_to_md.py:1586— doc_to_md._convert_with_pandoc has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (3 pts), error handling 1 (2 pts), ternaries 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.
pdf_to_md.merge_markdown_continuation_tables (cognitive 16) skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1346— pdf_to_md.merge_markdown_continuation_tables has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 3 (6 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.
_PublicConnectionMixin._new_conn (cognitive 16) skills/ppt-master/scripts/source_to_md/web_to_md.py:190— _PublicConnectionMixin._new_conn has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), loops 2 (3 pts), error handling 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
fix_image_aspect.get_image_dimensions_basic (cognitive 16) skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py:63— fix_image_aspect.get_image_dimensions_basic has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._has_zero_opacity (cognitive 16) skills/ppt-master/scripts/svg_quality/checker.py:4535— SVGQualityChecker._has_zero_opacity has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), ternaries 2 (5 pts), error handling 1 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVGQualityChecker._layout_contract_fingerprint (cognitive 16) skills/ppt-master/scripts/svg_quality/checker.py:7974— SVGQualityChecker._layout_contract_fingerprint has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), boolean chains 4, loops 2 (4 pts), error handling 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.
SVGQualityChecker._apply_aggregated_issue_counts (cognitive 16) skills/ppt-master/scripts/svg_quality/checker.py:9977— SVGQualityChecker._apply_aggregated_issue_counts has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11, loops 5. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
animation_config.build_group_listing (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1861— animation_config.build_group_listing has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), boolean chains 2, loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils._transform_operations_matrix (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:836— utils._transform_operations_matrix has cognitive complexity 16 (threshold 15). Drivers by points: ternaries 4 (12 pts), if/else 2 (3 pts), loops 1 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
utils.classify_project_marker_shape (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1990— utils.classify_project_marker_shape 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.
utils._is_imported_preset_preview_filter_target (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3005— utils._is_imported_preset_preview_filter_target has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8, boolean chains 7, error handling 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
utils.detect_text_lang (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3411— utils.detect_text_lang has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10, boolean chains 5, loops 1. To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
chart_patch.chart_edit_is_data_only (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:152— chart_patch.chart_edit_is_data_only has cognitive complexity 16 (threshold 15). Drivers by points: if/else 2 (7 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_ChemParser._parse_grouped_formula (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1960— _ChemParser._parse_grouped_formula has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 3, loops 1, ternaries 1 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
marker_attributes.native_metadata_payload_matches (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_attributes.py:99— marker_attributes.native_metadata_payload_matches has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (7 pts), boolean chains 6, ternaries 2, loops 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
marker_common._fallback_fill_candidates (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:804— marker_common._fallback_fill_candidates has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9, boolean chains 3, loops 1 (2 pts), ternaries 2 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
table._native_table_warnings (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py:1310— table._native_table_warnings has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), ternaries 2 (4 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
builder._apply_template_slide_backgrounds (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3495— builder._apply_template_slide_backgrounds has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (11 pts), ternaries 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
cli._conversion_trace_dangerous_normalization_count (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1382— cli._conversion_trace_dangerous_normalization_count has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 1 (2 pts), boolean chains 1, error handling 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
dimensions.resolve_svg_canvas (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/dimensions.py:139— dimensions.resolve_svg_canvas has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 pts), loops 1 (2 pts), boolean chains 1, ternaries 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.
template_structure._validate_placeholder_carrier (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1437— template_structure._validate_placeholder_carrier has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 7, if/else 6 (7 pts), error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
text_outline._font_files (cognitive 16) skills/ppt-master/scripts/svg_to_pptx/text_outline.py:679— text_outline._font_files has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (7 pts), error handling 2 (5 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
video_subtitles._parse_srt (cognitive 16) skills/ppt-master/scripts/video_subtitles.py:68— video_subtitles._parse_srt has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), error handling 1 (2 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
_AutomaticTranscript._should_retain (cognitive 16) skills/ppt-master/scripts/workflow_transcript.py:162— _AutomaticTranscript._should_retain has cognitive complexity 16 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 2 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
app.localized (cognitive 16) skills/ppt-master/scripts/confirm_ui/static/app.js:788— app.localized has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
app.legacyRecId (cognitive 16) skills/ppt-master/scripts/confirm_ui/static/app.js:1372— app.legacyRecId has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 7. To reduce it, name the conditions: bind each compound test to a well-named local or a small predicate function, so the body reads as a sequence of named decisions rather than a chain of operators.
app.updateNavLabel (cognitive 16) REDACTED:592— app.updateNavLabel has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (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.
app.modalConfirm.addEventListener("click") (cognitive 16) REDACTED:1790— app.modalConfirm.addEventListener("click") has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 5 (nesting depth added 2). Most of this is not in the body itself: 1 of the 16 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1820, 1846). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
app.renderEditableProps (cognitive 16) REDACTED:2103— app.renderEditableProps has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 6, error handling 1 (nesting depth added 2). Of this number, 14 points are the body's own statements and 2 belong to one function literal inside it that branches. To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D4 · Code Duplication· Near-duplicate member family (12 members, 26 shared lines) · ×1
Near-duplicate member family (12 members, 26 shared lines) skills/ppt-master/scripts/image_backends/backend_bfl.py:182— skills/ppt-master/scripts/image_backends/backend_bfl.py:182-216 | skills/ppt-master/scripts/image_backends/backend_fal.py:147-182 | skills/ppt-master/scripts/image_backends/backend_ideogram.py:152-186 | skills/ppt-master/scripts/image_backends/backend_minimax.py:219-255 | skills/ppt-master/scripts/image_backends/backend_modelscope.py:154-189 | skills/ppt-master/scripts/image_backends/backend_qwen.py:188-225 | skills/ppt-master/scripts/image_backends/backend_replicate.py:170-205 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:147-183 | skills/ppt-master/scripts/image_backends/backend_stability.py:142-177 | skills/ppt-master/scripts/image_backends/backend_tencent.py:202-244 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:163-204 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:163-200 — These 12 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 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 (6 members, 25 shared lines) · ×1
Near-duplicate member family (6 members, 25 shared lines) skills/ppt-master/scripts/image_backends/backend_fal.py:103— skills/ppt-master/scripts/image_backends/backend_fal.py:103-140 | skills/ppt-master/scripts/image_backends/backend_minimax.py:161-212 | skills/ppt-master/scripts/image_backends/backend_qwen.py:133-181 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:104-140 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:118-156 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:119-156 — These 6 members are variants of one another: a block of 25 lines reported below appears in every one of them, and the pairwise near-duplicate rows they would otherwise produce are collapsed into this row. Read them as one construct written 6 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 6 times.
Near-duplicate member pair (58 shared lines) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2865— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2865-3014 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4487-4700 — These two members are variants of one another: 58 of their lines are already reported as duplicated blocks below, spread through both bodies rather than gathered into one. Read them as a single construct written twice. The repair is at the members' grain — factor the shared pipeline into one implementation the two call with their differences as parameters or as an injected step, or, where the difference is systematic (sync against async, one transport against another), generate one from the other. Extracting the individual blocks below is not the same fix: it leaves the two bodies in place and the next edit still has to be made twice.
D4 · Code Duplication· Edited copy of a member (19 corresponding lines) · ×1
Edited copy of a member (19 corresponding lines) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:564— skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:564-623 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:702-770 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication· Members sharing a duplicated core (17 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (17 members, 50+ identical tokens) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:156— skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:156-184 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:244-253 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:260-269 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:276-285 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:313-322 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:329-338 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:345-354 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:361-370 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:377-386 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:393-402 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:409-418 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:425-434 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:441-450 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:457-466 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:473-482 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:489-498 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:505-514 — These 17 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 17 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 17 times.
D4 · Code Duplication· Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (5 members, 50+ identical tokens) skills/ppt-master/scripts/image_backends/backend_minimax.py:120— skills/ppt-master/scripts/image_backends/backend_minimax.py:120-136 | skills/ppt-master/scripts/image_backends/backend_qwen.py:110-126 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:81-97 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:95-111 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:96-112 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) skills/ppt-master/scripts/image_backends/backend_gemini.py:157— skills/ppt-master/scripts/image_backends/backend_gemini.py:157-257 | skills/ppt-master/scripts/image_backends/backend_openai.py:496-587 | skills/ppt-master/scripts/image_backends/backend_openai.py:594-689 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:91-160 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (60 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3893— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3893-3952 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3994-4053 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (37 lines × 2) skills/ppt-master/scripts/image_sources/provider_pexels.py:104— skills/ppt-master/scripts/image_sources/provider_pexels.py:104-140 | skills/ppt-master/scripts/image_sources/provider_pixabay.py:108-144 — before extracting anything, compare `skills/ppt-master/scripts/image_sources/provider_pexels.py` and `skills/ppt-master/scripts/image_sources/provider_pixabay.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (35 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:2240— skills/ppt-master/scripts/svg_quality/checker.py:2240-2274 | skills/ppt-master/scripts/svg_quality/checker.py:2292-2326 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (30–31 lines × 2) skills/ppt-master/scripts/image_backends/backend_openai.py:529— skills/ppt-master/scripts/image_backends/backend_openai.py:529-558 | skills/ppt-master/scripts/image_backends/backend_openai.py:630-660 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (27–31 lines × 2) skills/ppt-master/scripts/image_sources/provider_pexels.py:68— skills/ppt-master/scripts/image_sources/provider_pexels.py:68-94 | skills/ppt-master/scripts/image_sources/provider_pixabay.py:68-98 — before extracting anything, compare `skills/ppt-master/scripts/image_sources/provider_pexels.py` and `skills/ppt-master/scripts/image_sources/provider_pixabay.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/image_sources/provider_pexels.py:67` calls `get` and `skills/ppt-master/scripts/image_sources/provider_pixabay.py:67` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (31 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7445— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7445-7475 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7594-7624 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17–28 lines × 4) skills/ppt-master/scripts/image_backends/backend_qwen.py:133— skills/ppt-master/scripts/image_backends/backend_qwen.py:133-160 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:104-120 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:118-136 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:119-136 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_qwen.py` and `skills/ppt-master/scripts/image_backends/backend_siliconflow.py` as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 169 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `image_size` to `str = "1K"` in one and `str = DEFAULT_IMAGE_SIZE` 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 (22–28 lines × 2) skills/ppt-master/scripts/pptx_transitions.py:3107— skills/ppt-master/scripts/pptx_transitions.py:3107-3128 | skills/ppt-master/scripts/pptx_transitions.py:3135-3162 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (27 lines × 2) skills/ppt-master/scripts/narration_sync.py:226— skills/ppt-master/scripts/narration_sync.py:226-252 | skills/ppt-master/scripts/video_subtitles.py:70-96 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (18–27 lines × 2) skills/ppt-master/scripts/pptx_animations.py:2943— skills/ppt-master/scripts/pptx_animations.py:2943-2960 | skills/ppt-master/scripts/pptx_animations.py:2968-2994 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_animations.py:2943` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (26 lines × 12) skills/ppt-master/scripts/image_backends/backend_bfl.py:191— skills/ppt-master/scripts/image_backends/backend_bfl.py:191-216 | skills/ppt-master/scripts/image_backends/backend_fal.py:157-182 | skills/ppt-master/scripts/image_backends/backend_ideogram.py:161-186 | skills/ppt-master/scripts/image_backends/backend_minimax.py:230-255 | skills/ppt-master/scripts/image_backends/backend_modelscope.py:164-189 | skills/ppt-master/scripts/image_backends/backend_qwen.py:200-225 | skills/ppt-master/scripts/image_backends/backend_replicate.py:180-205 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:158-183 | skills/ppt-master/scripts/image_backends/backend_stability.py:152-177 | skills/ppt-master/scripts/image_backends/backend_tencent.py:219-244 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:179-204 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:175-200 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_fal.py` and `skills/ppt-master/scripts/image_backends/backend_ideogram.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. 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 `image_size` to `str = "1K"` in one and `str = DEFAULT_IMAGE_SIZE` 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 before the matched lines, `skills/ppt-master/scripts/image_backends/backend_bfl.py:189` calls `get` and `skills/ppt-master/scripts/image_backends/backend_stability.py:150` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (15–26 lines × 5) skills/ppt-master/scripts/image_backends/backend_minimax.py:164— skills/ppt-master/scripts/image_backends/backend_minimax.py:164-182 | skills/ppt-master/scripts/image_backends/backend_qwen.py:136-161 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:107-121 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:121-137 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:122-137 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_minimax.py` and `skills/ppt-master/scripts/image_backends/backend_qwen.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 129 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (14–25 lines × 7) skills/ppt-master/scripts/image_backends/backend_fal.py:111— skills/ppt-master/scripts/image_backends/backend_fal.py:111-125 | skills/ppt-master/scripts/image_backends/backend_modelscope.py:117-131 | skills/ppt-master/scripts/image_backends/backend_qwen.py:141-165 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:112-125 | skills/ppt-master/scripts/image_backends/backend_stability.py:102-118 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:126-141 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:128-141 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_fal.py` and `skills/ppt-master/scripts/image_backends/backend_modelscope.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 76 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/image_backends/backend_stability.py:102` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. Note first that the copies are not typed on the same thing: the declarations holding them bind `model` to `str = DEFAULT_MODEL` in one and `str = None` 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 (19–24 lines × 2) skills/ppt-master/scripts/confirm_ui/server.py:2756— skills/ppt-master/scripts/confirm_ui/server.py:2756-2774 | skills/ppt-master/scripts/svg_editor/server.py:1445-1468 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/confirm_ui/server.py:2756` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (23–24 lines × 2) skills/ppt-master/scripts/extract_svg_assets.py:889— skills/ppt-master/scripts/extract_svg_assets.py:889-911 | skills/ppt-master/scripts/extract_svg_assets.py:935-958 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (22–24 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7515— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7515-7538 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7552-7573 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (23 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1896— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1896-1918 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1972-1994 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1894` calls `PathCommand` and `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1970` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (16–22 lines × 2) skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:144— skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:144-159 | skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:291-312 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. 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 (21–22 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2956— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2956-2976 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4601-4622 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2956` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19–21 lines × 2) skills/ppt-master/scripts/powerpoint_video.py:213— skills/ppt-master/scripts/powerpoint_video.py:213-233 | skills/ppt-master/scripts/source_to_md/excel_to_md.py:525-543 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/powerpoint_video.py:213` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (21 lines × 2) skills/ppt-master/scripts/pptx_to_svg/converter.py:602— skills/ppt-master/scripts/pptx_to_svg/converter.py:602-622 | skills/ppt-master/scripts/pptx_to_svg/converter.py:635-655 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/converter.py:602` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/pptx_to_svg/converter.py:634` calls `iter_slides` and `skills/ppt-master/scripts/pptx_to_svg/converter.py:601` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (20 lines × 3) skills/ppt-master/scripts/image_backends/backend_gemini.py:322— skills/ppt-master/scripts/image_backends/backend_gemini.py:322-341 | skills/ppt-master/scripts/image_backends/backend_openai.py:758-777 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:207-226 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_gemini.py` and `skills/ppt-master/scripts/image_backends/backend_openrouter.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/image_backends/backend_gemini.py:322` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (19–20 lines × 2) skills/ppt-master/scripts/confirm_ui/server.py:2192— skills/ppt-master/scripts/confirm_ui/server.py:2192-2210 | skills/ppt-master/scripts/svg_editor/server.py:1320-1339 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/confirm_ui/server.py:2192` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15–20 lines × 2) skills/ppt-master/scripts/svg_editor/server.py:983— skills/ppt-master/scripts/svg_editor/server.py:983-1002 | skills/ppt-master/scripts/svg_editor/server.py:1109-1123 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (18–19 lines × 3) skills/ppt-master/scripts/image_backends/backend_openai.py:548— skills/ppt-master/scripts/image_backends/backend_openai.py:548-566 | skills/ppt-master/scripts/image_backends/backend_openai.py:651-668 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:122-140 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_openai.py` and `skills/ppt-master/scripts/image_backends/backend_openrouter.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 50 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (17–19 lines × 3) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1813— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1813-1831 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1896-1912 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1972-1988 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1894` calls `PathCommand` and `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1970` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (18–19 lines × 2) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:261— skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:261-279 | skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:451-468 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:261` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (17–18 lines × 2) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:319— skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:319-336 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:434-450 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (17 lines × 5) skills/ppt-master/scripts/image_backends/backend_minimax.py:120— skills/ppt-master/scripts/image_backends/backend_minimax.py:120-136 | skills/ppt-master/scripts/image_backends/backend_qwen.py:110-126 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:81-97 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:95-111 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:96-112 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_minimax.py` and `skills/ppt-master/scripts/image_backends/backend_qwen.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 129 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/image_backends/backend_qwen.py:104` calls `endswith` and `skills/ppt-master/scripts/image_backends/backend_siliconflow.py:76` 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 (16–17 lines × 2) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:665— skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:665-681 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:684-699 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:665` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (15–17 lines × 2) skills/ppt-master/scripts/svg_quality/checker.py:4571— skills/ppt-master/scripts/svg_quality/checker.py:4571-4587 | skills/ppt-master/scripts/svg_quality/checker.py:7123-7137 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (14–17 lines × 2) skills/ppt-master/scripts/svg_quality/svg_contracts.py:1098— skills/ppt-master/scripts/svg_quality/svg_contracts.py:1098-1114 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:1117-1130 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_quality/svg_contracts.py:1098` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (15–16 lines × 2) skills/ppt-master/scripts/pptx_to_svg/converter.py:1495— skills/ppt-master/scripts/pptx_to_svg/converter.py:1495-1510 | skills/ppt-master/scripts/pptx_to_svg/converter.py:1511-1525 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/converter.py:1495` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 4) skills/ppt-master/scripts/project_management/cli.py:1109— skills/ppt-master/scripts/project_management/cli.py:1109-1123 | skills/ppt-master/scripts/project_management/cli.py:1138-1152 | skills/ppt-master/scripts/project_management/cli.py:1160-1174 | skills/ppt-master/scripts/project_management/cli.py:1191-1205 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (13–15 lines × 2) skills/ppt-master/scripts/pptx_animations.py:2423— skills/ppt-master/scripts/pptx_animations.py:2423-2435 | skills/ppt-master/scripts/pptx_animations.py:2452-2466 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (14–15 lines × 2) skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2275— skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2275-2289 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2319-2332 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 8) skills/ppt-master/scripts/image_backends/backend_fal.py:107— skills/ppt-master/scripts/image_backends/backend_fal.py:107-121 | skills/ppt-master/scripts/image_backends/backend_minimax.py:166-182 | skills/ppt-master/scripts/image_backends/backend_modelscope.py:113-127 | skills/ppt-master/scripts/image_backends/backend_qwen.py:137-161 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:108-121 | skills/ppt-master/scripts/image_backends/backend_stability.py:98-111 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:122-137 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:123-137 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_fal.py` and `skills/ppt-master/scripts/image_backends/backend_minimax.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Note first that the copies are not typed on the same thing: the declarations holding them bind `model` to `str = DEFAULT_MODEL` in one and `str = None` 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 (14 lines × 5) skills/ppt-master/scripts/image_backends/backend_fal.py:127— skills/ppt-master/scripts/image_backends/backend_fal.py:127-140 | skills/ppt-master/scripts/image_backends/backend_ideogram.py:132-145 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:127-140 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:143-156 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:143-156 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_fal.py` and `skills/ppt-master/scripts/image_backends/backend_ideogram.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (7–13 lines × 4) skills/ppt-master/scripts/svg_position_calculator.py:1188— skills/ppt-master/scripts/svg_position_calculator.py:1188-1200 | skills/ppt-master/scripts/svg_position_calculator.py:1205-1217 | skills/ppt-master/scripts/svg_position_calculator.py:1222-1234 | skills/ppt-master/scripts/svg_position_calculator.py:1244-1250 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The 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 (13 lines × 3) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1361— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1361-1373 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1608-1620 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5161-5173 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1361` it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows — the window is the tail of one member plus the head of the next, so no call can be substituted for those exact lines, and the smallest declaration that contains all of them is the type they sit in. The repeated unit is the member each site sits in: where those members' bodies are the same, move one whole member to the shared location and have the others delegate to it; where the copies are a run of near-identical overloads or wrappers that differ only in their signatures, the repetition IS the run — a one-line delegation has no helper inside it to lift — so generate the run from the set it enumerates, or accept it and keep each member's own documentation with it. 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–13 lines × 2) skills/ppt-master/scripts/confirm_ui/server.py:2362— skills/ppt-master/scripts/confirm_ui/server.py:2362-2372 | skills/ppt-master/scripts/svg_editor/server.py:689-701 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
Duplicated block (12–13 lines × 2) skills/ppt-master/scripts/source_to_md.py:560— skills/ppt-master/scripts/source_to_md.py:560-571 | skills/ppt-master/scripts/source_to_md/_batch.py:146-158 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11–12 lines × 2) skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:285— skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:285-296 | skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:469-479 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:285` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:468` calls `_parse_frame`, `get` and `skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:285` 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–12 lines × 2) skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3419— skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3419-3428 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4437-4448 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3417` calls `write_text` and `skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4436` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (11 lines × 4) skills/ppt-master/scripts/image_backends/backend_gemini.py:204— skills/ppt-master/scripts/image_backends/backend_gemini.py:204-214 | skills/ppt-master/scripts/image_backends/backend_openai.py:554-564 | skills/ppt-master/scripts/image_backends/backend_openai.py:656-666 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:128-138 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_gemini.py` and `skills/ppt-master/scripts/image_backends/backend_openrouter.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 46 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9–11 lines × 3) skills/ppt-master/scripts/image_sources/provider_openverse.py:80— skills/ppt-master/scripts/image_sources/provider_openverse.py:80-88 | skills/ppt-master/scripts/image_sources/provider_pexels.py:71-81 | skills/ppt-master/scripts/image_sources/provider_pixabay.py:71-81 — before extracting anything, compare `skills/ppt-master/scripts/image_sources/provider_pexels.py` and `skills/ppt-master/scripts/image_sources/provider_pixabay.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 86 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/image_sources/provider_openverse.py:80` 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 (9–10 lines × 3) skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:910— skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:910-919 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1055-1064 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1105-1113 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:910` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:919` calls `TemplateStructureError` and `skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1065` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (8–10 lines × 3) skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:118— skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:118-125 | skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py:51-60 | skills/ppt-master/scripts/tts_backends/backend_minimax.py:50-57 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
Duplicated block (6–10 lines × 3) skills/ppt-master/scripts/svg_quality/svg_contracts.py:384— skills/ppt-master/scripts/svg_quality/svg_contracts.py:384-389 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:484-493 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:594-599 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_quality/svg_contracts.py:384` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 7) skills/ppt-master/scripts/image_backends/backend_fal.py:125— skills/ppt-master/scripts/image_backends/backend_fal.py:125-133 | skills/ppt-master/scripts/image_backends/backend_minimax.py:186-194 | skills/ppt-master/scripts/image_backends/backend_qwen.py:165-173 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:125-133 | skills/ppt-master/scripts/image_backends/backend_tencent.py:176-184 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:141-149 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:141-149 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_fal.py` and `skills/ppt-master/scripts/image_backends/backend_minimax.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (9 lines × 3) skills/ppt-master/scripts/svg_quality/svg_contracts.py:565— skills/ppt-master/scripts/svg_quality/svg_contracts.py:565-573 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:741-749 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:952-960 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6–9 lines × 2) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:687— skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:687-692 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:930-938 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:930` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 17) skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:177— skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:177-184 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:246-253 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:262-269 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:278-285 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:315-322 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:331-338 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:347-354 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:363-370 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:379-386 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:395-402 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:411-418 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:427-434 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:443-450 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:459-466 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:475-482 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:491-498 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:507-514 — all 17 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 6) skills/ppt-master/scripts/image_backends/backend_fal.py:127— skills/ppt-master/scripts/image_backends/backend_fal.py:127-134 | skills/ppt-master/scripts/image_backends/backend_ideogram.py:132-139 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:127-134 | skills/ppt-master/scripts/image_backends/backend_tencent.py:178-185 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:143-150 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:143-150 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_fal.py` and `skills/ppt-master/scripts/image_backends/backend_ideogram.py` as WHOLE FILES: this scan already matched 3 separate duplicated blocks between them, totalling at least 48 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
Duplicated block (6–7 lines × 4) skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:508— skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:508-514 | skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:516-521 | skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:523-528 | skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:530-535 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py:508` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 3) skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:809— skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:809-815 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:869-875 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:893-899 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (6–7 lines × 2) skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:1037— skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:1037-1042 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:1045-1051 — both copies are in the same file, so extract the 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, `skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:1046` calls `_axis_scaling_xml` and `skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:1052` 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 (6 lines × 8) skills/ppt-master/scripts/image_backends/backend_fal.py:123— skills/ppt-master/scripts/image_backends/backend_fal.py:123-128 | skills/ppt-master/scripts/image_backends/backend_minimax.py:184-189 | skills/ppt-master/scripts/image_backends/backend_qwen.py:163-168 | skills/ppt-master/scripts/image_backends/backend_replicate.py:128-133 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:123-128 | skills/ppt-master/scripts/image_backends/backend_tencent.py:174-179 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:139-144 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:139-144 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_fal.py` and `skills/ppt-master/scripts/image_backends/backend_minimax.py` as WHOLE FILES: this scan already matched 4 separate duplicated blocks between them, totalling at least 66 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `skills/ppt-master/scripts/image_backends/backend_tencent.py:171` calls `normalize_image_size` and `skills/ppt-master/scripts/image_backends/backend_fal.py:120` 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 (6 lines × 3) skills/ppt-master/scripts/extract_svg_assets.py:818— skills/ppt-master/scripts/extract_svg_assets.py:818-823 | skills/ppt-master/scripts/extract_svg_assets.py:855-860 | skills/ppt-master/scripts/extract_svg_assets.py:961-966 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
Duplicated block (3–6 lines × 3) skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1887— skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1887-1892 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1964-1969 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4305-4307 — 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, `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1894` calls `PathCommand` and `skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1972` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 5) skills/ppt-master/scripts/image_backends/backend_minimax.py:94— skills/ppt-master/scripts/image_backends/backend_minimax.py:94-100 | skills/ppt-master/scripts/image_backends/backend_qwen.py:90-96 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:63-69 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:75-81 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:78-84 — before extracting anything, compare `skills/ppt-master/scripts/image_backends/backend_minimax.py` and `skills/ppt-master/scripts/image_backends/backend_qwen.py` as WHOLE FILES: this scan already matched 8 separate duplicated blocks between them, totalling at least 129 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (24 lines × 2) skills/ppt-master/scripts/pptx_gradients.py:73— skills/ppt-master/scripts/pptx_gradients.py:73-96 | skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:56-81 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. 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 × 7) skills/ppt-master/scripts/pptx_to_svg/converter.py:1564— skills/ppt-master/scripts/pptx_to_svg/converter.py:1564-1568 | skills/ppt-master/scripts/project_management/page_context.py:707-711 | skills/ppt-master/scripts/sound_sync.py:43-47 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:149-153 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1158-1162 | skills/ppt-master/scripts/template_import/native_structure.py:34-38 | skills/ppt-master/scripts/video_sound_mix.py:125-129 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere all 7 call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made 7 times.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/static/app.js:4563— `(e.key === "ArrowDown" || e.key === "ArrowUp") && langMenu.hidden` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/static/app.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/static/app.js:726— `/\bhant\b/.test(nav) || /\b(tw|hk|mo)\b/.test(nav)` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/static/app.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/static/app.js:740— `LANG === "zh" || LANG === "zh-TW" || LANG === "ja"` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/static/app.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/static/app.js:4594— `e.key === "ArrowLeft" || e.key === "ArrowRight"` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/static/app.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/static/app.js:4587— `items[idx - 1] || items[items.length - 1]` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/static/app.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/static/app.js:4537— `langMenu.querySelector("li.selected") || langMenu.querySelector("li[data-lang]")` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/static/app.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/static/app.js:723— `navigator.language || navigator.userLanguage || "en"` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/static/app.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/static/app.js:720— `stored === "zh" || stored === "en" || stored === "ja" || stored === "zh-TW"` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/static/app.js, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/svg_quality/checker.py:4574— `_expand_local_use_references is not None and _UseExpansionError is not None` appears character-identically in 2 files — skills/ppt-master/scripts/svg_quality/checker.py, skills/ppt-master/scripts/svg_quality/svg_contracts.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/extract_svg_assets.py:193— `_local(attr_name) == "href" and value.startswith("#") and len(value) > 1` appears character-identically in 2 files — skills/ppt-master/scripts/extract_svg_assets.py, skills/ppt-master/scripts/extract_svg_pictures.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/authoring_roundtrip.py:1387— `_local_name(child.tag) == "style" or not child.get("id")` appears character-identically in 2 files — skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/svg_authoring_view.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/authoring_roundtrip.py:1357— `_local_name(name) == "href" and value.startswith("#")` appears character-identically in 3 files — skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/svg_authoring_contract.py, skills/ppt-master/scripts/svg_authoring_view.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/image_backends/backend_gemini.py:328— `attempt < max_retries and is_rate_limit_error(e)` appears character-identically in 3 files — skills/ppt-master/scripts/image_backends/backend_gemini.py, skills/ppt-master/scripts/image_backends/backend_openai.py, skills/ppt-master/scripts/image_backends/backend_openrouter.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2543— `body_pr is None or body_pr.attrib or list(body_pr)` appears character-identically in 2 files — skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py, skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:196— `boundaries and start < boundaries[-1]["offset"]` appears character-identically in 2 files — skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py, skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/image_search.py:967— `candidate.discovery_query or request.query` appears character-identically in 2 files — skills/ppt-master/scripts/image_search.py, skills/ppt-master/scripts/image_sources/provider_common.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/pptx_to_svg/converter.py:180— `ea is not None and ea.attrib.get("typeface")` appears character-identically in 2 files — skills/ppt-master/scripts/pptx_to_svg/converter.py, skills/ppt-master/scripts/template_import/manifest.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:83— `elem.get("display") == "none" or elem.get("visibility") == "hidden"` appears character-identically in 2 files — skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py, skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/svg_quality/checker.py:6035— `elem.get('id') or elem.get('data-name') or '<unnamed>'` appears character-identically in 3 files — skills/ppt-master/scripts/svg_quality/checker.py, skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/server.py:2905— `existing and _process_alive(_lock_pid(existing))` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/server.py, skills/ppt-master/scripts/svg_editor/server.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/mirror_template_materialize.py:1373— `expected is None or expected != expected.strip() or _SHA256_RE.fullmatch(expected) is None` appears character-identically in 2 files — skills/ppt-master/scripts/mirror_template_materialize.py, skills/ppt-master/scripts/svg_authoring_view.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/project_utils.py:716— `expected_format and expected_format in CANVAS_FORMATS` appears character-identically in 2 files — skills/ppt-master/scripts/project_utils.py, skills/ppt-master/scripts/svg_quality/checker.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/apply_template.py:142— `fm.get(KIND_CONFIG[kind]["id_key"]) or ""` appears character-identically in 2 files — skills/ppt-master/scripts/apply_template.py, skills/ppt-master/scripts/register_template.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/confirm_ui/server.py:2331— `host.startswith('[') or host.count(':') == 1` appears character-identically in 2 files — skills/ppt-master/scripts/confirm_ui/server.py, skills/ppt-master/scripts/svg_editor/server.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate skills/ppt-master/scripts/hyperlink_contract.py:154— `href is not None and xlink_href is not None` appears character-identically in 2 files — skills/ppt-master/scripts/hyperlink_contract.py, skills/ppt-master/scripts/svg_to_pptx/use_expander.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Silent fallback default on parse failure skills/ppt-master/scripts/apply_template.py:185— `_source_label` returns `'explicit'` 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 skills/ppt-master/scripts/confirm_ui/server.py:1780— `_expected_result_stage` returns `'final'` when `(OSError, json.JSONDecodeError, 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 skills/ppt-master/scripts/confirm_ui/server.py:1803— `_read_session` returns `{}` when `(OSError, json.JSONDecodeError, 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 skills/ppt-master/scripts/pptx_ooxml/edit_safety.py:227— `_positive_span` returns `1` when `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 skills/ppt-master/scripts/pptx_template_import.py:158— `_managed_resource_paths` returns `set()` when `(OSError, UnicodeError, 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 skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py:375— `_resolved_chart_colors` returns `[]` when `(AttributeError, OverflowError, RuntimeError, TypeError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default on parse failure skills/ppt-master/scripts/pptx_to_svg/converter.py:1028— `_managed_report_artifact_paths` returns `set()` when `(OSError, UnicodeError, 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 skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py:838— `_hex_distance` returns `255.0` when `(ValueError, IndexError)` 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 skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:1443— `_contrast_color` returns `'#FFFFFF'` when `(ValueError, TypeError)` 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 skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py:635— `_pct_attr` returns `0.0` when `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 skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:666— `_canonical_native_merge_status` returns `'unsupported-merge-topology'` when `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 skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:1054— `_spacing_points_px` returns `0.0` when `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 skills/ppt-master/scripts/pptx_workspace.py:494— `_transition_relationship_ids` returns `set()` when `(KeyError, ET.ParseError)` 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 skills/ppt-master/scripts/source_to_md/doc_to_md.py:346— `_docx_image_occurrences` returns `[]` when `(KeyError, ET.ParseError, zipfile.BadZipFile, OSError)` 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 skills/ppt-master/scripts/source_to_md/doc_to_md.py:772— `_docx_note_texts` returns `{}` when `(KeyError, ET.ParseError)` 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 skills/ppt-master/scripts/source_to_md/web_to_md.py:1060— `span` (in `simple_html_to_markdown_traversal`) returns `1` when `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 skills/ppt-master/scripts/svg_authoring_view.py:683— `_semantic_text_font_size` returns `16.0` when `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 skills/ppt-master/scripts/svg_finalize/align_embed_images.py:536— `count_office_vector_refs_in_svg` returns `0` when `ET.ParseError` 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 skills/ppt-master/scripts/svg_quality/checker.py:2406— `_roundtrip_source_slot_overflow` returns `{}` when `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 skills/ppt-master/scripts/svg_quality/checker.py:3205— `collect` (in `_inline_text_segments`) returns `False` when `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 skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4711— `_first_slide_number` returns `1` when `(OSError, ET.ParseError)` 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 skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1390— `_conversion_trace_dangerous_normalization_count` returns `0` when `(OSError, UnicodeError, 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 skills/ppt-master/scripts/video_sound_mix.py:232— `_stream_start_ms` returns `0` when `(TypeError, ValueError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch skills/ppt-master/scripts/source_to_md/pdf_to_md.py:943— `_table_to_markdown` swallows every exception into `return ''` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1231— `_find_tables_in_clip` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Silent fallback default in catch skills/ppt-master/scripts/source_to_md/ppt_to_md.py:186— `_safe_position` swallows every exception into `return 0` — 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.
README/code drift docs/rules/code-style.md:166— docs/rules/code-style.md documents the environment variable `UPPER_SNAKE_CASE`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
README/code drift skills/ppt-master/scripts/docs/multilingual-text-smoke.md:9— skills/ppt-master/scripts/docs/multilingual-text-smoke.md documents the environment variable `PYTHONPATH`, but no code, script or configuration file names it. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
Hand-rolled JSON/XML parsing via regex skills/ppt-master/scripts/prompt_audit.py:1724— 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/ppt-master/scripts/svg_finalize/embed_icons.py:174— 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.
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 `skills/ppt-master` (172310 LoC, 509 module-visible types across 22 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.
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.
No src/ separation — Production code isn't grouped under a src/ folder — it all sits under skills/ alongside the root build files, so the conventional src/ boundary between the product and its tooling isn't drawn.
No SAST — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack — this repository has no CI pipeline yet, so run it locally to clear the existing findings, then make it a step of the first workflow you add so a regression fails the build. What was searched, so you can tell an absence from a miss: the 0 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.
No changelog — No CHANGELOG/HISTORY/RELEASES file — what shipped when isn't easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)
Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 19 shipped distribution(s) across 1 manifest(s) (0 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, uv.lock, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.
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.
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
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.
provenance: not applicable — No CI/build pipeline found (.github/.forgejo/.gitea workflows, .circleci, .buildkite, .woodpecker, .teamcity, .gitlab-ci.yml, .travis.yml, bitbucket-pipelines.yml, .drone.yml, .cirrus.yml, .woodpecker.yml, appveyor.yml, azure-pipelines*.yml, .pipelines/, .vsts-ci/, .azuredevops/, Jenkinsfile); there is no build to attest provenance for.
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.
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.
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.
Run 01a171fa-f0bb-792f-bb76-b304fff91492 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 24 · Warnings: 1725 · Recommendations: 60 · Info: 1 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 25-10-2026 @ 07:33 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.