{"$schema":"https://json.schemastore.org/sarif-2.1.0.json","version":"2.1.0","runs":[{"tool":{"driver":{"name":"codehealth","informationUri":"https://codehealth.canine.dev","rules":[{"id":"D1","name":"Cyclomatic Complexity","shortDescription":{"text":"Cyclomatic Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D1"},{"id":"D2","name":"Cognitive Complexity","shortDescription":{"text":"Cognitive Complexity"},"helpUri":"https://codehealth.canine.dev/dimensions/D2"},{"id":"D3","name":"God Classes","shortDescription":{"text":"God Classes"},"helpUri":"https://codehealth.canine.dev/dimensions/D3"},{"id":"D4","name":"Code Duplication","shortDescription":{"text":"Code Duplication"},"helpUri":"https://codehealth.canine.dev/dimensions/D4"},{"id":"D6","name":"Cohesion (LCOM4)","shortDescription":{"text":"Cohesion (LCOM4)"},"helpUri":"https://codehealth.canine.dev/dimensions/D6"},{"id":"D11","name":"Test Reliability","shortDescription":{"text":"Test Reliability"},"helpUri":"https://codehealth.canine.dev/dimensions/D11"},{"id":"D12","name":"Dependency Hygiene","shortDescription":{"text":"Dependency Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/D12"},{"id":"D13","name":"Secret Scanning","shortDescription":{"text":"Secret Scanning"},"helpUri":"https://codehealth.canine.dev/dimensions/D13","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D14","name":"License Compliance","shortDescription":{"text":"License Compliance"},"helpUri":"https://codehealth.canine.dev/dimensions/D14"},{"id":"D15","name":"Churn \u00D7 Complexity Hotspots","shortDescription":{"text":"Churn \u00D7 Complexity Hotspots"},"helpUri":"https://codehealth.canine.dev/dimensions/D15"},{"id":"D17","name":"Explicit Debt","shortDescription":{"text":"Explicit Debt"},"helpUri":"https://codehealth.canine.dev/dimensions/D17"},{"id":"D24","name":"Comment Value","shortDescription":{"text":"Comment Value"},"helpUri":"https://codehealth.canine.dev/dimensions/D24"},{"id":"D27","name":"Navigability","shortDescription":{"text":"Navigability"},"helpUri":"https://codehealth.canine.dev/dimensions/D27"},{"id":"D28","name":"Secrets (history)","shortDescription":{"text":"Secrets (history)"},"helpUri":"https://codehealth.canine.dev/dimensions/D28","relationships":[{"target":{"id":"CWE-798","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-259","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A07:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-798","CWE-259"],"owasp":"A07:2025"}},{"id":"D29","name":"Static Analysis (SAST)","shortDescription":{"text":"Static Analysis (SAST)"},"helpUri":"https://codehealth.canine.dev/dimensions/D29","relationships":[{"target":{"id":"CWE-79","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-89","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-78","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-94","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-77","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A05:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-79","CWE-89","CWE-78","CWE-94","CWE-77"],"owasp":"A05:2025"}},{"id":"D30","name":"Dependency Vulnerabilities","shortDescription":{"text":"Dependency Vulnerabilities"},"helpUri":"https://codehealth.canine.dev/dimensions/D30","relationships":[{"target":{"id":"CWE-1395","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"CWE-937","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A03:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1395","CWE-937"],"owasp":"A03:2025"}},{"id":"D34","name":"Knowledge Freshness","shortDescription":{"text":"Knowledge Freshness"},"helpUri":"https://codehealth.canine.dev/dimensions/D34"},{"id":"D35","name":"Change Coupling","shortDescription":{"text":"Change Coupling"},"helpUri":"https://codehealth.canine.dev/dimensions/D35"},{"id":"D37","name":"Vulnerability-disclosure Policy","shortDescription":{"text":"Vulnerability-disclosure Policy"},"helpUri":"https://codehealth.canine.dev/dimensions/D37","relationships":[{"target":{"id":"CWE-1059","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A02:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-1059"],"owasp":"A02:2025"}},{"id":"D43","name":"Malicious Dependencies","shortDescription":{"text":"Malicious Dependencies"},"helpUri":"https://codehealth.canine.dev/dimensions/D43","relationships":[{"target":{"id":"CWE-506","toolComponent":{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d"}},"kinds":["relevant"]},{"target":{"id":"A08:2025","toolComponent":{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61"}},"kinds":["relevant"]}],"properties":{"cwe":["CWE-506"],"owasp":"A08:2025"}},{"id":"D44","name":"Platform End-of-Life","shortDescription":{"text":"Platform End-of-Life"},"helpUri":"https://codehealth.canine.dev/dimensions/D44"},{"id":"AC2","name":"Forms \u0026 labels","shortDescription":{"text":"Forms \u0026 labels"},"helpUri":"https://codehealth.canine.dev/dimensions/AC2"},{"id":"AC3","name":"Page structure","shortDescription":{"text":"Page structure"},"helpUri":"https://codehealth.canine.dev/dimensions/AC3"},{"id":"AC5","name":"ARIA correctness","shortDescription":{"text":"ARIA correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/AC5"},{"id":"AC6","name":"Visual \u0026 motion safety","shortDescription":{"text":"Visual \u0026 motion safety"},"helpUri":"https://codehealth.canine.dev/dimensions/AC6"},{"id":"AX10","name":"Code composition","shortDescription":{"text":"Code composition"},"helpUri":"https://codehealth.canine.dev/dimensions/AX10"},{"id":"AX3","name":"Project dependency cycles","shortDescription":{"text":"Project dependency cycles"},"helpUri":"https://codehealth.canine.dev/dimensions/AX3"},{"id":"AX4","name":"Dependency direction","shortDescription":{"text":"Dependency direction"},"helpUri":"https://codehealth.canine.dev/dimensions/AX4"},{"id":"ED5","name":"Idempotency","shortDescription":{"text":"Idempotency"},"helpUri":"https://codehealth.canine.dev/dimensions/ED5"},{"id":"M1","name":"Documentation (README)","shortDescription":{"text":"Documentation (README)"},"helpUri":"https://codehealth.canine.dev/dimensions/M1"},{"id":"M2","name":"Architecture documentation","shortDescription":{"text":"Architecture documentation"},"helpUri":"https://codehealth.canine.dev/dimensions/M2"},{"id":"M3","name":"Folder \u0026 project structure","shortDescription":{"text":"Folder \u0026 project structure"},"helpUri":"https://codehealth.canine.dev/dimensions/M3"},{"id":"M4","name":"Documentation accuracy","shortDescription":{"text":"Documentation accuracy"},"helpUri":"https://codehealth.canine.dev/dimensions/M4"},{"id":"P1","name":"CI/CD gates","shortDescription":{"text":"CI/CD gates"},"helpUri":"https://codehealth.canine.dev/dimensions/P1"},{"id":"P3","name":"Security \u0026 performance tooling","shortDescription":{"text":"Security \u0026 performance tooling"},"helpUri":"https://codehealth.canine.dev/dimensions/P3"},{"id":"P6","name":"Release Hygiene","shortDescription":{"text":"Release Hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/P6"},{"id":"P7","name":"Outbound HTTP resilience","shortDescription":{"text":"Outbound HTTP resilience"},"helpUri":"https://codehealth.canine.dev/dimensions/P7"},{"id":"PF3","name":"Async \u0026 latency hygiene","shortDescription":{"text":"Async \u0026 latency hygiene"},"helpUri":"https://codehealth.canine.dev/dimensions/PF3"},{"id":"X1","name":"Async correctness","shortDescription":{"text":"Async correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X1"},{"id":"X10","name":"Duplicated predicate","shortDescription":{"text":"Duplicated predicate"},"helpUri":"https://codehealth.canine.dev/dimensions/X10"},{"id":"X12","name":"Unreachable branch","shortDescription":{"text":"Unreachable branch"},"helpUri":"https://codehealth.canine.dev/dimensions/X12"},{"id":"X13","name":"Undrained process stream","shortDescription":{"text":"Undrained process stream"},"helpUri":"https://codehealth.canine.dev/dimensions/X13"},{"id":"X14","name":"Bypassable address classification","shortDescription":{"text":"Bypassable address classification"},"helpUri":"https://codehealth.canine.dev/dimensions/X14"},{"id":"X15","name":"Unvalidated length from an untrusted reader","shortDescription":{"text":"Unvalidated length from an untrusted reader"},"helpUri":"https://codehealth.canine.dev/dimensions/X15"},{"id":"X17","name":"Uncapped recursion over a caller-supplied document","shortDescription":{"text":"Uncapped recursion over a caller-supplied document"},"helpUri":"https://codehealth.canine.dev/dimensions/X17"},{"id":"X18","name":"Disposal-pattern correctness","shortDescription":{"text":"Disposal-pattern correctness"},"helpUri":"https://codehealth.canine.dev/dimensions/X18"},{"id":"X19","name":"Unrestored process-global state","shortDescription":{"text":"Unrestored process-global state"},"helpUri":"https://codehealth.canine.dev/dimensions/X19"},{"id":"X20","name":"Mistyped argument guard","shortDescription":{"text":"Mistyped argument guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X20"},{"id":"X21","name":"Side-effecting pattern guard","shortDescription":{"text":"Side-effecting pattern guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X21"},{"id":"X22","name":"Contradicted release guard","shortDescription":{"text":"Contradicted release guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X22"},{"id":"X23","name":"Unguarded diagnostic materialisation","shortDescription":{"text":"Unguarded diagnostic materialisation"},"helpUri":"https://codehealth.canine.dev/dimensions/X23"},{"id":"X24","name":"Document value interpolated into markup unescaped","shortDescription":{"text":"Document value interpolated into markup unescaped"},"helpUri":"https://codehealth.canine.dev/dimensions/X24"},{"id":"X25","name":"Inert configuration knob","shortDescription":{"text":"Inert configuration knob"},"helpUri":"https://codehealth.canine.dev/dimensions/X25"},{"id":"X26","name":"Unsynchronised callback handoff","shortDescription":{"text":"Unsynchronised callback handoff"},"helpUri":"https://codehealth.canine.dev/dimensions/X26"},{"id":"X27","name":"Collection changed while being enumerated","shortDescription":{"text":"Collection changed while being enumerated"},"helpUri":"https://codehealth.canine.dev/dimensions/X27"},{"id":"X28","name":"Index access outside its own emptiness guard","shortDescription":{"text":"Index access outside its own emptiness guard"},"helpUri":"https://codehealth.canine.dev/dimensions/X28"},{"id":"X3","name":"Exception handling","shortDescription":{"text":"Exception handling"},"helpUri":"https://codehealth.canine.dev/dimensions/X3"},{"id":"X30","name":"Support guard that admits what it rejects","shortDescription":{"text":"Support guard that admits what it rejects"},"helpUri":"https://codehealth.canine.dev/dimensions/X30"},{"id":"X32","name":"Type resolved by simple name across every loaded assembly","shortDescription":{"text":"Type resolved by simple name across every loaded assembly"},"helpUri":"https://codehealth.canine.dev/dimensions/X32"},{"id":"X4","name":"Structured logging","shortDescription":{"text":"Structured logging"},"helpUri":"https://codehealth.canine.dev/dimensions/X4"},{"id":"X6","name":"Hand-rolled structured-format parsing","shortDescription":{"text":"Hand-rolled structured-format parsing"},"helpUri":"https://codehealth.canine.dev/dimensions/X6"},{"id":"X7","name":"Silent fallback defaults","shortDescription":{"text":"Silent fallback defaults"},"helpUri":"https://codehealth.canine.dev/dimensions/X7"},{"id":"X9","name":"Subsumed condition operand","shortDescription":{"text":"Subsumed condition operand"},"helpUri":"https://codehealth.canine.dev/dimensions/X9"}]}},"results":[{"ruleId":"D1","level":"warning","message":{"text":"builder.create_pptx_with_native_svg (cyclomatic 350): builder.create_pptx_with_native_svg has cyclomatic complexity 350 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6791}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a20c99c636a6734741b465300f5a9a1983274d0428981e113790edd99c334ac"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 311): cli.main has cyclomatic complexity 311 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"02c6d0040a65a129ef55b0f233de7371046ab687500ddc9038fda336b2cd4b4f"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure.parse_template_slide (cyclomatic 128): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"73442702e4e69e4fe4b8844b0fd2846dfda2063ae995f764fd9d0b3a7a1e9f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"elements.convert_text (cyclomatic 107): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9931c42d3a2bf157936f243d5374a680a9ac962f1bc6786747979fab4e581d50"}},{"ruleId":"D1","level":"warning","message":{"text":"template_validation.validate_pptx_template_package (cyclomatic 107): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"a54c339aea9c8c8d5db0d50d3035f6e34d71e7faa678311ec9853a2ad05de2ab"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure.load_pptx_structure_lock (cyclomatic 103): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c906d5c59df1c999f50b4fcf817929aeb6a251f80bc460834af1ac34d62748d"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectManager.import_sources (cyclomatic 90): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"54b6f6b1d60e99e814f8ff221be59d9f90150c71dfbd62cd39691d7dfa4bdfc5"}},{"ruleId":"D1","level":"warning","message":{"text":"register_template._validate_style_spec (cyclomatic 90): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"03f38a87db54398697f070582c30674e410a6e6d16479db795bf5ea83b3287d7"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_to_md.extract_pdf_to_markdown (cyclomatic 87): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"99bff5687d590a07ad73779b8038e355f8d228c37842f52d610f8cc93ac48dfd"}},{"ruleId":"D1","level":"warning","message":{"text":"_LatexParser._parse_command (cyclomatic 85): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"789c957a6793a1a4496d2d45199e09ddd94f8f4bd04760db2c78ef0527a8bdb9"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_planned_image_closure (cyclomatic 81): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8575}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d6a005f583a9be8e4004b5c7cd7275d2be0876f8b7d2e97bd96adced750d14"}},{"ruleId":"D1","level":"warning","message":{"text":"app.renderTypography (cyclomatic 79): app.renderTypography has cyclomatic complexity 79 (threshold 15). Of this number, 17 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4059005232f6577a2a4debb56d34ea098d5ffddcd7794e9445e7f27beb3986"}},{"ruleId":"D1","level":"warning","message":{"text":"converter.convert_svg_to_slide_shapes (cyclomatic 77): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"c52460af40d2381af2059e6ed7a2080bf382947fe43e5869280c1cbc6bc36f66"}},{"ruleId":"D1","level":"warning","message":{"text":"image_search.main (cyclomatic 75): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3f3f999c631790dd4d9714740aae2ffcc825b439b8fef98771da3d41b41dad9"}},{"ruleId":"D1","level":"warning","message":{"text":"converter.convert_g (cyclomatic 71): converter.convert_g has cyclomatic complexity 71 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6602c6ccd6370abbea23a81486e8c29d673eed465953e881766662eb8db3f3f"}},{"ruleId":"D1","level":"warning","message":{"text":"image_gen.load_manifest (cyclomatic 69): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"6aba25a08d495449cb5b555e99e93508f1e5501da06077afd5d85b663cd0e2af"}},{"ruleId":"D1","level":"warning","message":{"text":"notes_to_audio.main (cyclomatic 68): notes_to_audio.main has cyclomatic complexity 68 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/notes_to_audio.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac9af204d0f0651681259d34ef91a2af2b06921610700757cd53d4bb0e425230"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._apply_roundtrip_slide_overlay (cyclomatic 66): builder._apply_roundtrip_slide_overlay has cyclomatic complexity 66 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"50383c3d6d46315f74ca85d2427548e41aac361f1d813fd9a6f927cd18c4f75b"}},{"ruleId":"D1","level":"warning","message":{"text":"manifest.build_manifest (cyclomatic 65): manifest.build_manifest has cyclomatic complexity 65 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/manifest.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"69286d19a4b0c26dd81b5235450ed32ddad5cd4a167032cfbe725d91a8b48a9d"}},{"ruleId":"D1","level":"warning","message":{"text":"ln_to_svg.resolve_stroke (cyclomatic 62): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbae91be78f1fc5c06843a41c5b2d667d6142f9f2019f5e5dca250a6cc36581d"}},{"ruleId":"D1","level":"warning","message":{"text":"checker._local_pptx_structure_errors (cyclomatic 62): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a0a6d4323ca1f1349e974f7d304b0b6123d26e7e09a2faffc40f114d09e5af9"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_spec_lock_alignment (cyclomatic 61): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fa9d1f61cd29227a6667a9ac1c1d619816a0130fa1b705eea552b090e3966ca"}},{"ruleId":"D1","level":"warning","message":{"text":"slice_images.slice_sheet (cyclomatic 60): slice_images.slice_sheet 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/slice_images.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae51508120ccd6a37356a65a46aefb4c8959d5243a1751f2e352550caa3ff6b"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker.check_directory (cyclomatic 60): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8f5f99132fb3967a4402ae4032d96b4b1fa5ddf4c7dbdce954119ff8916606"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt_audit.load_manifest (cyclomatic 59): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"7939ca283bc3e8a92a96a7024003bd80be244eef228fe415abe54f930ae8ed25"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_delivery_check.audit_pptx_delivery (cyclomatic 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b900a62243423096ddce6fdf2537985def0d2f65453450fa6cce3992bcbe3d0"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/cli.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9fbed1b14518433042905e78940f9eaaa57a1d3a1bc30a44239cfec297c17b5"}},{"ruleId":"D1","level":"warning","message":{"text":"table._build_native_table (cyclomatic 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff793bca9855f55108b8e820e76b7b61ee7b3fe07bc52a4a75a10ab92c4f488f"}},{"ruleId":"D1","level":"warning","message":{"text":"authoring_roundtrip._load_documents (cyclomatic 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"71f4e0c9fb8d65a5ea0214676356c46aaf927f41a1ac9343e6f24a097d05ee2f"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize.materialize_mirror_template (cyclomatic 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7171f8edddc13454081f31e12a74f426e9bcb74f2a4eded878ce1915771cf9c"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations.validate_slide_animation_structure (cyclomatic 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e0db84cc888b472310b01e65250a633c4fa6a2dff381352676274f4bbd4bcea"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._axis_config_from_xml (cyclomatic 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16b9636f2eadd1a536cc57fd0efc685b8eea6def5af473e44e9b509e2be5d6a"}},{"ruleId":"D1","level":"warning","message":{"text":"app.renderImageDirection (cyclomatic 55): app.renderImageDirection has cyclomatic complexity 55 (threshold 15). Of this number, 29 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ad48622b6cc424592a36feacc503d8dd989029091aa9ad544cba76334d9672a"}},{"ruleId":"D1","level":"warning","message":{"text":"ppt_to_md.convert_presentation_to_markdown (cyclomatic 54): ppt_to_md.convert_presentation_to_markdown 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"16021fd347b7569a0ee42aac83eb3d30bc081a6230c6b058fbb7df9f953e4d10"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure.load_native_structure_contract (cyclomatic 54): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2cf7360d20981e31eb8ce711ffd3e478cb5413cdd3c5cbe36e2cf6b9a48582a"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._parse_preset_geometry_metadata (cyclomatic 53): elements._parse_preset_geometry_metadata 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d55fd224fb3cd25781d9166e6f70d89c3773ae6e45220e252bbf43b8b0aed3"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_data._chart_axes (cyclomatic 52): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1aab0cecaf1bd13badc7f89ff8d21abb4acfc2be3bc07a96b77ec9ee2fce268"}},{"ruleId":"D1","level":"warning","message":{"text":"inline_formula.inline_formula_marker_errors (cyclomatic 51): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/inline_formula.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3536c30ece6202e65f2d00c5eb73167b76f557bebb3cdb167913d68932e3509"}},{"ruleId":"D1","level":"warning","message":{"text":"slide_to_svg._convert_shape (cyclomatic 50): slide_to_svg._convert_shape 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b24911b270c13834cffdc2514c66296e6a1209ba021584276e1c6dd11859801"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg.convert_tbl (cyclomatic 49): tbl_to_svg.convert_tbl has cyclomatic complexity 49 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"6698ebad171f68de6d5973d6c4ebcacfbb7b45ad0e68cfeb5fba21981fd05a4d"}},{"ruleId":"D1","level":"warning","message":{"text":"image_search.promote_candidate (cyclomatic 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"38a7f4f3b68c0f277a79ede9add709cc9b0dbebdf3275590d72751ecc20f3952"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_native_object_markers (cyclomatic 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6023}}}],"partialFingerprints":{"codehealthFindingId/v1":"164410788100779f17bcb913f9d31904d9800c84431bb539dbad7ada6ecbbc0f"}},{"ruleId":"D1","level":"warning","message":{"text":"authoring_roundtrip._materialize_document (cyclomatic 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"a13951081438ca05725c7e1b9c884908c015cab68b6dff271393fba82007e278"}},{"ruleId":"D1","level":"warning","message":{"text":"preset_authoring._validate_expanded_authored_preset_group (cyclomatic 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8d51d4eec3100871989e81e674b018b59c9ef52fb168f17761ec31af3347644"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt_audit.audit_registries (cyclomatic 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f936f61643388537bf7458c43d5ae80fa748de37a51331abdb1c7cea68310c"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.project_filter_errors (cyclomatic 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d275da98849ec11ae596341cb6a3c4acb90693fd6da17b42150e897390e6595"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_import._serialize_node_content (cyclomatic 46): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/formula_import.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"5667d0227625e609b985e2d59a94a790af4fb4e8476d16456fe7b2be022f8f83"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure.template_prototype_errors (cyclomatic 46): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"22afb2ffa0699d81127d604759637821377cff5345141e3489e491cee1dd15ab"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._positioned_text_lines (cyclomatic 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"db929caadd3724d15b447fa5b21fc4c9b5afc17532fec9b47f8b20ff0c1252e2"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_pptx_structure_contract (cyclomatic 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7561}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b44bb108720ae4d82efb9a91471c3f16f107d537dd7101d681b402c55d58e08"}},{"ruleId":"D1","level":"warning","message":{"text":"elements.parse_project_nested_svg_crop (cyclomatic 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c2cb240c12dcb7b886726c734905c628b610c4182dc4bbd0b43ba6f0367079e"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_omml._validate_math_structure (cyclomatic 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf8f9fedf64fa07c923b9f693fc4a6a82db43a0fb21fc9f4a0df1eab9266076c"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._roundtrip_passthrough_candidates (cyclomatic 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"984acfce548a7ac40e87ac05d7f45f646a7f21b2edae053d65cb378831388e9c"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._compose_template (cyclomatic 44): mirror_template_materialize._compose_template 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"26e634a31cb1be7e22856344e3849be95f6a0fde5dc17ad741688b36a239e988"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._validate_chart_semantics (cyclomatic 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"558f09adb46685f2a637c86ac3328187c4d6e62b595e5d92b603cbc4d71e5659"}},{"ruleId":"D1","level":"warning","message":{"text":"_omml_latex._omml_to_latex (cyclomatic 44): _omml_latex._omml_to_latex 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_omml_latex.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"623c75e4644a61bcb4cc4324bca1b3f4053b0f204c48cc81ea71cd8c12a85e1d"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_config.validate_animation_config (cyclomatic 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a7781d9b5e081510707b41e9dd9d90fde0de6f5b84979e97261820827ac8617"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._build_sequence_targets (cyclomatic 44): builder._build_sequence_targets 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":5908}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc8cf11a13ba2cfae36483417d8bb5848251be215f9a5c8e08347d83db75761b"}},{"ruleId":"D1","level":"warning","message":{"text":"cli.main (cyclomatic 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd11aefb0c4f001bf1e76ecff3d75e4ae4bc690d6521fd73134281a352d7f5af"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.project_marker_errors (cyclomatic 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"da8f9d15c88bb7583625ddb4809f540e80c94e65b71e12cc2b29dc0a6ee02071"}},{"ruleId":"D1","level":"warning","message":{"text":"app.rawMoveAttrs (cyclomatic 43): app.rawMoveAttrs has cyclomatic complexity 43 (threshold 15). Of this number, 24 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"314e220e237079312c5751c540551d78d4e15a65c759c48cbebd06c12557899a"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._apply_series_formatting (cyclomatic 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ef97507154b78c489e5c08c8fb743f18e4cc4d3eb2f77efbfca870cdfe88bab"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_workspace._sniff_resource_format (cyclomatic 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"2382cdb33973fc2a812f1501895429bafb337d6e0ae159609d4ac5b6db33ddc0"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._promote_common_chrome_shapes_to_masters (cyclomatic 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4543}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b3f5788eaf7a9be83035241fdcfc2537f0aa02281def4eb0b8a3539c992b9f"}},{"ruleId":"D1","level":"warning","message":{"text":"app.boot (cyclomatic 42): 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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4528}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e41ec00765b158e72c7e4ae57b9dd136a3cd6be25cc1e5f1d9bddd12105325d"}},{"ruleId":"D1","level":"warning","message":{"text":"server._validate_template_selection (cyclomatic 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec2a8598001aa7e40dddad0c254b5d9fd11894b57956e54726090a7cabfc28e3"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations.validate_generated_animation_xml (cyclomatic 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"216e2ce956cf28172f29976d273de8ed62014e9d7ad33d6b230e5646dc7087cc"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.project_gradient_errors (cyclomatic 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"38049d762a8fd464231f440323f53cbb9b752bf28aaac9abbb890d19ea9c685d"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_patch._patch_workbook (cyclomatic 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed2793a78e747835795899074a5f23aa87cc2dae542986ec9799d3db1b063e01"}},{"ruleId":"D1","level":"warning","message":{"text":"video_sound_mix.mix_video_sounds (cyclomatic 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f45565f3e64c5872d56500acb67b40afebc973416d4024531001110089142aa"}},{"ruleId":"D1","level":"warning","message":{"text":"hyperlink_contract.project_hyperlink_errors (cyclomatic 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/hyperlink_contract.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"dea9c4b83c7692295ffb8319df0ca665a7c147daf838ce3e52412db631ebe3ab"}},{"ruleId":"D1","level":"warning","message":{"text":"narration_sync.rebuild_animations (cyclomatic 40): narration_sync.rebuild_animations 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d91378241eb5f9b3853d988c5b813beeb9fabff234ac77c4b1f678d2f0f6f45"}},{"ruleId":"D1","level":"warning","message":{"text":"preset_authoring._validate_compact_authored_preset_group (cyclomatic 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"430d1557181fe1e1ff6cea443244e655e25554c7e94263d976b3309c8627c4d3"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_module_bounds_contract (cyclomatic 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4617}}}],"partialFingerprints":{"codehealthFindingId/v1":"91d7d916576780bfc8693f207b6135891f05492982a227624b1047e9c4ece4f2"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.project_paint_reference_errors (cyclomatic 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"d726a6da075541d4fade8996cfdd1d76654a33839c6830253c21b37de602bb04"}},{"ruleId":"D1","level":"warning","message":{"text":"image_gen.main (cyclomatic 39): image_gen.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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"49d92e126fdd64fc00fc0f79fd4f9cfec59f215f1261e1562f12e63b239ca05b"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations._read_effect_options (cyclomatic 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"32037f1f7e26e091c9f44e2f739c9a47bbb0608ecd6e5d84dde5f14d3e0db811"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._text_body_has_unsupported_formatting (cyclomatic 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"822e9a0ed7d93467a5d3496a8d5de75521782dafd879f5d668e132b3ac4506a2"}},{"ruleId":"D1","level":"warning","message":{"text":"_markdown_links._target_spans (cyclomatic 39): _markdown_links._target_spans 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_markdown_links.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff9537bab45a05138c7c1326f4f42483515169d5dfe107e4dc18d9b18dc96ae3"}},{"ruleId":"D1","level":"warning","message":{"text":"flatten_tspan._classify_paragraph_block (cyclomatic 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"f496ef9825a91450363fb851a61ec5fabb460ba7f1613c29a3299a852a968e13"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_position_calculator.main (cyclomatic 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f69aef0051da7e8c0feecd4bf9860e31d0a6ae8052e44fd268410df6a2a1b2c"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_config._animation_parameter_errors (cyclomatic 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"0260e209413f7da3de57f0d5f55f9d76a3735459c52ed5fab043ba601a045c14"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations._load_native_animations (cyclomatic 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"4acf016441a4fa32ca29f3642f06b1618814efd567b81e1f6842dceaf75ab6b4"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_text_bounds (cyclomatic 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4816}}}],"partialFingerprints":{"codehealthFindingId/v1":"860acb353ff593ab2f020482302256c6d1685db203f5c28178e0b4e16799bf8e"}},{"ruleId":"D1","level":"warning","message":{"text":"server._stage2_design_directions_error (cyclomatic 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d414495110905a4974a7d707afe8bfcb6ecc1372daf7e198c03cacf55391252"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_workspace.workspace_resource_specs (cyclomatic 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"8315347460419828c2cc7e2f69a50c410cbd7b3786240e12010a2f618b27890b"}},{"ruleId":"D1","level":"warning","message":{"text":"app.initStage2State (cyclomatic 37): app.initStage2State has cyclomatic complexity 37 (threshold 15). Of this number, 34 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4073}}}],"partialFingerprints":{"codehealthFindingId/v1":"28ad2c556d8c4971fffe21a2230c2ad34aa3fe52694b90440faacfaec839a75a"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._combo_payload (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da311aa3c9715b80d1d813be025fc12c30f64a3aca58b88a439bc486dfc289a"}},{"ruleId":"D1","level":"warning","message":{"text":"normalized_chart_svg._render_xy (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9662d3a38c2f701f58a1c19300edee1b1ecff078e1fa9a556d174658b5e141a"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._direct_border_payload (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"723e88282191b985b7cfe17069f01c60462662cae089499b183278d56a577c13"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt_audit.audit_schema_grammars (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"71e852b5054f9c68ff0e0fa06ca2d334b6350a6ecfc319ca353e36a3b92c0332"}},{"ruleId":"D1","level":"warning","message":{"text":"marker_status.native_marker_status_errors (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_status.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c04dfaf6cfe923620bc00afb3b99ed8b16d5c8fa27a8ebb0ee6ae6d223393fe"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._roundtrip_slide_patches (cyclomatic 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bb3e87a6fa056b28d155a676c32453141a5ec104bdab20d185df9437130828"}},{"ruleId":"D1","level":"warning","message":{"text":"app.enumField (cyclomatic 36): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"8885bdb9da735c02b57c9d31d4657a2c20a6f1be3d49c9677f9f0e7105154623"}},{"ruleId":"D1","level":"warning","message":{"text":"image_treat._apply_treatments (cyclomatic 35): image_treat._apply_treatments 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_treat.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"554ffed536cd5432b07b6db5d67f7e514c3cb8879765e498feab4eaa55035131"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._apply_chart_metadata (cyclomatic 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf17a0f408f80c482e8abac879f77ea05e584caef3845aebbb663ec4f00ffd5b"}},{"ruleId":"D1","level":"warning","message":{"text":"register_template._validate_brand_spec (cyclomatic 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"8dba6c2b4f46c402be52ebf7ac75a3601c4e662eb6431af16aecece7863f8330"}},{"ruleId":"D1","level":"warning","message":{"text":"source_to_md.dispatch_many (cyclomatic 35): source_to_md.dispatch_many 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3cab7f54964a0d30855ecbfb79b1af78307ac4ae24715a639f1eea6850e9a9"}},{"ruleId":"D1","level":"warning","message":{"text":"flatten_tspan.flatten_text_with_tspans (cyclomatic 35): flatten_tspan.flatten_text_with_tspans 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"cff3a4ff57b2a0b4c3f76373174f23af453bfb8b9a92e9e31e1c115f52decc56"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_position_calculator.interactive_mode (cyclomatic 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"14c25f586298497d9170e387266a125cec3e11e0ce9e84d23a81c5aae593dae4"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_template_contract (cyclomatic 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9189}}}],"partialFingerprints":{"codehealthFindingId/v1":"49efb46fb942fac26454f8b969df1b8817c0d302fb4c34a1e2b2ecdf123e1e9f"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._opaque_roundtrip_dependency_owner_refs (cyclomatic 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"99a747c49d496fa55d341082c11bc9740690878ce10d0f1a825e6cb5d8b713e1"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic_markers.validate_semantic_markers (cyclomatic 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/semantic_markers.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab7c77ff330e3e1102dcfd7ff3e0ad5bd27f77cb81cbb18085e00858ecfc99f6"}},{"ruleId":"D1","level":"warning","message":{"text":"app.initKeyboardShortcuts (cyclomatic 35): app.initKeyboardShortcuts has cyclomatic complexity 35 (threshold 15). Most of this is not in the body itself: 1 of the 35 points is its own statement and the rest belongs to 2 function literals inside it that branch (lines 1555, 1575). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"379df55947cb0ea6a20946ac35df57762b5739eb915efd82d4a1f81d63780ed6"}},{"ruleId":"D1","level":"warning","message":{"text":"image_search.run_search_manifest (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c155c4c3bbfc5583ac7186418a9dcdfe557bd1fd55ac709c7184cee49f9f9d4"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._validate_stock_semantics (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0f85c46ca00fb5cf5cf8050b51bc74f57c6b281a4480599d677564dd98d2aa7"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._apply_chart_formatting (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"830c4646f64fcd0d29fb9c10b99f41697c52ccf08c447f02e894e85229b0603d"}},{"ruleId":"D1","level":"warning","message":{"text":"register_template._validate_svg_template_spec (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"50e4d2b52039531fc9eac1e6252403e31c23adf625575c58ab18a2fe7c62fe59"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_image_references (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5259}}}],"partialFingerprints":{"codehealthFindingId/v1":"febf0fb3a3caf00ad2263234cc8250793ae54c6a544a914aa52bdd9f905fc344"}},{"ruleId":"D1","level":"warning","message":{"text":"styles.parse_pattern_colors (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"53231063d8f3efc5482a3883f0ef451a59d5723932bc20d6c50349d18f1c0451"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_omml._append_node (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73e629efd1007ee499ba9d969a87b052d5702b50be409c2c20fe0e8a28b6366"}},{"ruleId":"D1","level":"warning","message":{"text":"_ChemParser.parse (cyclomatic 34): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"1cf7664ee1e6ed294241550b6a3dc7fb8ee2ade4358249e6ee41b279254f7088"}},{"ruleId":"D1","level":"warning","message":{"text":"app.normTypography (cyclomatic 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"d420e35ef710691f086c53c3227653e84094f81cdc73e93e1f53b88a3def980a"}},{"ruleId":"D1","level":"warning","message":{"text":"image_gen._run_manifest (cyclomatic 33): image_gen._run_manifest 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eaad99837ddb1528a90c6b7c984ea59a67c31b7392679c1edcd2a57d3da0741"}},{"ruleId":"D1","level":"warning","message":{"text":"language_tags.normalize_language_tag (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/language_tags.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"3dcab5ce35da41f9e76946cc65682f4fe394a7fdbcb18bb39c006f4a3087c828"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._validate_graph_roster (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"24cb665b3ed6db2ef26df62903677335d8e1fa0c00dd1bd2559cfc661d08d3c4"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._data_label_text_style (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6915897da02fea3f1423355cb2a1c439aa33e356d50b65ffdb7e018676699a4"}},{"ruleId":"D1","level":"warning","message":{"text":"converter.convert_pptx_to_svg (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6dea8da6ffff63f1831da57eafc7bc29c8eff0f1bdf8c63cafb27c94cef211d"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_authoring_view._is_semantic_shape_candidate (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"d00256b4e9cf3ae9c5528287f042b0452702778e69f2f193b9fd06768da2b8be"}},{"ruleId":"D1","level":"warning","message":{"text":"align_embed_images._process_one_image (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ee4ff93d09715d77f1d2c52218b360d81330337dcdbdbf5386ba094efd5e989"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_roundtrip_text_frames (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b22a64bc7f8fa2eed4e945a448280d897d1d13e26c748f8b361ec738a8a87c"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_data._combo_chart_data (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bb254638354129f8e00c2783b8adf84763063749b2443f40d455f269aef7e1"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._promote_common_chrome_shapes_to_layouts (cyclomatic 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"c640d4a5f97dbd182e3cfe46904818dac38606d8a8141a5aa4392a631a880adf"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_transitions._validate_applied_motion (cyclomatic 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc47b759e45a58207991b922989c8772097821658f85270a7d64509a0cf72625"}},{"ruleId":"D1","level":"warning","message":{"text":"source_to_md.dispatch_single (cyclomatic 32): source_to_md.dispatch_single 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c34262035a3a6dcdadf6ff14145bc575ca43c19e8d0301f259fd9ab81ffc890"}},{"ruleId":"D1","level":"warning","message":{"text":"crop_images.process_svg_images (cyclomatic 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/crop_images.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b9cb02c1a00a33ca4d05927ef3883f1b219862b4240dd23376b545ef00fdd09"}},{"ruleId":"D1","level":"warning","message":{"text":"table._native_table_border_topology_warnings (cyclomatic 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca4bf94bea67aa2f8c3c75a7e92a490f049c681dc90561d3dfe4ee14b6410636"}},{"ruleId":"D1","level":"warning","message":{"text":"app.renderColor (cyclomatic 32): 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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"39489a712f0ae6a19458d0b8cd63cddade5d77691a20e74ebb23d2faf37ba773"}},{"ruleId":"D1","level":"warning","message":{"text":"finalize_svg._process_candidate_directory (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/finalize_svg.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"b932b6cdd2bf7a33ea09c478411b5ed6fd96297860b837e4c4c4e18377c37a13"}},{"ruleId":"D1","level":"warning","message":{"text":"narration_sync._resolve_animation_groups (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"4eeba06c787337c41f9c4795dcaa46dc95ff340fda54624f102dfcc4cd3d35a2"}},{"ruleId":"D1","level":"warning","message":{"text":"page_context.build_page_context (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/page_context.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec688c0d0e51297195f633d7ea9481a6db7008dc98277e738e7b297561780c05"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt_audit._registry_ids (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"a93041a4e220457fd72461e6691ada4c7aa978c8bed7839a7b6783c73784100a"}},{"ruleId":"D1","level":"warning","message":{"text":"web_to_md.element_to_markdown (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a9e825b8de5bcd8134fb9b5c06b8f35ea14321e2c7adc24a1608837e7d414c9"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_authoring_view.main (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"07dabd9ab10e8b8086868a06ad24293d99747bdb022b881c50490823a5c4b677"}},{"ruleId":"D1","level":"warning","message":{"text":"server.main (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"48fe6625299a5fcd9bedc47e8f9e2a45411d278bf04dd350425fffde720d5d99"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_preset_geometry_metadata (cyclomatic 31): SVGQualityChecker._check_preset_geometry_metadata 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5514}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31eaa2929f5bb7f6140d44cc50d4524e4326f0f670127d29a7f95b523a3b19b"}},{"ruleId":"D1","level":"warning","message":{"text":"slot_capacity.slot_capacity_report (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/slot_capacity.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f0215ca4705913ee835f5c6df0c12e2a83a3d9f42c8c16358ce6677e9103fd3"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.is_stroked_zero_axis_shape (cyclomatic 31): utils.is_stroked_zero_axis_shape 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"063a320b62c2ab063034c23c53a18fe11e56f28954a51a522161baff414aa9fb"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_xml._chart_plot_xml (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b110f0a59bb89750ee81d0b06069e92c5822eac2f9eb00a391d606748b32c1d6"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_cosyvoice._word_boundaries (cyclomatic 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a59843e79b538d260a308b6da0ef3e4a4883e84e3aff33495ee269446ee94277"}},{"ruleId":"D1","level":"warning","message":{"text":"app.renderDesignDirections (cyclomatic 31): 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, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"f22f5b4f7d58a79868360c646c8562548006df1c20922cefe0e01e256527887b"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._canonical_title_paragraph (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0f48e95acbef5f8bc51c7e7d79636a3c5a04526dcb4c4eeec9b0dabfc190ca"}},{"ruleId":"D1","level":"warning","message":{"text":"slide_to_svg._build_geometry_xml (cyclomatic 30): slide_to_svg._build_geometry_xml 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cea68e32e493c3ea76b39f716533441919efb3ac1853be6cfe860570164829a"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_transitions.validate_pptx_morph_pairs (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"1fd98549075748d126b64cfbd1f6021265feec6390332f447d9122ae9fee1a60"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_transitions.validate_slide_transition_structure (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbeed5eb090f04288c7bdef3684c2b002dd6b6e0c6724517bda4577a3955b089"}},{"ruleId":"D1","level":"warning","message":{"text":"checker._compact_preset_ancestor_paint (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"fba75140df7c6db342c60c9164897dcf274639b0aba0c2efc02e1022a6fd23c0"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._clip_preset_geometry_error (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":3895}}}],"partialFingerprints":{"codehealthFindingId/v1":"d594fff3014668088d2cfa456953ca796b204fe36a8a6aac4858a86532a74906"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_ast._node_vertical_extent (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"f991b2025918b763648d4ee336d2dca47c80bae8b18736c4a39eb74ff052376e"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_omml._validate_xml_tree (cyclomatic 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"efa133b16916a0ef30adc25d05d59ac85a091012cf19d07586f45ad748dfa5ed"}},{"ruleId":"D1","level":"warning","message":{"text":"image_search.search_and_download (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"00392445603fc98559cb2dbc3a444a843b8713b9342414093372bbef9f043fee"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations.normalize_animation_effect_options (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ecacca2dc08668d69e511da9a18be213df57408e3f72a67519ea9ff66075a55"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._payload_from_chart_xml (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"32f82ad7127e08d3be6de695268a4628669809321c6966beffd41a0cbac692e8"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._effective_scatter_style (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d2767367ad38b04b462defd4ce1b92ef8bfef00a03bf5d540a402528e37cb2b"}},{"ruleId":"D1","level":"warning","message":{"text":"excel_to_md._convert_excel (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/excel_to_md.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bd7c49830257613ec89d9dc4259b3aada97d3acbf8a496f1d99025040d823de"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_omml._append_run (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"58239feb5c5ab57fb41bf27a847aba0d767d341f7cf959080419497c72e0f59e"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure.template_prototype_lock_errors (cyclomatic 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d71e7385c6d2fd4a1b010a2d4dd158333bb11a162309782c6d709f0f88ddcb9"}},{"ruleId":"D1","level":"warning","message":{"text":"server.main (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac54a969be6351ddae33872812599ea67321be85064d01c2cfc69fd7778dd82f"}},{"ruleId":"D1","level":"warning","message":{"text":"clone._remap_slide_jump_relationships (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf81aece546b497d482b9d16fa13324cc15dcffa1b33325973ff31fa167efc18"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._docx_inject_tables_markdown (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3243a471d1afba0e4b31960849b28df0efe81cf312550a906b8478d902d3477"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_illustration_resource_contract (cyclomatic 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8018}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfa886ac0396785cead5a8af5aa395d09f882ec01b86e13aad1e72c5a3cc9fff"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_svg_assets.extract_file (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"9305516260b4c4ccab6d0bfb97623fe81ecc338540cd2516a8d8860463b238f3"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_svg_pictures._run (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_pictures.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"5042e18eb8c1d84148a25179267faa9b698eccadd36c65fb74c61f60a16cadac"}},{"ruleId":"D1","level":"warning","message":{"text":"native_payloads._load_store (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/native_payloads.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e7c45db5963b1c405542e0636fe5d71454357a5b903daced8ee10b41ab232d"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations._row_offset_ms (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"87efeb0627c21bfb5ab8945772f076dd694aef021c3ad7a1b6115bd6f1c892c6"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_delivery_check._motion_and_hidden_summary (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"25662e662e38667117ab403e4078a8394abc7e2a0c8116a3372d8f5daacdb1c3"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._write_artifact_tree (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a3bdb056c8d768f44650dbcbc0dd2b815d20a4a52ba683bc25f2b858dc644a6"}},{"ruleId":"D1","level":"warning","message":{"text":"project_utils.validate_project_structure (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"d28e7260bbfbc9b791c439b121731bf4d9b45085b9845f8763aefae04387a303"}},{"ruleId":"D1","level":"warning","message":{"text":"_markdown_links._block_mask (cyclomatic 27): _markdown_links._block_mask 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_markdown_links.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e748199ee04a9801876102b1c6f680a7ef72e5f6a42ce50aecaf985eaf6a65"}},{"ruleId":"D1","level":"warning","message":{"text":"web_to_md.find_main_content (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"45c585f526246c62420c425726796d8a25ab6a69a7ded60b2ae8943ff107002b"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_xml._axis_pair_xml (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"c43a1f42d6d99fc5f4dfe433ed01554b65c52004554d5895a78c2ffaec6b35ce"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_ast.formula_node_count (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9e951fd531d6deffa907d075a592f2b9a52ce4449558fe462a69ebf8d434f78"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._recorded_narration_on_click_slides (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b1774f40257dbb5a4c32d994a32d54a8f47926e8914b02069d1507c1705a9a0"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure._placement_lint_errors (cyclomatic 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":3675}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e193891469ee5b36ee553e0e2a9547d19483ebe1f8365dd7f0f8b7627c7766"}},{"ruleId":"D1","level":"warning","message":{"text":"app.directionStateSignature (cyclomatic 27): app.directionStateSignature has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"719365f916724ff2907e57413a3ce86906e21dd61296860730cb8e32baff7135"}},{"ruleId":"D1","level":"warning","message":{"text":"app.selectSlide (cyclomatic 27): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d3e92a88063d6bfc2333e3b28ddb97da10dc5741264d1d4dfcfca5c073c1dcd"}},{"ruleId":"D1","level":"warning","message":{"text":"app.promoteTspanDom (cyclomatic 27): app.promoteTspanDom has cyclomatic complexity 27 (threshold 15). Of this number, 23 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2509}}}],"partialFingerprints":{"codehealthFindingId/v1":"599488d711c7be4ce7955252dc406be0bc8cc39a212919053a740bd40a3ed95c"}},{"ruleId":"D1","level":"warning","message":{"text":"beautify_inventory.main (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/beautify_inventory.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff4147cfef7c6c6412bf81ce0129eb5b6c41f102c7a220b050ac2567e8e664d2"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_common.fit_size (cyclomatic 26): backend_common.fit_size 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_common.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"52cc318920083f583032931981222b22c2afaf1fa718c43456005bd7b11a4695"}},{"ruleId":"D1","level":"warning","message":{"text":"image_search.load_search_manifest (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"87696d46d6d7ab0612779db79bf9dd5460eb0547c4cc3e9d50175ed67b5cda8d"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._load_authoring_documents (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e9d4ab556b27bef40658eca7e18752452d000b1ac6604cc1c058dec2784d52d"}},{"ruleId":"D1","level":"warning","message":{"text":"native_payloads.hydrate_native_payload_refs (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/native_payloads.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"f53b15c070179a7e7c9f99fda1ff348c05dc238798343e4b5388ad830fda25bd"}},{"ruleId":"D1","level":"warning","message":{"text":"notes_to_audio._expected_note_roster (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/notes_to_audio.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"35802b72e62cdee30a39bd1799b0f85884d2d45e6faaef16386aaf1a772a1a9b"}},{"ruleId":"D1","level":"warning","message":{"text":"normalized_chart_svg._render_lines_or_areas (cyclomatic 26): normalized_chart_svg._render_lines_or_areas 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"57d2cf2d1130b77fea5a4f974960154beeffde16aae1cc5c131abeb9786b7f9a"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._canonical_native_merge_status (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9f3577528722423a10bb22fc26a4fe5d7475190bdc26c86f95cb7408f3da402"}},{"ruleId":"D1","level":"warning","message":{"text":"ppt_to_md.text_frame_to_markdown (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"f91162518fb89038b2ba7814fa69c2ec5cd65ea4a8d27e74672a17796f3f8972"}},{"ruleId":"D1","level":"warning","message":{"text":"ppt_to_md._category_chart_to_markdown (cyclomatic 26): ppt_to_md._category_chart_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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8273f044ee7d7d8a656648cd73c3f8ba4c91a7dec6821ee8fc9de93c3ba0231"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._build_run_properties_xml (cyclomatic 26): elements._build_run_properties_xml 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fc54258b2773d06170665948c4cfa0d512c6b17e82c1dde2ce5eb68a48aaf25"}},{"ruleId":"D1","level":"warning","message":{"text":"utils._transform_semantic_error (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"6df58405aaf814fc709c87a31169aba9e4944555bbc0f9ee57dd67a5045f55c7"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_patch._patch_cache (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c9782bf6d088a5ea6dd6d70ecf2ed4070a822ed3246c4d6bef57e5a1dd3ef32"}},{"ruleId":"D1","level":"warning","message":{"text":"text_measure.main (cyclomatic 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b40ab6b68d9dc5b0d9f8b0187fa23de26e1397d8c8169e08700372478887c36"}},{"ruleId":"D1","level":"warning","message":{"text":"authoring_roundtrip._load_page_plan (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"eefd8247ecde6ad91d56ef2ba4bdefae7684dda9b958166a03e49bbaeed346ef"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_svg_assets._optimize_definitions (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56ce33e384deff74f4c9f4c8f9b7536c3a24b18ff6d0154ee74307793e19967"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_openai._edit_image (cyclomatic 25): backend_openai._edit_image 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"8080f5bff88b91629d908d4a001b8d067e1afce61247b3d7b0fbbfb91e172836"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations._set_effect_option_value (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"788ac9ab1590c09bce380cdf65682cae91e94436023ce58312136e60960890ea"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_template_import.main (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_template_import.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeaa13c8e4e73406e2a34d806accf4c20b145f9bea922e6fd16ddb2fce45844f"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._managed_report_artifact_paths (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c9f6445b062b8e0e729cbb85dd571b1e363e0571d7079030ba7c196e1bfc86"}},{"ruleId":"D1","level":"warning","message":{"text":"pic_to_svg.convert_blip_fill (cyclomatic 25): pic_to_svg.convert_blip_fill 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c0954479378130ea4811725b6b0b4fd7f02ee86d20d18d83737f26c47b31f4a"}},{"ruleId":"D1","level":"warning","message":{"text":"slide_to_svg._roundtrip_chart_package (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5bfe2d429cb99768d43af75bb68d175ea7bd891779ae77809f870b7981b58c1"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._convert_docx (cyclomatic 25): doc_to_md._convert_docx 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a2d6bbfa2ae3263bb409154c84585056365d34fb3d12190ae80b666b3fb2100"}},{"ruleId":"D1","level":"warning","message":{"text":"fix_image_aspect.fix_image_aspect_in_svg (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"135e9f9a9f21ede1ca5f1e0d38215e91751589a73d33b10102d75246bb49cf7d"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._roundtrip_text_frame (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"daac8d9fea66d9078231e2236fd564070e178f6bd4bd64fb592c22d1dd6253f3"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_config._morph_scope_errors (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"04753fabae1796fb1ba680904a3b4bd15c2a880d70d83e57361a690669b05ae6"}},{"ruleId":"D1","level":"warning","message":{"text":"elements.project_clip_path_errors (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":4133}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d4678ee6b380192abdcb07c182b2616366227d3ccec59405c09c9aec4bc1ae1"}},{"ruleId":"D1","level":"warning","message":{"text":"native_objects._decode_source_chart_package (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dcb0f0521a38f71a39b13372740518e4aec1ebf53462b51629fb05e18cfc39"}},{"ruleId":"D1","level":"warning","message":{"text":"table._table_run (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"8734c13d6eeab9789bafa61f0c12527b8c38e815c9b9d5669a4dcc9ada0ea3e2"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._apply_explicit_layout_structure (cyclomatic 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"af558ddd216f83510b1543a3dfd21244062e11bb3a16d14f101052e41b390dcc"}},{"ruleId":"D1","level":"warning","message":{"text":"app.initRubberBand (cyclomatic 25): 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, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f6de9d1b60beb34c55abc565b3972a2c99d907d6e234aeddfe424163d96868"}},{"ruleId":"D1","level":"warning","message":{"text":"compact_svg_styles._promote_common_group_defaults (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_styles.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"785dca66267e77a4b3511d32ceb29d91195eabb269b63ae05657f86f6b1fb285"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations._normalize_target_mapping (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"4baa075a682da6fa766abf153371e02a4a7ea5927fb58eb9cd97a220651cd767"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._resolved_line (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"2cb669d1cd02bdf448bef1ed5f72f45c9998311915cf3cbe40d03cf79001ea85"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._validate_legacy_axes (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ca2726877fa1b016adae4c2588094447d0e9d59535d56d1c8aeac375fe17ba7"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._write_roundtrip_manifest (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"836f2640f7894d72dbe09f9c107c96a5c7504963609eaae5ce51c1019204ba37"}},{"ruleId":"D1","level":"warning","message":{"text":"normalized_chart_svg._render_combo (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"1134901b65574a0b85d14aee04a6201654e8c2c973f3b42ab52f73abcd5021d0"}},{"ruleId":"D1","level":"warning","message":{"text":"preset_authoring._validate_style (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebdb1e7d76b17ee5cfb41ae701efa93bef5c6f7334e97413d2efa967ee8e9482"}},{"ruleId":"D1","level":"warning","message":{"text":"txbody_to_svg._convert_east_asian_vertical (cyclomatic 24): txbody_to_svg._convert_east_asian_vertical 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa45416e7a59e278d9fd8c2825e3d263bb1edcf67a6769317e0bfc6a82c78235"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_transitions.validate_generated_transition_xml (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e41a462a533a4fbbbc61ca780646fbfb501534fa1d70dbd9e2295e001e3c573"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_transitions._validate_transition_sound_package_parts (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"45dc533548ebbf0236f6d04c0031a254122927d3618f0603a1d61f8e8363bc51"}},{"ruleId":"D1","level":"warning","message":{"text":"resource_paths._svg_image_payload_error (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/resource_paths.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"76d3be6fc55f2ca4bc6b927d67712000f6ef9b4b57b17083fc0bb9f4d9a48c6a"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_authoring_view.project_svg_batch (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"e78ee04fd4975d67e89c2543782c9f2926e9271d2456bff1b7909ed383df8e49"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._text_width_diagnostic (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4131}}}],"partialFingerprints":{"codehealthFindingId/v1":"5d78698272ce9fa4267da46e8c491dec656bf8cee6673866cf67012e5c3dddfb"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_placeholder_carrier_flattening (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6289}}}],"partialFingerprints":{"codehealthFindingId/v1":"586f0fae0ab7034b25766f2464f06e85e09606d776547ca0d1bb4564d2955b6b"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_contracts.check_forbidden_elements (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c2397f11776791b2b66d450fd1ddac398989fb4ba0cad9daad95a5b4fbf219"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._nested_crop_clip_preset_geometry_error (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":4000}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7681a7dffa34793b45b01e880364d80aa8de691cc6c60b8eb07f0991c28ea0a"}},{"ruleId":"D1","level":"warning","message":{"text":"native_objects._validate_native_object_marker_payload (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac706606bc03207a367df42d17c7c799d7d5837735477319f924c01a786269f6"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_data._category_series (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31e1a12c7b75d5022d0ef41c10b20e72ea534bd9e672dc619912ddaef50c1d9"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_style._chart_companion_shapes (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecb7602e2cf6303b87d8b76137e8ee7031d0d801c939d5e0359c27fd344a6b73"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_xml._series_xml (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25586fac38b6d06e52daf4edf8d65128874157ea1bbdfe53d28a1b46bfabc03"}},{"ruleId":"D1","level":"warning","message":{"text":"text_measure._run_calibrate (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"a85590ebf82cb42f47308bdf8a0127c50778545c9d74da81082928630b13b006"}},{"ruleId":"D1","level":"warning","message":{"text":"video_sound_mix._resolve_sound_cues (cyclomatic 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e3aac1f563afbd62036ac027d63dea0aaa3d8fa48f733104d4ec82a138f823"}},{"ruleId":"D1","level":"warning","message":{"text":"app.renderDirectionComponentCandidates (cyclomatic 24): 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, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b662f2f4cd9fbe753289858c28a015881702dd16d0c2864e453988193bb1248"}},{"ruleId":"D1","level":"warning","message":{"text":"authoring_roundtrip.normalized_authoring_subtree_sha256 (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"18616a9499e1a9a82b08837bb4fd77ef9e1aa2ff5b426271b7c03f2ec7f3a6d2"}},{"ruleId":"D1","level":"warning","message":{"text":"narration_sync._load_timing_plan (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6b38a2b55695db35f1265693887f1022324ef886b1ec7b86dfd6cdcf7a4cc8"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_import._preview_node (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/formula_import.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb7c193ad58f722425ffda01c18057a27b76623908a7f520f519625226ba5e2"}},{"ruleId":"D1","level":"warning","message":{"text":"preset_authoring.render_preset_shape_fragment (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"65c7a94063a46a6f00771fbdfe4f8b794d3ed904e2524c58416da023e2b9d0c7"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._table_has_unsupported_direct_formatting (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7519613840e92d95419277266dc4396258723447832bd62656e933d63d84d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._legacy_text_body_has_unsupported_formatting (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b81a3951808b3e8187915cb398f88c1bb1efe34349a16b671544db76620967"}},{"ruleId":"D1","level":"warning","message":{"text":"txbody_to_svg._parse_paragraph (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae99a55adad3c4a5b50534ec54a1c71559b3437976183fbeda4549e17e90feb"}},{"ruleId":"D1","level":"warning","message":{"text":"txbody_to_svg._emit_paragraph (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"51950e3f1975e77ab1b4f7ee479fd88bbfb6d12d02a3aaaa43ae61e115e05ad3"}},{"ruleId":"D1","level":"warning","message":{"text":"project_utils.validate_communication_trace (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"770981ee76b795830109751bee935dc23c7cc6bffeb14216a612a5a1e5eb61af"}},{"ruleId":"D1","level":"warning","message":{"text":"ImageRotator.apply_fixes (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/rotate_images.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"45cc1f8b36623d7dc405247f34fbb841629f4ffeb4aca5353450f7100f1a0a19"}},{"ruleId":"D1","level":"warning","message":{"text":"ppt_to_md._xy_chart_to_markdown (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48b2054bfaad293d61147de0230748aa9f74454fe5e073cce41f75c5446ee91"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_authoring_contract.canonical_authoring_errors (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_contract.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"28459010546a07e8f426e4edd20a7765cdd238bae1356f7cdf64dd754107229c"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_authoring_view.adopt_authoring_object (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"899f9439c3f415347cf72cdbb816979f74c835d0e8c7bab376611e6e106512f1"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_position_calculator.analyze_svg_file (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6e65687dcc127cfc1e32330503f692da59a579724a924545d5553800d032cd7"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_sourced_image_attribution (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7062}}}],"partialFingerprints":{"codehealthFindingId/v1":"669d62b0ce314530254fb6dabead1ba3d221f5c786cf457aa53e8ae8b2a7de0b"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_contracts.check_stroke_style_values (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6a09e0a4890a595fb01bf12702e42e8201a66282a21be904c0cb8069471002"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_xml._data_labels_xml (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"99f293d4533632463227240fb32f4c7db0ef932587f27f84ffca2c8b1b33435c"}},{"ruleId":"D1","level":"warning","message":{"text":"text_measure._outline_candidates (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"579e344e32a22b224f69e9e77e32cdc0f9868ba5df789814e45065dee9a12e4b"}},{"ruleId":"D1","level":"warning","message":{"text":"app.normalizedFontRole (cyclomatic 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"fea47ccfb52f9578e18d42b95002bc87b5775d1fafb26d1f0046e7270ec38589"}},{"ruleId":"D1","level":"warning","message":{"text":"app.loadSlides (cyclomatic 23): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"58126f4a1241c4602c029028ede12b182b6c7191128b1ab588cbfe403cc846ce"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_openai._generate_image (cyclomatic 22): backend_openai._generate_image 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"d920d408f0d22cd0f4b256407894cb35264f3b2a441b285c1cb4132529fa0e37"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_embedded_fonts.load_embedded_font_bundle (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_embedded_fonts.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"be2b091e620d00fb28f48139cb93bb7c35d9a955f943575da21137a5b576d3df"}},{"ruleId":"D1","level":"warning","message":{"text":"clone.clone_presentation_slides (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"bce0a31d29905d7df1de3445fd78060233e4a823787b6874506d4b57eea740c9"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_opc_validation.verify_internal_relationships (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_opc_validation.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e5eb9c016bb14ac04fa9792a57a5450afb2f48bb4f0e3fe203fe894c36cad09"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._managed_vector_asset_paths (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdd94aa4dd57394c7b11fdb65516064c2f1ffb703f668d3e033bae79d83a69a3"}},{"ruleId":"D1","level":"warning","message":{"text":"txbody_to_svg._wrap_paragraph_into_lines (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a2cdc0dddc4161786207e2818a572b6edec9ba7def76edfa75ee88e1841ea8"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt_audit.audit_load_sets (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a009949dd2612c7499752c7e2078ba86011a16e99ac531ff0c53929ff2becfc"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._sanitize_epub_manifest (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb05b92427c6893bbf0310038d41e508867db5851146aeb7c8d71a54b305dd28"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_to_md._extend_ruled_table (cyclomatic 22): pdf_to_md._extend_ruled_table 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9a350001e1d6bcc78ac0508b771a875c5100a00b9fd67bb33019406359e6b6"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._record_carrier_receipt (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d6462995872a8a7d2d5e906ef3a66be0b11e3b95a3c8d8d20a459eb159aa75"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.parse_project_filter_params (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"0363020430173f9da43b1ca460d2ff4c205db3f5e30ad8fd9aa870e66d4999f4"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._placeholder_text_body (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3902}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e86331d51495fef8aeef624c47b4b373a2e34eda201088e7766796a04547f01"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure.load_template_source_themes (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"72d653d7d7170f5638cbbed4d1c3222e4f925af6359f58ed97aed49846e2eaf7"}},{"ruleId":"D1","level":"warning","message":{"text":"app.fontScriptTokens (cyclomatic 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bea660db413a2fae55e2bc38f7665312e773e51ba30cc4234271abe678fad17"}},{"ruleId":"D1","level":"warning","message":{"text":"server._read_template_options_input (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b0da32217b49fc48719b0b6de859105cca5d3959a9f632be3b4243b24460d53"}},{"ruleId":"D1","level":"warning","message":{"text":"image_search._save_candidate_thumbnails (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"b43aab226d1cfad0e578a6ee1cbfc90cce12ddc0acf73dcfebfbe39dae637f41"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._slot_wrapper (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c4761d348d8c45d9a15471f2ff1da78d7381eb36259927215a5accdcb43046b"}},{"ruleId":"D1","level":"warning","message":{"text":"formula._apply_operator (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/formula.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"4859ecd7810b42232cd3bba90b17f4cd75d3db069ef8d765c109bb4a664ad8f4"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._pie_visual_styles (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"b77f395a6bfb96157a9eaaa80b29c065cbb381370ad6c4264abc5ac703ba3607"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._source_chart_text_style (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca5ef30f31a4b7d8b829f4e81fc20c42eb61569edf30445c0d5678e75ed712d2"}},{"ruleId":"D1","level":"warning","message":{"text":"fill_to_svg._resolve_grad_fill (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"a27aced952b146c99a62c930bc12ba5c79017f2591b05d144d7eeb26c82018e3"}},{"ruleId":"D1","level":"warning","message":{"text":"normalized_chart_svg._render_bars (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"9357d6ce44567ec61fe0e2e9ac6ea022a2a8b39ff322f2dd38e02fc6e1c33cdd"}},{"ruleId":"D1","level":"warning","message":{"text":"pic_to_svg._apply_blip_image_effects (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a072e387986a133d41b17b427dd1460c665f524f584ee1946fcaa99d3bd60f04"}},{"ruleId":"D1","level":"warning","message":{"text":"register_template._extract_entry (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"f404fa7195883eab45f19f91e2fabe6ee6764c591933d5d90a77eb55f449d850"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._docx_image_occurrences (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"66eef5543db7025daea549647a67abd0b7466c2d10e3ade8eeed9933a590864f"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_to_md.should_keep_image (cyclomatic 21): pdf_to_md.should_keep_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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"2262fccae7c56d06c52501b7a741e9bc593044ef20a8226f014f604fec41f762"}},{"ruleId":"D1","level":"warning","message":{"text":"web_to_md.download_and_rewrite_images (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c6939232069a89e24e3aedc7855fea373245df5fd272c934dcb98a7336445b9"}},{"ruleId":"D1","level":"warning","message":{"text":"web_to_md.extract_metadata (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"e4d52f968f8edd9dd39872c2d888e5f4c4bfda258fac7a98c225bee584c3c0e5"}},{"ruleId":"D1","level":"warning","message":{"text":"web_to_md.process_url (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee6a5eb58064ded2a215cd75d211e0adfd0d59fda4d01f657d7d3a2f3fae196"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_authoring_view._compact_semantic_shapes (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd5e94e04e208f0bdbaca981f387798a66644c49eda618fcdd5b1ec3da7b78f9"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._imported_model_text_lines (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3868}}}],"partialFingerprints":{"codehealthFindingId/v1":"002a1fea6cb12d38f8d9517b3730a0dc1dcd9bba750db55efde85d737a6b9bb3"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_animation_group_ids (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5789}}}],"partialFingerprints":{"codehealthFindingId/v1":"edea53ceea0bcf7c485264b9f4f47c485498f290166f8ec93b1175375c9ffcd7"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._geometry_trace_metadata (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"969758f90c89aa84a0fe27fa16697bc6fc749c9157676f751522580b252de9d7"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._valid_emf_payload (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e592adb09114d907d38ad9694ebfdb00b96e6af2d5282d5c96dc24b7901b8d27"}},{"ruleId":"D1","level":"warning","message":{"text":"elements.validate_preset_geometry_metadata (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d14027f08941df68f886695f472acfe0f26d4da43c8e8dacc9f6b7726aefd0f"}},{"ruleId":"D1","level":"warning","message":{"text":"elements.convert_circle (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"c47e878f631bd7a2eceaebe0dd11c0bab25d3adeb917959724f0df438728a990"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._override_run_attrs (cyclomatic 21): elements._override_run_attrs 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ac234509699d254ffdfc446f8d265611487edf38ad361e15bdc42d3fcb119df"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._resolve_clip_geometry (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc20443a050066ef102cb19c0c7cfecffa7ab5b03265a6d9503a65bfee1228c2"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_omml._validate_drawing_element (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"af404d8f22569598d15e2b75b2b7fc358961e0fb7358b08a7867c583757fd38b"}},{"ruleId":"D1","level":"warning","message":{"text":"marker_common._element_local_bbox (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"e09ea316a5da8c09bb8baf15659723c4368d92ccb394409a1f9f79cf3ed1abe4"}},{"ruleId":"D1","level":"warning","message":{"text":"table._table_fallback_grid (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"aeceb44d005725931239aa70ebda1c113316fbb72e8311f503ac7385c49d92c8"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._ensure_notes_master (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":5620}}}],"partialFingerprints":{"codehealthFindingId/v1":"582ce92111f8a169510f7d90fb380ae469ad3b2c0e3ba0c98ac40f5ab3c4cdac"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure._is_full_canvas_solid_rect (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cfb1dbf8ca29d024378a57ea11e23be0f444008cbd2c13dae4c0315b4b824b0"}},{"ruleId":"D1","level":"warning","message":{"text":"total_md_split.parse_total_md (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/total_md_split.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"c630a07bd486a13fe54a86beb023d50edeaafd6e1dcd3022ed44c94b049b921a"}},{"ruleId":"D1","level":"warning","message":{"text":"video_motion_plan.build_video_motion_plan (cyclomatic 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_motion_plan.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a29596aa24e2c3c8431c1017adfe5d63eab6ebfbfc997475ff43f4bb6d1b3bb"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_config.main (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/animation_config.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a8d8e70ffc80cdcb6ee226fb4c4514c086e372314473a6a1bdbfe216309d40c"}},{"ruleId":"D1","level":"warning","message":{"text":"image_search._search_one_item (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f71a150d6820b5353c25778eb03fc387cb7a4bb06339300d768031510381f34"}},{"ruleId":"D1","level":"warning","message":{"text":"provider_common.score_candidate (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_common.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8d535e55e5a875eb711f085e02971158855dbd75270aab0a8d9f51934b9f328"}},{"ruleId":"D1","level":"warning","message":{"text":"latex_render._process_item (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/latex_render.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"417b93a62a10271b92d7f776d2ccbaabf3ab1dbf29a46fd2e9e13217d7062e5c"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._mark_explicit_breaks (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f4f5bba5457c5ece8d554c91268d83a753f9c647357b5e0144640eaa3ace31"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._copy_text_carrier (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"309b6779288c06b293ba678e4dff28660e2ef8f417a03259a78db346d1c74e28"}},{"ruleId":"D1","level":"warning","message":{"text":"native_payloads.externalize_native_payloads (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/native_payloads.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b0d9c6c1a1e85f48a69a5cb4fee43dc4796a3d69f1eb70d2ee935a89ae47650"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations._scale_animation_row_duration (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"582c3eead83c2378c17c242bb76724851851f1f3d1b94b03244aa232982ae589"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations._timing_summary (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"05af82f7b0db66d8d141a24d90f5ce3746caf9cdbacd97472aa2723c2802c17a"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations.validate_pptx_animation_package (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"70f35afbe4e0b425ffed9a60ce33098f1fc1df38d8ec6a614ee4875f0d50468e"}},{"ruleId":"D1","level":"warning","message":{"text":"ooxml._container_geometry (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/ooxml.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea3b12d3206545fa29bbcd3c8fdd13d8fea9a9dbcb4f971b6bbdb400e201a741"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_opc_validation.verify_hyperlink_relationships (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_opc_validation.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5cd2a702bb3e4abb19a0b8409c15bcb8af774dc4e7c3a0672f5dae2516b78ae"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._resolved_solid_fill (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e18370e461ce21cbb319bb7c6a8b69bcabfaa38958a9bd50472b77ff9a77b93"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._normalized_chart_visual_styles (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e3685afd70a85aff508a78f5a76cd2dfce2eed7d2b7a7965202048c13a686f5"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._point_data_label_payload (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fd230b73a984863dc23b4c4846e4c704e145895be24ea583e8201b9407292ca"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._extract_theme_info (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"e803271484b557c378f07854bf5297add46ce0e2916b400aeee5e37374255197"}},{"ruleId":"D1","level":"warning","message":{"text":"slide_to_svg._convert_graphic_fallback (cyclomatic 20): slide_to_svg._convert_graphic_fallback 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"709638e582f9f89ad3e4dc3ec334f55dfd234890fca846796625a942b4fd52f7"}},{"ruleId":"D1","level":"warning","message":{"text":"txbody_to_svg.convert_txbody (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3dfdd5c2980157c68e7b64d23060a7762558b4ef8b2483396e4ec948233617"}},{"ruleId":"D1","level":"warning","message":{"text":"txbody_to_svg.convert_vertical_txbody (cyclomatic 20): txbody_to_svg.convert_vertical_txbody 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"335f635f43386fee50e22a4fa0492bdcc82adb034c983db2a8bdbc6cbad1bb28"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_workspace.inventory_package_resources (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"c666951f0bd18016199f9aed2d495785d446da2e0bfac5c505718a875fb76cd9"}},{"ruleId":"D1","level":"warning","message":{"text":"_batch.run_path_batch (cyclomatic 20): _batch.run_path_batch 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_batch.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"8190f7ca0878cd9852b7a5c7df200c0c37e6d8850ec814ba5ca273a44ceb831a"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._roundtrip_text_diff_ids (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80841768382ceda0d4b3d9bb8d278ff93dc807450aa20214ffc8d11cec69d0a"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._carrier_effect_receipt (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"5edee8839926a243f0ab5220d397b5b76302b61d501b0bd66e2bd9a7be2c7a03"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._carrier_image_receipt (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a28e1c87f114c63e493ef5a259ef70af96fcf93bf057be495c9665e3005c92"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_pattern_fills (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5949}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d91ea6b18c774fbfd041649fcc7af8f1df81be4e5392cdc2c9f4f57e946b756"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_config._animation_effect_entry_errors (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"05eb0f9c07987b1520909d3915c4589dfb3fa254fc48dfe45a16385fbf02e8ea"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._convert_semantic_shape (cyclomatic 20): converter._convert_semantic_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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f5692e9c4a77f9423b6178367fa326de6810603e599ead4b1b87a5c99fc912c"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._roundtrip_graphic_frame (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"8531d5df25617e4977daa9c725d4f16f434beb5f32362ec23e80b4bc0371afa9"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._extract_background_candidate (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbf08384465910901c0a2a3638b602f89bb541c8c9ae9cc281967f6e44e19497"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._resolve_nested_svg_clip_geometry (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":5526}}}],"partialFingerprints":{"codehealthFindingId/v1":"701a36589bcacf954b2b7921fabce7856593799a848d76cd8b3bdbd4e37fb495"}},{"ruleId":"D1","level":"warning","message":{"text":"paths.project_gradient_geometry_errors (cyclomatic 20): 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\u0027s highest cyclomatic complexity: paths.svg_path_to_absolute (cyclomatic 21) is higher and carries no row of its own \u2014 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\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"290cda484c6920906dc4f6d6dd286e7f3f9c6fc9b593a02daeaf7d8d0b8948c7"}},{"ruleId":"D1","level":"warning","message":{"text":"styles.build_gradient_fill (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb3b6a4df6c062dadbf6a3feffef4540f5a6924dc8be2db5656c38007e251bc5"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.parse_svg_color (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"145eb7f4be0e638f71960819d4c9138b33d363625f83f424af6453c63b82641b"}},{"ruleId":"D1","level":"warning","message":{"text":"native_objects._build_native_chart (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c87614dbaef963a369c2cc941e1c25e0e7d716d2cf4c1f7cae356693b6132ff"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_data._chart_data_labels (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"78bd6dc634b6f143bfc0f3a9f205b9ba74228f02907677272c1263287270c42e"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_data._chartex_chart_data (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee5423431d1ec5bc6f19c84b7628e395ded2c9842ea3ce597b4137383ce77110"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_patch._patch_chart (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"496d8be830aa5ca12e89f67a08e606b4f64ab8ec4fb942d77387e7db949b0ef4"}},{"ruleId":"D1","level":"warning","message":{"text":"marker_common._fallback_text_records (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2813936bf8c10ff19d20f8f8bdfb08ef81dd5393bdd4782d164f4fe67e940d0"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._solid_background_xml_from_shape (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3355}}}],"partialFingerprints":{"codehealthFindingId/v1":"a588c4742df5bc46bb90fadcffb5bce1791bcd09dad13db0aeb7d5c3dc55dd25"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._write_postflight_report (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"17283ad64a2def2f79e6ea7d9c1d3fc277d3ca18a09ee592b079a852d9aa9342"}},{"ruleId":"D1","level":"warning","message":{"text":"shape_boolean._validate_geometry_presentation (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"18554d296a958708023ee2334fb7abe74d460a1081c0ba2a16635213170d938a"}},{"ruleId":"D1","level":"warning","message":{"text":"_LocalUseExpander._materialize_use (cyclomatic 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/use_expander.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f215063dc12f03f734899dde7035f9ab86f7fb24f1aef53bc32f4f70e2bf47b"}},{"ruleId":"D1","level":"warning","message":{"text":"template_preview_pptx.main (cyclomatic 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_preview_pptx.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"73bd2fca7bd013c2264b0393689aded2e1ff447a476d42025dee27e696ffe22e"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_openai._collect_response (cyclomatic 20): backend_openai._collect_response 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_openai.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac6b89cb3a7ae46dd01973558797a12b987fc14b23398551f1af792b19da1ee9"}},{"ruleId":"D1","level":"warning","message":{"text":"apply_template._plan (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d51c1196a58fc296319714f9172d25d89b42388e969525fcca95f7e182548ade"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_svg_assets._load_reusable_assets (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"67ae24a0dbff2807d3e9b86055b783375dbcaa898281152a0f66fe97b1e3aa3e"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_gemini._generate_image (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7c17bf503968cf3e0e94587ac0769b12fe53e1509ea14f3c922e3c09bae22bb"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_openai._select_size (cyclomatic 19): backend_openai._select_size 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"efee2920c5b12414651f9b777b0f28609f2438f42aded101affe13399085c0b9"}},{"ruleId":"D1","level":"warning","message":{"text":"image_ocr.cmd_text_layer (cyclomatic 19): image_ocr.cmd_text_layer 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_ocr.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"29b501ce1b54eb2425eb65b94005698b5d2ac93e1597bb631d57a0f420422915"}},{"ruleId":"D1","level":"warning","message":{"text":"provider_wikimedia.parse_results (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_wikimedia.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"734a53933269d64ab7204a74ff40d593896e017efb6001f1ab219e9898227e69"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._slot_plans (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d0f0fc2ac450729ad8b47b35130c56560b6aff1cbdcdf0fb5a8c5841e8120ff"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_to_svg.main (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ffca5836d6b5765ed50440a583054c208740f3f71c5ed30c086f38c977b4585"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._apply_plot_data_labels (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e4e361802a83ab7ebc63f9123b841e4b193dd3d89d1ba6eb128e6547528aa19"}},{"ruleId":"D1","level":"warning","message":{"text":"chartex_to_svg._payload_from_chartex_xml (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfc7fb6c285f5129129c855319bb662566a26ee225107dc9fd81ac4863c6b837"}},{"ruleId":"D1","level":"warning","message":{"text":"converter.publish_staged_workspace (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"de576651d37dbc7579d0e8d7a1e80b2dd5e220f7ebcf1382c9032a99baac41dc"}},{"ruleId":"D1","level":"warning","message":{"text":"slide_to_svg._wrap_shape_group (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"f048bcbefdb9c7d56dcea4b9cf687136b3c9276ff09e3f796ab7736df6f15850"}},{"ruleId":"D1","level":"warning","message":{"text":"txbody_to_svg._build_run (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7d560cebfba8188a941a3c378e5ac17d105867dc642835974d6902a018a7679"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt_audit.run_audit (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"02037e5d5641d4fe2f09e6073e994ee9d5ec9d79cf9eed1c8cc953b07f22c5a9"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._convert_epub (cyclomatic 19): doc_to_md._convert_epub 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"1906a152632abb9162d77e7511522bd35efbbf2bb6245b7571e5a4133fca42b2"}},{"ruleId":"D1","level":"warning","message":{"text":"ppt_to_md._paragraph_bullet (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"972b0d35e928a09033fdecbf885267fee7e17a8c5129137f96db439aa17571f9"}},{"ruleId":"D1","level":"warning","message":{"text":"web_to_md.main (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f071aa10a782bf64113bc9140bd39dbc11b87ad589b8b0ec152f7bd0c49f0e4"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_authoring_view._normalize_semantic_text_lines (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"6d0a3a6783dfe1076d99af9970e2801b20894bb8f38d04900fbad9fc5e3241e8"}},{"ruleId":"D1","level":"warning","message":{"text":"embed_images._optimize_image_bytes (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_images.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe70d337aa8c70cedb8b930fbe2f38e7594b30fd890222ff331567437405419"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_rect_to_path.main (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/svg_rect_to_path.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b971d8cbea9485f63d199fe8c3a72b9e20c6aace0fd275334c37a82cb061f0e"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._classify_preserved_mirror_geometry (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"673a2bd419b987b719a713b635e33d035dc547f58ce929ab41000be5f31248a2"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._load_project_svg_image_references (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8333}}}],"partialFingerprints":{"codehealthFindingId/v1":"d85a7967476112563302d903d66bf95c66737245246dea83590fd7d0bd2e3844"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_sourced_image_provenance (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9067}}}],"partialFingerprints":{"codehealthFindingId/v1":"d63340e3ca7cf6a9ab849151a4bf4c363ab7b478e334618be4bade72145ab353"}},{"ruleId":"D1","level":"warning","message":{"text":"elements.convert_rect (cyclomatic 19): elements.convert_rect 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"68d88e730ac32e1b206709448ea6f4ab3ed867f90bf6a4cc11b60a6dc41e6cc2"}},{"ruleId":"D1","level":"warning","message":{"text":"paths._parse_svg_path_tokens (cyclomatic 19): 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\u0027s highest cyclomatic complexity: paths.svg_path_to_absolute (cyclomatic 21) is higher and carries no row of its own \u2014 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\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad205b2ccbdbfa3c473377aba760434225dce19dc059fb1ee70c2cf04883d362"}},{"ruleId":"D1","level":"warning","message":{"text":"_LatexParser._parse_environment (cyclomatic 19): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9ef5013d380fbf012e63e37044d088dd18e8d677ed4299dfbb64e1c79fa43cf"}},{"ruleId":"D1","level":"warning","message":{"text":"table._table_text_run (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"3268bd177c4825a2e976c9b52fa42b86af76f021620fe2df7542359b1b7b8f0d"}},{"ruleId":"D1","level":"warning","message":{"text":"table._resolve_table_merge_layout (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fef6fbf3858714e448390376e4d0b11bf01a01bead3e4ac0058904d2b250e4"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._apply_template_text_language (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6362}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1803dc5d34863c84fa73c23614d52b8a963d08adcc3e46d8a0b0daf6d0fe645"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure.parse_optional_layout_slides (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"62fe0c63bb7a2381105b3cdb3a57aba3f808b93760576ff159022ab93117cf77"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure.template_lock_errors (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"42bf0afa17cbd3af370ac649ed10174aaa6fc73e69f2d9255b5f4c589d9f8da7"}},{"ruleId":"D1","level":"warning","message":{"text":"app.initTemplateOptions (cyclomatic 19): app.initTemplateOptions has cyclomatic complexity 19 (threshold 15). Of this number, 12 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ccfecb8a7a10ff7cadfafc96c42c68f492aa671245462bb4609ebf86dfda22f"}},{"ruleId":"D1","level":"warning","message":{"text":"app.attachPropEditors::commitGeo (cyclomatic 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"aed6c0c1bba3eb64def8cd54176ecc40cee6d67457131cfddf46fe65b53d14a2"}},{"ruleId":"D1","level":"warning","message":{"text":"apply_template._write (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e3e4d92364a6722ba5ff48131d8f77fa1b4251212c316beb06e7c26fbd1df53"}},{"ruleId":"D1","level":"warning","message":{"text":"authoring_roundtrip._load_current_assets (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd6d0affa75af276b7c1b061ac64cd731788e4ff511f3be70684a55fe2aaee06"}},{"ruleId":"D1","level":"warning","message":{"text":"authoring_roundtrip._prune_unreferenced_definitions (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ad12de23238f99f87ca4214a54e27ebe76a4c588fdb1ab0116da975660dbf25"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_common.save_image_bytes (cyclomatic 18): backend_common.save_image_bytes 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_common.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"e047069dc19418fba2261cc7cbfac139d0c9c93723482d93c0b7e3becf3bd341"}},{"ruleId":"D1","level":"warning","message":{"text":"image_gen.render_manifest_md (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"6db5628d0b0bfa41f18428f955848a8945ec44271e7ec7c18e92505fdbe50d35"}},{"ruleId":"D1","level":"warning","message":{"text":"image_search.fetch_url_replace (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"7275e777c701b82b0f5ccbc59894a98a237cd83fd4d8b7c07fe63a31e5ee7ea0"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._load_vector_assets (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"7161ba8a0b4041cc384e91293ef6a78462a154989d06ac9554da6cb7896a6821"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_animations._apply_timing_options (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe297e41b4eb47cfd90bfdffbb9f04f39f5ca5e07ffa0b48be70be2b946eb366"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_delivery_check._content_type_maps (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"316e418e16d0c06ff42abee15648f184f35ef9de52e9d5204b1fe8c84a53a12f"}},{"ruleId":"D1","level":"warning","message":{"text":"pptx_delivery_check._font_faces_for_advisory (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae7ce5ffdf594e70fcb650a336a69b8bd6ee01f4ea2373e41a1d5edebb4f7994"}},{"ruleId":"D1","level":"warning","message":{"text":"clone._report_all_dangling_slide_jumps (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"b11ada10ef2d86a476e0335e2bfaf5224439c49833cfd06c95da568981c9f56d"}},{"ruleId":"D1","level":"warning","message":{"text":"diagram_read.smartart_to_markdown (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/diagram_read.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f9eedf2b7a024c9ed1fddebb497f27a7cc6808ea10a359b39cfbb3dcd686e39"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_import.read_animation_config (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/animation_import.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"17fca578d7832be0264fdba64d48ae1c060633ad7e2989aff4008423459d5359"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._data_labels_payload (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dae0764c02c868528efd50c4169b7c58492c8cef3e260b9a9eb2563e62e921c"}},{"ruleId":"D1","level":"warning","message":{"text":"converter._annotate_roundtrip_slide_roots (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7e2de3777a820038ec1d02eabd8c4f4d4bc3f81e79b88f5280a0726c300b0e9"}},{"ruleId":"D1","level":"warning","message":{"text":"effect_to_svg._validate_color (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/effect_to_svg.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fb1c3b05360a3e719a7c19ed1baaf7b86f63a2172646012bed174c1faa8975d"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._native_run_payload (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f09f1088af6ee1ea3c19616c0b20cac085cc7f9d100a497803ec79ec2157172"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._convert_cell_text (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaa86d66b26d9c170e90505a19633213bd215bc82b7c835ed7983bd8869972fd"}},{"ruleId":"D1","level":"warning","message":{"text":"preset_shape_svg.main (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/preset_shape_svg.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"68a969a4d0f46fc859a01f8385f94b5a5e86a6041e8188e17f53489f965781bb"}},{"ruleId":"D1","level":"warning","message":{"text":"page_context.page_context_usage_report (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/page_context.py"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4d29d30765fc60220291bb64a36c08161044e17cc8f452c0190884f6e0d6d2c"}},{"ruleId":"D1","level":"warning","message":{"text":"semantic_table.compact_semantic_table_payload (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/semantic_table.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8e899ed440a028598eeb8f994152c743d8f392442d01bc24aa323fef7d56656"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._docx_inject_charts_markdown (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"be213f1c5ea47d6ea66b04f5ffae28c943b603d3b1734ce86707742e51280f03"}},{"ruleId":"D1","level":"warning","message":{"text":"pdf_to_md.get_heading_level (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"71923cc87551cc8ea26b9c07cefdaa097791c1d4cc4a410531eaa49b643b049c"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._roundtrip_changed_font_families (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"0719bf90393bfc37942054cdb6689a8e22ababfda12f758b06435c2fbcc1bb72"}},{"ruleId":"D1","level":"warning","message":{"text":"slot_capacity._text_targets (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/slot_capacity.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"c868f18fdb2a8baabc086f9b73e63510bdf5813b8c94edf39dc4ae490b639ef5"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_contracts.check_authoring_property_contract (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f088b5df867044b71855284280924baec46ffea56d87ae8eaa02459924af4e0"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_config._resolved_animation_parameter_errors (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b183d0d8ae65e73e33bf7bd3ef93c60b0a070ac12300d5ccc053ac656c8ff67"}},{"ruleId":"D1","level":"warning","message":{"text":"text_properties._diagnose_text_declaration (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"543d1a6d334c444910c8d25a52a94ccd76d37ef5d685cce5560d090dbbc32b7f"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_data._combo_plot_entry (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b003eba16ad05521ad39ce1db0a5e876243f51d4687249b355cf6fb177e4c48"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_style._native_chart_export_payload (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"03205bd941103aee7e0027ba4851bb527482bdf3757a5c4bfc810372ff060a48"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_style._legend_candidate_texts (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6208de1d251711a3b0a8c7ec4a423ffa325b8d3787fbffd4b57853238054fe7"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_style._fallback_bar_clusters (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"13f21ef6bc03c81c835774ae4e5f3074e4e35137bde756e7098ce291f8e62434"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_ast.merge_run_styles (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"05107edd41d4169407bf07c4f1d46c6dd2a6ca05ae69b72b64a554246ade9ba9"}},{"ruleId":"D1","level":"warning","message":{"text":"_LatexParser._parse_cd_environment (cyclomatic 18): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6d8030679d94c7b68c64b51bd6ab241757e81eb4bd645ade75e454144fdce58"}},{"ruleId":"D1","level":"warning","message":{"text":"marker_common._fallback_shape_records (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb1b3beb0ef7e76760c38a0a5e64aa23a24e327838702e2d7889f699c5b6f00d"}},{"ruleId":"D1","level":"warning","message":{"text":"table._table_cell_paragraphs (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"a01b54fe065a5c7faab9316f593e9f18c18b5b0a736aabf1631af305766261fd"}},{"ruleId":"D1","level":"warning","message":{"text":"table._native_table_fill_warnings (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"a528affe72b99489cb80ff63c967a3d5973d27c4f0d2a7a7504095a72b7dd6f8"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._prune_unreferenced_definition_payload_parts (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4981}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cffa3e7acf24d43aeb79a867f98f5f53f28f78b42b345802f16d56ab3ec81c1"}},{"ruleId":"D1","level":"warning","message":{"text":"shape_boolean._connected_components (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"f000b1e46dc05e457a537fe218d32eee6dd620bf9ca809bcb46a1ed8fa44ba69"}},{"ruleId":"D1","level":"warning","message":{"text":"manifest.parse_theme (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/manifest.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"daba1d0e6157b52d1e8dac052ae31d2867567ed63279b6a03c6d897178915410"}},{"ruleId":"D1","level":"warning","message":{"text":"native_structure.build_native_structure (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/native_structure.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"1de86571dc847f8f7d16250670ff3d6f330a90248da10b2d66d6d69323a47733"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_minimax._word_boundaries (cyclomatic 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_minimax.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"028b7623959f70812e7c55c585df3e275d61346c72a5dcf930c583cf833c2a8d"}},{"ruleId":"D1","level":"warning","message":{"text":"apply_template.read_template_install (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"eaf49997f7ee2e764d56e5852c7456a8cd3f5ec4335d2e754f5ba1637131a4d8"}},{"ruleId":"D1","level":"warning","message":{"text":"server._submission_stage_error (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f83f1bc89079ab21890a61ec075d74dbc0b54ef9642dc990044e19fd35cf814"}},{"ruleId":"D1","level":"warning","message":{"text":"server._build_session_state (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb1757baa400e5bc54664cafb0cc80fdd8c30c09d91f48adddc7baa8b6d113cb"}},{"ruleId":"D1","level":"warning","message":{"text":"backend_openai._gpt_image_options (cyclomatic 17): backend_openai._gpt_image_options 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"edbf4cbee33b54a050482a34b11c7a80be7fdb5db74e478e667cbdb140cc2f5b"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._flatten_fixed_group (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7ca95e783a31ab97f47fca7a39401b1b486237356603a8712a5c93f56589d2f"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._source_bounds (cyclomatic 17): mirror_template_materialize._source_bounds 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"19e6f7a44dba31713d5143c66d9736337a91a748f0aff6251588e2ba949985f6"}},{"ruleId":"D1","level":"warning","message":{"text":"edit_safety._chart_edit_capability (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/edit_safety.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cc7883b44a84a8c7adbb7956000a8ce389d3dd5a90fe47f3cd58e67e5b2e4c4"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg.extract_native_chart_payload (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"669748914d794728c269aa0d3c5ea95c9273b473555e4d552068ad2fcb16e219"}},{"ruleId":"D1","level":"warning","message":{"text":"effect_to_svg.convert_effects (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/effect_to_svg.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"575a75d3c6086d20c718a3556f2401ae661470a95d41a2f2d83284a726e89cc7"}},{"ruleId":"D1","level":"warning","message":{"text":"fill_to_svg._pattern_foreground (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"a414204f32fa73f8a5c36ae0567f2cfa678ef9d650db09ce11f6c2d5a016642f"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_import._serialize_run (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/formula_import.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c37590b2d751a5b562ad1f6eed95879a9c1de98d78178874a2619e0e248fa72"}},{"ruleId":"D1","level":"warning","message":{"text":"shape_walker._walk_container (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"82a7ae26206e219611f7220e39090074b7af57fcc24a8790b907ce163f40771e"}},{"ruleId":"D1","level":"warning","message":{"text":"slide_to_svg._effective_shape_stroke_properties (cyclomatic 17): slide_to_svg._effective_shape_stroke_properties 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcea41f5edc0c89f06d22b98989a4737d0ca42bcf99b1b1e77d3accdf8c9f096"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._convert_ipynb (cyclomatic 17): doc_to_md._convert_ipynb 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"3caac58e3b78770d5bdf5af62dfca9595ce3f49f0a7f9c4aef22c716abf5f823"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._prepare_odt_for_pandoc (cyclomatic 17): doc_to_md._prepare_odt_for_pandoc 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"960bd701d1bdcaa5d0da380b0d0f39a08c73a6c6f28808f6fad00cd992a6af0b"}},{"ruleId":"D1","level":"warning","message":{"text":"web_to_md._decode_response_text (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"43e6dc768fd91a4914932bd0af7eb6b13c66a3ba423e487ce956611af2c263fe"}},{"ruleId":"D1","level":"warning","message":{"text":"stamp_native_fallbacks.main (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/stamp_native_fallbacks.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"a15142082b8afdaed1ffcd6826cc8200615583a44a795f864aa32e208a7498c7"}},{"ruleId":"D1","level":"warning","message":{"text":"annotations.promote_tspan_to_text (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/annotations.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"8edf51e53ed1f42f3a9ccd7c687e72fc48371f32cbb36cb7ff3cf3ab1efe7f06"}},{"ruleId":"D1","level":"warning","message":{"text":"server._validate_edit_attrs (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b844e959965c18c7c2dd24d17d38e3dfedfb3b5f6855084b51cbd925773543"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_viewbox (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bc5751f4f424340abc5e51e3b711fde7701bb2186c7ba89fef1baa47ebf9d26"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._check_icon_placeholders (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5403}}}],"partialFingerprints":{"codehealthFindingId/v1":"16dfdc8da723da2ab4b2f1e99942ec3deac647cb37c2f396c0f514dc96301e83"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._apply_aggregated_issue_counts (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9982}}}],"partialFingerprints":{"codehealthFindingId/v1":"f72e511cd9c80153f40caf8eba3e54aae8b892b9e7a081cf42aaf0fcdc16ce31"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_contracts.check_paint_compatibility (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bed28d96295542de26f0e941f395ac69d2b8c5e0fdc6c7b1f1cca85f6864b10"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_contracts.check_font_size_values (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d2eb34bffb7eed2c0caac1e43b2dc02df300bf2fa9885e11dd7733bb4f377b"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_config._transition_scope_errors (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d34ed47e247c8288c6359c0cbc96e6af80dd07d5fe16d7c251d37a531fd8753"}},{"ruleId":"D1","level":"warning","message":{"text":"elements._valid_wmf_payload (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a0fabcd1875b5511af2251cc4bbc0fe4d9cb689ec3612853755fd0973c72980"}},{"ruleId":"D1","level":"warning","message":{"text":"styles.build_stroke_xml (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"4db2934103cd42505f37a57bf4860978f078ecffb21ffb564543b0c396099302"}},{"ruleId":"D1","level":"warning","message":{"text":"utils._is_imported_preset_preview_filter_target (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f770a7f2a490d5ea3399adad97c09b80b8ce26b870bec70be4317893381410e"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.parse_font_family (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"d233d00a2aa5879e266679d5cbd557ea251ac5964866cbf846114694b04069e4"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.detect_text_lang (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"d15b6762dc8cdc9adcfc475d904a47b374b520f3d2a67991e0049ff3878dc3ea"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_data._category_chart_data (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"b75337cbfca8bcf0ecc274466f0e8b51f07ba5f0ce28566eab4d0dbd39125f56"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_style._native_chart_area_warnings (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"32597c63a699c4fc7170a6c47b8d1163b8cd75c1ebca60933f61bd5d916de02a"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_style._native_chart_category_order_warnings (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a1c766faec415e662af7939de939dc24ed55dbb6d7c4002a5686c5a091a320b"}},{"ruleId":"D1","level":"warning","message":{"text":"_LatexParser._parse_owned_body (cyclomatic 17): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb36f8ae19b8723a033f9023a2c489c87698a1399969cf733c38ac3e9e1db39"}},{"ruleId":"D1","level":"warning","message":{"text":"table._table_cell_parity_style_gaps (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"135440aae41470fe5af02259bebba008206cd3b7797291859e9f9b2ff4df1cd5"}},{"ruleId":"D1","level":"warning","message":{"text":"table._native_table_header_warnings (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc807481b49eef1115da49cdb52a3e54cb225a5a755478f807c0a5bd2f031bf3"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._merge_roundtrip_relationships (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e78d2501a4985d00fcdaf91755142d9fb40fca5aa3046e330e1f1af662d64ba"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._prepare_flat_structure (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":5199}}}],"partialFingerprints":{"codehealthFindingId/v1":"7afa334f37d2530da8da2862aba4db896021494756542ffefbd30779c2967469"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._source_resource_audit (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a25be6c995b880a227fd34478210400fe9231a562a6a572e599961d6e6d9b1f"}},{"ruleId":"D1","level":"warning","message":{"text":"discovery.find_notes_files (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/discovery.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2345869efcf24cc1ab2910e92a187ffb58a3efd6b2a31360e43c5fee1692795"}},{"ruleId":"D1","level":"warning","message":{"text":"narration.find_narration_files (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e05a254dc2902d9aec0bd99a2866569118f00cfc64666574068f1aa2f1f2581"}},{"ruleId":"D1","level":"warning","message":{"text":"template_structure._scope_visual_resources_signature (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c33791860a7bb7a545873d5be3972f26656d2dc3982c0c6e753f10fd529dbdd"}},{"ruleId":"D1","level":"warning","message":{"text":"visualization_catalog.resolve_visualization_reference (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/visualization_catalog.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"d30598bceb0f9332cd9e04069f042d25c68247ad871e75b019eb08fa858b20d9"}},{"ruleId":"D1","level":"warning","message":{"text":"app.legacyRecId (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"12f50869b019c80d12ffada465b1834f0655dce2afa92b612cfc155fb2358381"}},{"ruleId":"D1","level":"warning","message":{"text":"app.applyDesignDirection (cyclomatic 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":2236}}}],"partialFingerprints":{"codehealthFindingId/v1":"018a28fb875b7b2f2e6bd38c481d7bbeb3f5ec2fac0d110ba30afa629bdbe414"}},{"ruleId":"D1","level":"warning","message":{"text":"analyze_images.print_results (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/analyze_images.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"02e05229a442a7a79f62ce6f1bbe1910db50967ea4cf9e92459b590cbad9230e"}},{"ruleId":"D1","level":"warning","message":{"text":"server._template_kind_from_spec (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"888decc24931b3b16bc48cf5e583655a4f89867bb4f3b949dda8f2da07965266"}},{"ruleId":"D1","level":"warning","message":{"text":"server._typography_error (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3589b3242f60d98a5edc7db974fb85b21018f0c76d7d687483119bb68ecde2"}},{"ruleId":"D1","level":"warning","message":{"text":"extract_svg_assets._existing_placeholder_entries (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1d29769073ed181fc748f2a40561f275be67d3c06cc847ddabfa8360bebea61"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._visible_leaf (cyclomatic 16): mirror_template_materialize._visible_leaf 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"8afa53dcf68c95f8e0d7881c014f6ee9a01d965f01ca043ac8aa15d01485fcaa"}},{"ruleId":"D1","level":"warning","message":{"text":"mirror_template_materialize._resolved_placeholder_decorations (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"2eabd95494bf5b60768214b4e35882af9029ffe2b47d502d31e97dc0e834829a"}},{"ruleId":"D1","level":"warning","message":{"text":"diagram_read._ordered_nodes (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/diagram_read.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"e8c932326632468f5ca5794d5a4da536a54a6072b468cc89e055efcda2c90f5c"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_to_svg._resolved_shape_paint (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"be4de38b1fe05be53825ddd1f90d7c7ac820348d621ce37323b7a1adb4ff21e1"}},{"ruleId":"D1","level":"warning","message":{"text":"ColorPalette._load_scheme (cyclomatic 16): 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\u0027s highest cyclomatic complexity: color_resolver._apply_modifiers (cyclomatic 17) is higher and carries no row of its own \u2014 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\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/color_resolver.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"9515c43faa4f26812e4184f376300cb0c112a8d2dcea5bc5de5a1e393617206b"}},{"ruleId":"D1","level":"warning","message":{"text":"ln_to_svg._build_arrow_marker (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py"},"region":{"startLine":373}}}],"partialFingerprints":{"codehealthFindingId/v1":"759240e42725c8d77c9a789ac682df9a395b626cd3797f7a13901f94f98ca48d"}},{"ruleId":"D1","level":"warning","message":{"text":"normalized_chart_svg._render_category (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5cc2c112e2d9ca25ed6d618a20883b0f0f6d47b0b21c92b3c19424343afe5f9"}},{"ruleId":"D1","level":"warning","message":{"text":"normalized_chart_svg._render_pie (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7db40bd7e2ae479d93e7bb63b40a7c9e016f35265a176e7a9968aec15314141"}},{"ruleId":"D1","level":"warning","message":{"text":"slide_to_svg.assemble_slide (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"683d578d8dddd9853a7a366c2f04e4616d0703ca8b3bd1cf9f2160ca73d2bfe0"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._build_cell_grid (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f1ebc5dcc8ce359621edcfdbd4f04b5ddb55b883894a77e0023d7b8ad12c9c5"}},{"ruleId":"D1","level":"warning","message":{"text":"tbl_to_svg._cell_rich_paragraph_payloads (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"45bca571e8b16035abe81c8695b17101b8769057b827870d6c9bdf5aef32b2f5"}},{"ruleId":"D1","level":"warning","message":{"text":"ProjectManager.init_project (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bab0ac9131606944bb1a3fb421f0fd2a07b2fbba047f98edde63834cca0b6ad"}},{"ruleId":"D1","level":"warning","message":{"text":"prompt_audit.render_text (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"58097492f3b2b6904dd1fc023b2cc837815a909649bc11c05f82e7df63883064"}},{"ruleId":"D1","level":"warning","message":{"text":"sound_sync._load_sounds (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/sound_sync.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a1c8596f1116a6a5d44d05bdc2ed972be4c4d1dee3c10f892695a72ffe78dc"}},{"ruleId":"D1","level":"warning","message":{"text":"sound_sync.sync_sounds (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/sound_sync.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"146e64f02efbc5dab4f90018d0d6f6d5ce60ce724b14e2e8154b78d86aa18e7b"}},{"ruleId":"D1","level":"warning","message":{"text":"doc_to_md._convert_with_pandoc (cyclomatic 16): doc_to_md._convert_with_pandoc 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"bfebf24ea3dc4b843cdadd6432b82055be80b7ed3ffd783df96cd3837573be77"}},{"ruleId":"D1","level":"warning","message":{"text":"svg_authoring_view._load_authoring_summary_manifest (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb6d31e342bb4691a5529a9f924bae59a5bc0bbe643bb0738680eef233dd187c"}},{"ruleId":"D1","level":"warning","message":{"text":"flatten_tspan._emit_mergeable_paragraph (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6c65bb9423f6db73f84d5a153898dd8ccfbaa27496c05d79dc4713a9c2d17a4"}},{"ruleId":"D1","level":"warning","message":{"text":"SVGQualityChecker._resolved_text_runs (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3373}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60a16dae98b14a89099b03acd5cd1f598a68d10b6c28ec156559c29506e3bc0"}},{"ruleId":"D1","level":"warning","message":{"text":"animation_config._resolve_morph_pairs (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd50671a82d60f1814d85bcc49a732a8541d1afc074a7d18e0320e2e5f1d407d"}},{"ruleId":"D1","level":"warning","message":{"text":"paths._project_path_like_bounds (cyclomatic 16): 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\u0027s highest cyclomatic complexity: paths.svg_path_to_absolute (cyclomatic 21) is higher and carries no row of its own \u2014 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\u0027s figures nor in its score."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"51cff77ff514301dad5269770c277559e5d8aa7d36c8afd29300fbbc35c5d0a3"}},{"ruleId":"D1","level":"warning","message":{"text":"theme_fonts.load_theme_font_spec_from_pages (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"89241b60f7b3fd7bc050b50843d64a3ea6d4ef5f272469523efea5756774bc71"}},{"ruleId":"D1","level":"warning","message":{"text":"theme_fonts.apply_master_text_style_spec (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"f41fdde602ad1d96d55aef4626785dbc8c1c2732e16d5166be8acef92e33534f"}},{"ruleId":"D1","level":"warning","message":{"text":"utils.is_picture_effect_carrier (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"a33fd5eb9ff2a9006fcf95d925dd7e63005f4154731cc416c6b0fe1c167e0f6e"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_data._xy_chart_data (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f4ed808a9c74303b320f8136251005f196c5d3949a183fe0b141ef7a6aa870"}},{"ruleId":"D1","level":"warning","message":{"text":"chart_style._native_chart_line_marker_warnings (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee5fb4f1d7b5e8d614e512171e4d40c05d0bbd030a0e8934ba81a0c111e2fa"}},{"ruleId":"D1","level":"warning","message":{"text":"_LatexParser._parse_sequence (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"e735fc80b967245f27d56a5cd5d914d98a8af74d10e45e6cd985cd1512354401"}},{"ruleId":"D1","level":"warning","message":{"text":"_LatexParser._parse_atom (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e696db7f8e133e808674373777e7aef1121858e9f9eaef6ef3490bd43b21ca2"}},{"ruleId":"D1","level":"warning","message":{"text":"_LatexParser._find_matching_character (cyclomatic 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"01f414f0163936cf4e1e5a2e7c03277cbe623eb64785c04c6af331a531472179"}},{"ruleId":"D1","level":"warning","message":{"text":"formula_parser._collect_macros (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcebaa761cc0d6006538b04ed21ca17116282f17eb757a57e16399bd823203bf"}},{"ruleId":"D1","level":"warning","message":{"text":"marker_common._fallback_fill_candidates (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"76a7cea574970e01f58f00829ba1d3ffd5138fb81b935e3a008c7900a6f23f6a"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._replace_roundtrip_transition_advance (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c05b47e865229fc9bcef782579a9af6b4816ac1843e8c99e6b7b0b084995d5"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._remove_all_notes_parts (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"cab6df65c1f97311a6c07bceea4c48880a23552fc5f89c050514441525df070b"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._materialize_slide_sound (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6166}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda4de322e3aa907c8a9dfe0afe99cf01c12f137e1cacb27d68c4c54a6f9b7ca"}},{"ruleId":"D1","level":"warning","message":{"text":"builder._create_preserved_base_pptx (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6511}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce023b59c679f999595f5f4c6299225dcb3066d019bab557dce3361840c1fb44"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._roundtrip_animation_config_for_pages (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"51366bc598b24eecc51e68a7f152595bdd94ed672354eb76a36ae4910a942292"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._report_roundtrip_omitted_opaque_payloads (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"fce4c2db8e4413bfc6fb497c626a7e31bc6927b64afd9837a3f2bd4ea6685d87"}},{"ruleId":"D1","level":"warning","message":{"text":"cli._opaque_roundtrip_slide_dependencies (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"deb9fedb7be2b3946f9482ab8b8970ccc022891c5a9dee517e06f264a36864ca"}},{"ruleId":"D1","level":"warning","message":{"text":"text_measure._lexical_units (cyclomatic 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"74dd4e051954058c7771b51f8e86ba54761de19b07814536f8c68849d432d80f"}},{"ruleId":"D1","level":"warning","message":{"text":"app.enumField::makeChip (cyclomatic 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"9b44fb9cea5859ac56ee8de9de4759335a6758d62a132aca929220108f61841b"}},{"ruleId":"D1","level":"warning","message":{"text":"app.setupSvgInteraction (cyclomatic 16): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae2bc7be7ad6ddac40f79e351b9356716974e73709d47b530ef920ffa76abfb6"}},{"ruleId":"D1","level":"warning","message":{"text":"app.sanitizeSvg (cyclomatic 16): app.sanitizeSvg has cyclomatic complexity 16 (threshold 15). Most of this is not in the body itself: 5 of the 16 points are its own statements and the rest belongs to 2 function literals inside it that branch (lines 1901, 1894). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"9de96dd172c6ef80c77db1122e8f0aa9529c23094679206dfb41338404659184"}},{"ruleId":"D1","level":"warning","message":{"text":"app.renderEditableProps (cyclomatic 16): app.renderEditableProps has cyclomatic complexity 16 (threshold 15). Of this number, 15 points are the body\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"22643619b94f601363a598282ac5a714a7b91292f475f4b349f1a0238b8f151b"}},{"ruleId":"D2","level":"warning","message":{"text":"builder.create_pptx_with_native_svg (cognitive 704): builder.create_pptx_with_native_svg has cognitive complexity 704 (threshold 15). Drivers by points: if/else 195 (419 pts), ternaries 41 (107 pts), boolean chains 86, loops 30 (74 pts), error handling 9 (18 pts) (nesting depth added 343). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6791}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c9c184be874c6cc2997557d7588b38af22d9f65487bb875091fe98b1f48a1a8"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 505): cli.main has cognitive complexity 505 (threshold 15). Drivers by points: if/else 158 (278 pts), error handling 32 (66 pts), boolean chains 61, ternaries 42 (58 pts), loops 15 (42 pts) (nesting depth added 197). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c02bc8f4e82e131ae4dd1542c87cc0fc87edfa8c48bc0d75e2d7d2a765e03a3"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.extract_pdf_to_markdown (cognitive 270): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"4df34a5d0626521c31dceb3b2ed07a045835173ef8ab4139242b700df00b8ae5"}},{"ruleId":"D2","level":"warning","message":{"text":"template_validation.validate_pptx_template_package (cognitive 217): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py"},"region":{"startLine":868}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f80a2144f3c2583593cddaa823a968e6ae4bb49b109f30f167a9ccd3289510"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.parse_template_slide (cognitive 216): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1512}}}],"partialFingerprints":{"codehealthFindingId/v1":"521ebed650c98b9f0a5bb0f325b12e17d8180fad4645b913b6cca2b61ecdbd3e"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectManager.import_sources (cognitive 194): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"73b617618968b518c5e2f893b3c5264dd44b5feb76922931b7d1eac0701389e7"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.convert_text (cognitive 165): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"c051051f7f4441773f1c8a8100ceaaeb030bab4ed777c040ff2b81fe04f7eec9"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_planned_image_closure (cognitive 160): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8575}}}],"partialFingerprints":{"codehealthFindingId/v1":"02197f334a4c2cec78130e2917ae832e76f90de54dce39a06eb3d4b1d6f94cda"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.load_pptx_structure_lock (cognitive 152): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":697}}}],"partialFingerprints":{"codehealthFindingId/v1":"f514adbc7e9f71d19cad7d6a20453ed8d95b9fc15214c6e15c73b03892fccaf7"}},{"ruleId":"D2","level":"warning","message":{"text":"table._build_native_table (cognitive 137): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac69a54844aee44174a2b0f6518b18957597abf930ee705a7e713b141017ef80"}},{"ruleId":"D2","level":"warning","message":{"text":"ppt_to_md.convert_presentation_to_markdown (cognitive 134): ppt_to_md.convert_presentation_to_markdown has cognitive complexity 134 (threshold 15). Drivers by points: if/else 36 (95 pts), ternaries 3 (13 pts), loops 7 (12 pts), boolean chains 7, error handling 3 (7 pts) (nesting depth added 78). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6adc4484a7c6595503ad18a289a527fcd61a69577f93088b9530c5b804ddfa"}},{"ruleId":"D2","level":"warning","message":{"text":"checker._local_pptx_structure_errors (cognitive 130): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":635}}}],"partialFingerprints":{"codehealthFindingId/v1":"471c6d7017a4b7bee4f866ccaf0fdaaaa5c684e802ba24ccbce4105c2371a43d"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.audit_registries (cognitive 128): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc69aefed4eb18aa1fe763baadcb1ea055adaabb6bdaccafb377c00bf63adb54"}},{"ruleId":"D2","level":"warning","message":{"text":"register_template._validate_style_spec (cognitive 128): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c47ae23f1d5de084803b6c96ab4d85869bad61fd26e71fbc41e5ae50788d88c"}},{"ruleId":"D2","level":"warning","message":{"text":"image_gen.load_manifest (cognitive 126): image_gen.load_manifest has cognitive complexity 126 (threshold 15). Drivers by points: if/else 37 (83 pts), boolean chains 17, loops 7 (13 pts), ternaries 3 (10 pts), error handling 2 (3 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3331c62ced98bc9496e03d926c97540812ddfda9c888d3ef0e0f229c1bcedf7"}},{"ruleId":"D2","level":"warning","message":{"text":"slice_images.slice_sheet (cognitive 116): slice_images.slice_sheet has cognitive complexity 116 (threshold 15). Drivers by points: if/else 29 (73 pts), ternaries 8 (18 pts), boolean chains 15, loops 7 (10 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/slice_images.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae05c572cd22c561366733544fa5e6262d46aeb7a8c382d166cc30cf5e0ea762"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_spec_lock_alignment (cognitive 114): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6732}}}],"partialFingerprints":{"codehealthFindingId/v1":"987caac8cb9563a5c42472d207e5e151dcfb08dd82485fccdc3654bf3033d7c3"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._parse_command (cognitive 114): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"f248c0d3b1808730477175ba3862da9f256730792a4aad372d2be692a723d4e3"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest.build_manifest (cognitive 111): manifest.build_manifest has cognitive complexity 111 (threshold 15). Drivers by points: if/else 29 (62 pts), loops 15 (22 pts), ternaries 8 (15 pts), boolean chains 12 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/manifest.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"179d1d1cce31a5df008531dad5ad3c3353b8d01104896b0c5145a445ed484278"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker.check_directory (cognitive 109): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7270}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c24caec74221621b6d7b3b9650f2c938757c676b2da393bc21c3cf22d1ee5d"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.project_marker_errors (cognitive 109): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2118}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dcfbebdac72f425f01b9bb7eac79182535577a7e5f8fb554115e1b13f0796c"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search.main (cognitive 104): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":2617}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc542557f61cb515441f21f66defcef23db255045972e571b7b285be0688c1f0"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._chart_axes (cognitive 103): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"487b44ffd913b87b8ad94567b06321533146e09578f263d8a406850bc80eb359"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.template_prototype_errors (cognitive 101): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":3241}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf833b942ddf7b798a62eec4c2ef1221680d8e2280eccd14f810ebcc7a1a7b78"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._promote_common_chrome_shapes_to_masters (cognitive 100): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4543}}}],"partialFingerprints":{"codehealthFindingId/v1":"75eac808ab97a714fcea126fd84b1e60e7b0fd19dce208ad740ab67dda4795a1"}},{"ruleId":"D2","level":"warning","message":{"text":"converter.convert_svg_to_slide_shapes (cognitive 99): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"332a8b9401f4a92b97cb1de2b0af7d522de9a43063931a38b103453d352e9c7c"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.load_manifest (cognitive 98): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3e6fb360330417cce715e15ba13bc1ff7403e485459bc353a8220327a596d3"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._apply_roundtrip_slide_overlay (cognitive 98): builder._apply_roundtrip_slide_overlay has cognitive complexity 98 (threshold 15). Drivers by points: if/else 45 (75 pts), loops 11 (13 pts), boolean chains 7, ternaries 1 (2 pts), error handling 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1689}}}],"partialFingerprints":{"codehealthFindingId/v1":"73cb11c35623d5c1bb6b41babf1367a23d3c9bd76f87583d6a8b8a74c666d335"}},{"ruleId":"D2","level":"warning","message":{"text":"converter.convert_g (cognitive 95): converter.convert_g has cognitive complexity 95 (threshold 15). Drivers by points: if/else 36 (58 pts), boolean chains 24, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1209}}}],"partialFingerprints":{"codehealthFindingId/v1":"42be669361a56f14d960f48a29733e786616078c40035d709b2789f6817d10b5"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.project_gradient_errors (cognitive 95): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2538}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e0a9caf483650b38742806b76938571fb6a1a9f0608962bf8ae59f5d29b5bf8"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.project_filter_errors (cognitive 95): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2874}}}],"partialFingerprints":{"codehealthFindingId/v1":"87d0772e2e1e33a6e1db46d9b7f5dd0fc93412e32f599bf8f3f14e6e358838e2"}},{"ruleId":"D2","level":"warning","message":{"text":"notes_to_audio.main (cognitive 94): notes_to_audio.main has cognitive complexity 94 (threshold 15). Drivers by points: if/else 31 (53 pts), error handling 12 (23 pts), boolean chains 12, loops 3 (5 pts), ternaries 1 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/notes_to_audio.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"89f02052b02f9ff9dcf75ca0b578eb85eb57d835dd2c085b5f1e2188f809dd8e"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.audit_schema_grammars (cognitive 92): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1769}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc2a5982cf54984e64967965f32fd3a1575584d80a30952ddc7aba5279dd664"}},{"ruleId":"D2","level":"warning","message":{"text":"inline_formula.inline_formula_marker_errors (cognitive 92): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/inline_formula.py"},"region":{"startLine":84}}}],"partialFingerprints":{"codehealthFindingId/v1":"453dcbca184fe54af7aae67f9bb180db19f9809a33eeee109fc676f63a159dc1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 91): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/cli.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"268bb7ff4a88b182bba93ab8da40ae55e1c763722f12a26053df4c300489c129"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._load_documents (cognitive 89): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"179b3f274ee6df9eadb2345370c99fce7afe4248e57a700253360e6da30adeaa"}},{"ruleId":"D2","level":"warning","message":{"text":"ln_to_svg.resolve_stroke (cognitive 88): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"332de0b946e7cb6cb5c9a9d15cbd89284cf43f066416aa84c3d3fd11446acc19"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._load_native_animations (cognitive 86): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":219}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc0a535af40bef9394982de15c723bd4d76b07f2102d8d5122366539fe38ab39"}},{"ruleId":"D2","level":"warning","message":{"text":"cli.main (cognitive 86): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":1380}}}],"partialFingerprints":{"codehealthFindingId/v1":"5fbf40cabbd4a5a379b1f13028b534c552a955ca80eeaa830f706f330c6230b4"}},{"ruleId":"D2","level":"warning","message":{"text":"narration_sync.rebuild_animations (cognitive 85): narration_sync.rebuild_animations has cognitive complexity 85 (threshold 15). Drivers by points: if/else 29 (63 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"318c4ddf22512806f339471013a5c2d8c7deb3ead1d82de10c133fe3671587a8"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._read_effect_options (cognitive 85): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"062f8f0a1eb4c22ea74ca73cad811992c7be220b7d6b7525095b7eaf44e026dc"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations.validate_slide_animation_structure (cognitive 85): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2907}}}],"partialFingerprints":{"codehealthFindingId/v1":"17e4cb2399c3310613680e9afbd034f84fc5c78e50006daddfac3183d7a66902"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize.materialize_mirror_template (cognitive 84): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"76df5c98493ab7d91633d8bf724991093dc68b12d18388f1126c86f86d7a6bec"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._positioned_text_lines (cognitive 84): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3621}}}],"partialFingerprints":{"codehealthFindingId/v1":"a8781ce2db1ec37233420a5d9b7a03979f528e046d551bb8edb6dc30466aeb76"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._parse_preset_geometry_metadata (cognitive 84): elements._parse_preset_geometry_metadata has cognitive complexity 84 (threshold 15). Drivers by points: if/else 29 (53 pts), boolean chains 15, error handling 3 (7 pts), loops 3 (5 pts), ternaries 1 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bd076372eb5cdfdb5af8b1410d9c6f3d996b2f2d0a7750f88f0f79e264f5e7"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_native_object_markers (cognitive 83): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6023}}}],"partialFingerprints":{"codehealthFindingId/v1":"b42b43a5b5f0355b262779567983ba5afa0786cb37b2af4d16840896f371b559"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._build_sequence_targets (cognitive 82): builder._build_sequence_targets has cognitive complexity 82 (threshold 15). Drivers by points: if/else 26 (53 pts), ternaries 5 (13 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":5908}}}],"partialFingerprints":{"codehealthFindingId/v1":"585ea0b19a2f3df2beb298bb74aa193173d43409c21ad3c495f87f1d44525c84"}},{"ruleId":"D2","level":"warning","message":{"text":"_markdown_links._target_spans (cognitive 81): _markdown_links._target_spans has cognitive complexity 81 (threshold 15). Drivers by points: if/else 15 (43 pts), ternaries 5 (17 pts), boolean chains 12, loops 4 (9 pts) (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_markdown_links.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"21d92771f609dc5f0f47c5b6bf7466e447df60e4971f009afe0aabc423ad25d0"}},{"ruleId":"D2","level":"warning","message":{"text":"server._stage2_design_directions_error (cognitive 79): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1469}}}],"partialFingerprints":{"codehealthFindingId/v1":"c715c11d5881d03dd12d7073e01daf29eb1512d3461878cad39145d14e0cced8"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._compose_template (cognitive 79): mirror_template_materialize._compose_template has cognitive complexity 79 (threshold 15). Drivers by points: if/else 26 (57 pts), boolean chains 9, loops 6 (8 pts), ternaries 3 (5 pts) (nesting depth added 35). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2545}}}],"partialFingerprints":{"codehealthFindingId/v1":"aecb0bcfd0ba8f7f62bf66429e57a2eb3a1cbdef3cd097f3d41a09432fe1d9b2"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._opaque_roundtrip_dependency_owner_refs (cognitive 78): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":812}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbc4e42a65c8343212cc28d07d4a1edfbb341550ef10f5afd26d9e34ae8ac23a"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._apply_series_formatting (cognitive 77): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2014}}}],"partialFingerprints":{"codehealthFindingId/v1":"de999a11b7c647c627a01c6bb946f0996cd9323fbac687c4383c86c25d6491fd"}},{"ruleId":"D2","level":"warning","message":{"text":"flatten_tspan.flatten_text_with_tspans (cognitive 77): flatten_tspan.flatten_text_with_tspans has cognitive complexity 77 (threshold 15). Drivers by points: if/else 19 (47 pts), loops 7 (18 pts), boolean chains 7, error handling 1 (3 pts), ternaries 1 (2 pts) (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"f77a584d3f4fad15ecab6ea43f66981a6a9b39c9e8ddb0f331a278175facb6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"slot_capacity.slot_capacity_report (cognitive 77): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/slot_capacity.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0bc157b1e84626a154298b715424fb696cd4a9b73655e1950ee333c5bda466e"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config.validate_animation_config (cognitive 77): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2a493aa5f370b45b13e75a6e961368a05453bfee97466fa3b69d21034d66cc0"}},{"ruleId":"D2","level":"warning","message":{"text":"hyperlink_contract.project_hyperlink_errors (cognitive 76): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/hyperlink_contract.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff71504229db754dffed569a49a5d66bcf1dba2c6e2083c4601af2a7fab3789"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.load_native_structure_contract (cognitive 76): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f8adfc56b05c4fe4ad1cd83b125ca830dd05d91806fa8bb4903bf1e6bfb2af2"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._axis_config_from_xml (cognitive 75): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1338}}}],"partialFingerprints":{"codehealthFindingId/v1":"533d4e2cc59c8953ac1f35547c776430ebf9df5b7d52ade53f3830648a21cb39"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_patch._patch_workbook (cognitive 75): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5a9d9aaae20aaa58a5d31f1eaf5a9f5e34d36a69337158baeb6365b01e6f566"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions.validate_slide_transition_structure (cognitive 72): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2899}}}],"partialFingerprints":{"codehealthFindingId/v1":"715f59c0855c3883df79d94e867fff2f9bacca70bbeeb9f3f25bc23053f63878"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_position_calculator.main (cognitive 72): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea6ddb279d2c691f69252ce8c1d8647c260dc9e66604eced0dcce4183c416991"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._promote_common_chrome_shapes_to_layouts (cognitive 72): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":2922}}}],"partialFingerprints":{"codehealthFindingId/v1":"66adcc654298af3ad7bc04b478fae33457914b54f3fb178ca6ab88a350e81108"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._roundtrip_passthrough_candidates (cognitive 71): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":346}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa545799325367547c83d507b1698a03cad25e6f727c0832e9c96dced87dbf2d"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._validate_chart_semantics (cognitive 70): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"952f530e78df12ba650e00d68f9e0c29730e9278988e80fe67a9c5c758f80f0c"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg.convert_tbl (cognitive 68): tbl_to_svg.convert_tbl has cognitive complexity 68 (threshold 15). Drivers by points: if/else 17 (36 pts), boolean chains 14, loops 7 (12 pts), ternaries 6 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac73f2854ce629e0550d242e7e0cda9449f834fd77486b40973e2d718306d21b"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.project_paint_reference_errors (cognitive 68): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2344}}}],"partialFingerprints":{"codehealthFindingId/v1":"77f596e33cf75ba54423b8355842d2b36f26ed84cfa6a82e551d4e1b78692de2"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._materialize_document (cognitive 67): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1777}}}],"partialFingerprints":{"codehealthFindingId/v1":"f73aa5f72d9f252670380c4cdf2a7140e9b421193d1bcd4ee48fb0f1650fb4a2"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search.search_and_download (cognitive 67): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1066}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a19e42d18774cf51cfec07be69e39715af4aa3a96b8580dbf9d56f5cc22f272"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations.validate_generated_animation_xml (cognitive 67): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":3192}}}],"partialFingerprints":{"codehealthFindingId/v1":"30174e8176c3fb78d4c91769df9d81d69b877e88cdcb3f497916979f1d9dfe33"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_module_bounds_contract (cognitive 67): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4617}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4756560828824d4f8609d6dee17a22b1062564bfe1d834f699a0d6f8f5f13ef"}},{"ruleId":"D2","level":"warning","message":{"text":"_ChemParser.parse (cognitive 67): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1815}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bd35b07a2b5f3680a0aea1b26b1505e937524f46d22d29e291ca72bee5a4aed"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_opc_validation.verify_hyperlink_relationships (cognitive 66): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_opc_validation.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"93f04ff379c4bedeb3c98baeb726f9a3995541403193643a7406827d96be11da"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._apply_chart_formatting (cognitive 66): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"486b628c817c155b7be431cbd39d1a2ae71e14400e1cb8b3ebe45b5fb444aba1"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_delivery_check.audit_pptx_delivery (cognitive 65): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"e130afaa5a3cecde73084da241a847fb5094111cb0e0a234ffeb9ea1a32ef2ab"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._apply_chart_metadata (cognitive 65): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2169}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c90d8103adb9bbce791206fc76c0dbe3cfe0c659967129d319464dd3a28af10"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit._registry_ids (cognitive 65): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"4224042c5b7279a87a528111ae5079341af0afdc722e5fbf64eb0e00c31341a2"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_template_contract (cognitive 65): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9189}}}],"partialFingerprints":{"codehealthFindingId/v1":"913e0b4591bb9115c8825dd14ed2d430a8912d60f0e010859366624aae431e3b"}},{"ruleId":"D2","level":"warning","message":{"text":"app.renderTypography (cognitive 65): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"95a9d9ed292fa78b423cbd2b6506d70c9b5c9123bd6b6e1276db38a98d2b33f3"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._convert_shape (cognitive 64): slide_to_svg._convert_shape has cognitive complexity 64 (threshold 15). Drivers by points: if/else 22 (33 pts), boolean chains 14, ternaries 8 (10 pts), error handling 4 (7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"d54f230831409a1e6300529b21a7e67cff278d57a723774a0e5de73f75162352"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._text_body_has_unsupported_formatting (cognitive 64): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":962}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc41630c5a87de595c80ece2aecec929c7b7c711abf48bc429810fe0034a31bd"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize_svg._process_candidate_directory (cognitive 63): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/finalize_svg.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"59019aa194375671012a7ff833ffeac21b1641e52da87c4892983bbd8871d5c3"}},{"ruleId":"D2","level":"warning","message":{"text":"normalized_chart_svg._render_bars (cognitive 62): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"6790b1644b56ae8ee4ce98275b17a68169ca23757cd88f067f81619df6c474fe"}},{"ruleId":"D2","level":"warning","message":{"text":"flatten_tspan._classify_paragraph_block (cognitive 62): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":330}}}],"partialFingerprints":{"codehealthFindingId/v1":"e64939481d8bfdbe969d28ea7b5f58f86ad46b02426cd4b5cb9793dbdf205507"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search.run_search_manifest (cognitive 61): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed1729881550acfd525325de8db5e7009ee3b1530c1e33b81bb60c96dd649343"}},{"ruleId":"D2","level":"warning","message":{"text":"clone._remap_slide_jump_relationships (cognitive 61): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5f9e552d0e13c9a582b60228d7f3e88b53b292cd17ea9e903d5b836ee49edb5"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_import._serialize_node_content (cognitive 61): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/formula_import.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"a88db44146d6cd8bce10546967e7b72f0044f6d10f082647c0bc5fbcf6a9c320"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_omml._validate_math_structure (cognitive 61): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec65aebce21d93d0aa81b6bebb04bf1ac7e0fda83aec7cd18bafa6e0db2a4e53"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_text_bounds (cognitive 60): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4816}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bf4a7d75460be7e74cdd7f75dd644602c5a49bd7fac93fe6b22ffb7f5f6b113"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_contracts.check_stroke_style_values (cognitive 60): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":777}}}],"partialFingerprints":{"codehealthFindingId/v1":"f286694070a43f6a5ea73133efc2d90fa11591a972bbd359bbbe15bd1b6ababe"}},{"ruleId":"D2","level":"warning","message":{"text":"table._native_table_border_topology_warnings (cognitive 60): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1232}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e470858c33bcb1ed708e7166e87e3bdaf161f88dfbec8146e52bf5e8ba48296"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_pptx_structure_contract (cognitive 59): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7561}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b516ea59b0da154374613c7ef5897f04e97cef880248caa548f81b88753f5e8"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._table_has_unsupported_direct_formatting (cognitive 58): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":880}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31985d9986951287a046471cc50b48bc58d20c633e92baf899e61f8d6a39476"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_workspace.workspace_resource_specs (cognitive 58): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee82c1b03d3e1419a3a14fe447463f90b4a0b634fa5a711972bccdc52f7f7027"}},{"ruleId":"D2","level":"warning","message":{"text":"_omml_latex._omml_to_latex (cognitive 58): _omml_latex._omml_to_latex has cognitive complexity 58 (threshold 15). Drivers by points: if/else 23 (27 pts), ternaries 10 (21 pts), boolean chains 10 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_omml_latex.py"},"region":{"startLine":102}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6ac6d1003207e65ff27a28ce2a37711a639552d7549af1dcfd0cdf40bbaf60c"}},{"ruleId":"D2","level":"warning","message":{"text":"image_gen._run_manifest (cognitive 57): image_gen._run_manifest has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (31 pts), ternaries 4 (14 pts), boolean chains 6, loops 3 (4 pts), error handling 1 (2 pts) (nesting depth added 26). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"db685cb4b797e69b7af9f7d3113f7b495ebe8d01ceb91d619bd1b8feda3a9787"}},{"ruleId":"D2","level":"warning","message":{"text":"normalized_chart_svg._render_lines_or_areas (cognitive 57): normalized_chart_svg._render_lines_or_areas has cognitive complexity 57 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 5 (10 pts), ternaries 2 (9 pts), boolean chains 8 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"2481043b4e15d2ffece4fb90b2c9fa5797fa07666326ae4add2bf2c66c878419"}},{"ruleId":"D2","level":"warning","message":{"text":"crop_images.process_svg_images (cognitive 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/crop_images.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"62ad787aace4978b856505e0d4ee5eb4d35f98c7dd1095ac4570877334ffe2ac"}},{"ruleId":"D2","level":"warning","message":{"text":"fix_image_aspect.fix_image_aspect_in_svg (cognitive 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"71ebe317fe7db3e9f38dd768a4cb119d22e6c6b8ab53fbc31ab9a56804f72af3"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_patch._patch_chart (cognitive 57): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3648309f56128b179bb3a1a4c0a67fbb44dc8cf1b44bbbd97b49c501d778c0d0"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._apply_explicit_layout_structure (cognitive 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4257}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fdc339070bb5775531931ee41d8a225c22c20c4dcfccb29e2c2012b801b358d"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._recorded_narration_on_click_slides (cognitive 57): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1865}}}],"partialFingerprints":{"codehealthFindingId/v1":"db2e9d2d6ceecc1cf8f1d9f572e5905fdf84832860ce6b936b04d6c819e738d3"}},{"ruleId":"D2","level":"warning","message":{"text":"server._validate_template_selection (cognitive 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":560}}}],"partialFingerprints":{"codehealthFindingId/v1":"febf7661820d942c1c9b8e845f28be918da049290057e0572289defd7d76ee66"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_svg_assets._optimize_definitions (cognitive 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"b81f835d9c4249dd9cf0a36ac9e53a4efb2b717c7899449bd270ec16ff22b441"}},{"ruleId":"D2","level":"warning","message":{"text":"image_gen.main (cognitive 56): image_gen.main has cognitive complexity 56 (threshold 15). Drivers by points: if/else 23 (36 pts), error handling 8 (12 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":1275}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1cf5ba383462c8e5287630dc2ad99273b10f58c6356d06333f0a17da71e3a38"}},{"ruleId":"D2","level":"warning","message":{"text":"normalized_chart_svg._render_xy (cognitive 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":799}}}],"partialFingerprints":{"codehealthFindingId/v1":"fff91581dbb2c68984466bc58b2b72151076d00c275ac1ad34c61bac9eb4c168"}},{"ruleId":"D2","level":"warning","message":{"text":"txbody_to_svg._convert_east_asian_vertical (cognitive 56): txbody_to_svg._convert_east_asian_vertical has cognitive complexity 56 (threshold 15). Drivers by points: if/else 12 (33 pts), loops 7 (14 pts), ternaries 2 (7 pts), boolean chains 2 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f33dbfc5bbf0711adc1c7e1d38a56dea641e0f0b3341c7fca877df6c30005e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_image_references (cognitive 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5259}}}],"partialFingerprints":{"codehealthFindingId/v1":"f514416b479a48fe6b081fd7fba34f5c5f2a41a91d4a2c2d481d20cfcbe0229f"}},{"ruleId":"D2","level":"warning","message":{"text":"checker._compact_preset_ancestor_paint (cognitive 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c1f4ed755157dda1d1cc8cd442f94ed4f94300c117c704bd33a65c4bc54eb95"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._combo_chart_data (cognitive 56): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2e4ce26cd3ce55e7e6f8c8b68e76ecc200e288a8a4228fec050b676fd649f83"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions.validate_generated_transition_xml (cognitive 55): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2317}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f820f067de6864ac740413e766745e9314d4f13bed435f897c85828790d0dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search.promote_candidate (cognitive 54): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"61f48b47de20e2367b5891774eb4b1343ae9aa94b075fdf5ea174b5eb672da62"}},{"ruleId":"D2","level":"warning","message":{"text":"narration_sync._resolve_animation_groups (cognitive 54): narration_sync._resolve_animation_groups has cognitive complexity 54 (threshold 15). Drivers by points: if/else 19 (39 pts), loops 6 (9 pts), boolean chains 6 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":827}}}],"partialFingerprints":{"codehealthFindingId/v1":"05f53cabc743d7b57a95ca7de5a4ae9d24f5d5a147c51ec3b2722bd3acb36048"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._combo_payload (cognitive 54): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":264}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9a298ee1d33d211936a7adc528180df263c52ee6c6cce48da5c45d539e607c9"}},{"ruleId":"D2","level":"warning","message":{"text":"source_to_md.dispatch_single (cognitive 54): source_to_md.dispatch_single has cognitive complexity 54 (threshold 15). Drivers by points: if/else 23 (41 pts), boolean chains 5, error handling 2 (3 pts), loops 1 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a5c2747a09d66f17605ef86746d9a0ad199e2d9a21b3805e5865e714f08ae17"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config._animation_parameter_errors (cognitive 54): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cae7772c05973c0805e2fc6bee6981906304fcb97f34246f3e1abdf98853ea1"}},{"ruleId":"D2","level":"warning","message":{"text":"excel_to_md._convert_excel (cognitive 53): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/excel_to_md.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d42e6e8746a2031cc46ec97f51153e67f875c9ef1b43360cad9170be2ce187a"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_position_calculator.interactive_mode (cognitive 53): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":1156}}}],"partialFingerprints":{"codehealthFindingId/v1":"fbdab539279276fcae2dcfa5bbd69ebef086090cc647ac7fd3b2a90238f50c5f"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_roundtrip_text_frames (cognitive 53): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2204}}}],"partialFingerprints":{"codehealthFindingId/v1":"4200e6da8c8d90a78ffd01ea7dbcf8ef3762808e66614afd5ae1b63511d5ba69"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.is_stroked_zero_axis_shape (cognitive 53): utils.is_stroked_zero_axis_shape has cognitive complexity 53 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 11, loops 4 (8 pts), error handling 3 (6 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"59af255faad73e3da149c75fc12c0faac7656a2ed64f8ef58df474fbacc35f08"}},{"ruleId":"D2","level":"warning","message":{"text":"text_measure._outline_candidates (cognitive 53): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":461}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c54646f772a4e71b70463a224b71f9ba3ae472519c9f4335b088e6f687a9e2a"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions._validate_applied_motion (cognitive 52): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":1977}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd50386a5e621dcf911cfa6405257e01c9a658683fd15061d68b1078a8cc088c"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip.normalized_authoring_subtree_sha256 (cognitive 51): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"294178ac28cfbdbae902dd6c2872e72b90fc0243a9117cd3eded714eb5abee11"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._docx_inject_tables_markdown (cognitive 51): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":759}}}],"partialFingerprints":{"codehealthFindingId/v1":"6f214c0c28a158eed8df395812ed6893bee472d672254f41fa45d17f05f3aa49"}},{"ruleId":"D2","level":"warning","message":{"text":"native_payloads.hydrate_native_payload_refs (cognitive 50): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/native_payloads.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"789e3fff61dd1c21649f36d8849d0251d77ae5f6be4b47446da490a38ea3b452"}},{"ruleId":"D2","level":"warning","message":{"text":"notes_to_audio._expected_note_roster (cognitive 50): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/notes_to_audio.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"218ca1182d8b1ef0ab21b3892247ef577f3198a95e33c1f1e675992b02984aa6"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._validate_stock_semantics (cognitive 50): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92c5d5c508e4c36f5ff9d3881eea25e67714f09c350215d451e706d4abd5d67"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_preset_geometry_metadata (cognitive 50): SVGQualityChecker._check_preset_geometry_metadata has cognitive complexity 50 (threshold 15). Drivers by points: if/else 16 (25 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5514}}}],"partialFingerprints":{"codehealthFindingId/v1":"5346613fce5b9070a2ed3da625977d8ad020ac082aca359e2061f1a686e86e90"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_omml._append_run (cognitive 50): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":181}}}],"partialFingerprints":{"codehealthFindingId/v1":"5da6605c38e88f0c645d409b10535b8b3dafb7681f1268e881fc6bf8541c53cc"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_cosyvoice._word_boundaries (cognitive 50): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b28f8b3d65d20502a2cc8a6127423d95691e702060509453a68d7b2d08c7a15a"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_authoring._validate_expanded_authored_preset_group (cognitive 49): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":357}}}],"partialFingerprints":{"codehealthFindingId/v1":"412fb0bc94884fff719e2e0585b909bb02ba63fb118a80d469f13101652bdf97"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.audit_load_sets (cognitive 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":419}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d134ead6fe64b2fcaf770d01fb7ed09980433926606b738bd487807df26001"}},{"ruleId":"D2","level":"warning","message":{"text":"ppt_to_md.text_frame_to_markdown (cognitive 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":554}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ca354753a3718914d373946fe31768d489f28a5aad0d01128d15e1df3ca990"}},{"ruleId":"D2","level":"warning","message":{"text":"web_to_md.download_and_rewrite_images (cognitive 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":653}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8bb699b1c5aa5b4423634cc2d664771a793ce7c944b566e2afbd9eadbf0bdd8"}},{"ruleId":"D2","level":"warning","message":{"text":"table._resolve_table_merge_layout (cognitive 49): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"24c9fde66d74107d17a4e067c447fd4273edc8f7feceb4f02d214babb903ff26"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search.load_search_manifest (cognitive 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a9c37ddfb655e1575617b27b20c108a3c382a4bb0a1ecc73080c8cb39081ed3"}},{"ruleId":"D2","level":"warning","message":{"text":"source_to_md.dispatch_many (cognitive 48): source_to_md.dispatch_many has cognitive complexity 48 (threshold 15). Drivers by points: if/else 15 (23 pts), boolean chains 12, loops 4 (8 pts), ternaries 2 (3 pts), error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e772722e859eba25f1b36aae7727833a808ee02c3b3cce0b69c0dd8de48406d"}},{"ruleId":"D2","level":"warning","message":{"text":"_markdown_links._block_mask (cognitive 48): _markdown_links._block_mask has cognitive complexity 48 (threshold 15). Drivers by points: if/else 11 (34 pts), boolean chains 7, loops 2 (5 pts), ternaries 1 (2 pts) (nesting depth added 27). To reduce it, flatten the nesting: this score is depth rather than breadth \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_markdown_links.py"},"region":{"startLine":47}}}],"partialFingerprints":{"codehealthFindingId/v1":"77e774ad933e10cbf736a3c57566c85914f337e9ff962e49d6f0386cf3cfd766"}},{"ruleId":"D2","level":"warning","message":{"text":"ppt_to_md._xy_chart_to_markdown (cognitive 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":796}}}],"partialFingerprints":{"codehealthFindingId/v1":"cfd0b396ed00daaae4aa66e358a28c013aec9b0020db8d406e13d80e5655bbc5"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_omml._validate_xml_tree (cognitive 48): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":888}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e864dfd82be5852bb905e33ad1b45ec90302416115de5471f23f9d6a659d2cf"}},{"ruleId":"D2","level":"warning","message":{"text":"app.renderImageDirection (cognitive 48): 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\u0027s 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cd015789db39c3c7b12717dc067c13cc87e7be6ab5c137bdbf45945c836cdfb"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._validate_graph_roster (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":982}}}],"partialFingerprints":{"codehealthFindingId/v1":"76f0dccff22a03e1fcc6e41162d875152a0d332e5d81152035efc580c2df10eb"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._validate_legacy_axes (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1581}}}],"partialFingerprints":{"codehealthFindingId/v1":"588cf3d27a302a1761f90f69b0aea355366cdcdd774d7c237db4cc44c79bdc24"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config._morph_scope_errors (cognitive 47): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":826}}}],"partialFingerprints":{"codehealthFindingId/v1":"22b9955f59a6a03e09ec3f30b49c2f8c084df154c4aa3f6ab268da3fa739214b"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations.normalize_animation_effect_options (cognitive 46): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":558}}}],"partialFingerprints":{"codehealthFindingId/v1":"640c380e057bc1e97dbd7fe0087f693731f0cea7e843cc07396f9e1582a4bb57"}},{"ruleId":"D2","level":"warning","message":{"text":"server.main (cognitive 46): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7f6dd24d9810e1d3ef2b08b639f13e1127ccf4ce289f468d8619fec4060a78a"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._prune_unreferenced_definition_payload_parts (cognitive 46): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4981}}}],"partialFingerprints":{"codehealthFindingId/v1":"63f346ba04ce68006f630643953b720f3434ff610717f49ac6f726c26cb4d4d0"}},{"ruleId":"D2","level":"warning","message":{"text":"server.main (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2804}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fb1ba618ffd6cb9485722414d09bad029a242b932bd7e66443e1c09534126ec"}},{"ruleId":"D2","level":"warning","message":{"text":"image_treat._apply_treatments (cognitive 45): image_treat._apply_treatments has cognitive complexity 45 (threshold 15). Drivers by points: if/else 23 (31 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_treat.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"11ae1b6113bb140c720ccb6c5afca50af25f0fac938083c902d7f934c7018756"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_delivery_check._font_faces_for_advisory (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":462}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef3bc56a724cd4e70b52af6653d81f1eec6c10a959a85d81a93dbc8a257f7d63"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._extract_theme_info (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"832085d97b63d1a0e2aa1f2d1dcbaf623ce3cf4da9becd54d226976c0570f57c"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_workspace._sniff_resource_format (cognitive 45): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"6668fbd326eacd7d82921e1b4fe47751fdfff2789138a07e0085b5849392e166"}},{"ruleId":"D2","level":"warning","message":{"text":"register_template._validate_svg_template_spec (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"e28c772a91f8a34486dc4ff746baf488dd2c2406d31dd13e35c9b40cb60ddf90"}},{"ruleId":"D2","level":"warning","message":{"text":"ppt_to_md._paragraph_bullet (cognitive 45): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":465}}}],"partialFingerprints":{"codehealthFindingId/v1":"923aa8484608b4f3d0382f9cc7717c5b31ecbf0cc628567bf07bb9277b1cc02d"}},{"ruleId":"D2","level":"warning","message":{"text":"web_to_md.find_main_content (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fa365c155eb366a3c20f8bc3e8015a161dc94733786a4d6736b86a4fe91f34"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._roundtrip_text_diff_ids (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":1850}}}],"partialFingerprints":{"codehealthFindingId/v1":"0528dd35218107bc53e2a9f2985cc6f6166b91cad394badf84a54f4131f43c94"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_illustration_resource_contract (cognitive 45): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8018}}}],"partialFingerprints":{"codehealthFindingId/v1":"0217dee6b66cb2b2a16b713756853e67b668e6abe0ce22100a1043ba393299f1"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_svg_assets.extract_file (cognitive 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2413fd23e17722059de7c304347b8fa98110f535030ba9b2e723b0fcf701967"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._effective_scatter_style (cognitive 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1754}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f29b3944e4a60e94293c9ca89f31b614a585b6c73bf2ff1fec39edecd310fc5"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions.validate_pptx_morph_pairs (cognitive 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"40cebbe5e29bbebdf8ce3219101ee0527fd082786d5174d701f31746159bd0a1"}},{"ruleId":"D2","level":"warning","message":{"text":"resource_paths._svg_image_payload_error (cognitive 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/resource_paths.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ee5b1b6a1c3838e98213323cb8865f5e91ececa15f82ea73c4afd61074ef789"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.parse_project_nested_svg_crop (cognitive 44): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":5294}}}],"partialFingerprints":{"codehealthFindingId/v1":"c38e74041f6ecabe19d69e9c7243b6be0ceee5d6670db396021ae3ec7d1a059e"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_xml._series_xml (cognitive 44): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":471}}}],"partialFingerprints":{"codehealthFindingId/v1":"38d0609ed75c8e430a744d7e21a9e41509dfe8fca1aa9cf386e92954e76142b3"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._row_offset_ms (cognitive 43): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2590}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4f008fb993d2bfa607df2de97853e45b2ac9b418ef23000742fbd4cafcf7c3b"}},{"ruleId":"D2","level":"warning","message":{"text":"txbody_to_svg._wrap_paragraph_into_lines (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"818a97a6043e12633e3e19f4b257be228048f1f661d80fa0fad81e3554b9f139"}},{"ruleId":"D2","level":"warning","message":{"text":"project_utils.validate_project_structure (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e562713b34831d1a480b6892f90901a444c0151ea4803bc83c1f023ce055eb7e"}},{"ruleId":"D2","level":"warning","message":{"text":"align_embed_images._process_one_image (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"50fe50088676cb0c4756c500fcf048fdfa9e23f603744053cb7adbe0763526f0"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.project_clip_path_errors (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":4133}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa118789d86f4d2d3539606c3d46e1deef3d2c5cfb4a29c40d620b9110a946de"}},{"ruleId":"D2","level":"warning","message":{"text":"styles.parse_pattern_colors (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ddcfea99517f02e39b79aa77e93a08691fba81aa31c47eb73a0b5ab1fc239ec"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._transform_semantic_error (cognitive 43): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1167}}}],"partialFingerprints":{"codehealthFindingId/v1":"62346e3938e4add9122030a5607e6166c706fcb2402540a6e9bcc9fd44a2b7d1"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._parse_cd_environment (cognitive 43): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1539}}}],"partialFingerprints":{"codehealthFindingId/v1":"842d4358f539452c0c42469322d8da53c328a97b79b832fa1b491934928a51f2"}},{"ruleId":"D2","level":"warning","message":{"text":"app.rawMoveAttrs (cognitive 43): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2588}}}],"partialFingerprints":{"codehealthFindingId/v1":"779fc356dbb99e22e88f93c6d48e2589f5ccafada532888efe07a1b83e505c09"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._copy_text_carrier (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2002}}}],"partialFingerprints":{"codehealthFindingId/v1":"51f433e1d28c152dba4e01c7f00774a4456c6f9267b98341aa12d08d7b1ec991"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._set_effect_option_value (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1379}}}],"partialFingerprints":{"codehealthFindingId/v1":"63a3e5bcc4881cbf63e9f1b681b847fc39b5c4a2c734535a318794fe4d8dd9ea"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._managed_vector_asset_paths (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":961}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c5dfb9f237ab64b11b92942355b4ff07f4d2fc400545a22dba5fc95057bd1bf"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._build_cell_grid (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"90c793a10cbf377c4e4e08d5c87188c6dc85a1905735ec0b66dbbd94c561909d"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._direct_border_payload (cognitive 42): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":770}}}],"partialFingerprints":{"codehealthFindingId/v1":"83268751302a3dabf356ed401457d970aa014d5e0dd1ef9638d3ffb14a7736f0"}},{"ruleId":"D2","level":"warning","message":{"text":"page_context.page_context_usage_report (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/page_context.py"},"region":{"startLine":884}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d18cdb4f2380efe8451d0798b74ceecc898759585077cf952162260ecbe0135"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_position_calculator.analyze_svg_file (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":1061}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc9c2f8851279a2abb5e80514c5e16176d73c4a400b4772a0da289c04368fcb9"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._chartex_chart_data (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1428}}}],"partialFingerprints":{"codehealthFindingId/v1":"b76f7a8f4f171c39135839b707322d2eb7db8b6a0b5cd6f049bfe99307db9231"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_xml._data_labels_xml (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"804fd494715b83f9694bc2232abd17bce88a84e9616f92417a9453abe30e6978"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic_markers.validate_semantic_markers (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/semantic_markers.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce0aad41175665228b0980367dd54090db1095ab7575fbc2414f8a2fed184bd8"}},{"ruleId":"D2","level":"warning","message":{"text":"video_sound_mix._resolve_sound_cues (cognitive 42): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"008ff4e44b3f5c910d228d56707ead1ab284052c66fded6b19604eb7e1366434"}},{"ruleId":"D2","level":"warning","message":{"text":"video_sound_mix.mix_video_sounds (cognitive 42): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e46b4c733a85246b1b3b3c180ed51622a14f23ac9cffe6374d002dbb65fe413"}},{"ruleId":"D2","level":"warning","message":{"text":"app.boot (cognitive 42): 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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4528}}}],"partialFingerprints":{"codehealthFindingId/v1":"94859dd37a5948e0779077be1f99f2536d140f00da851b6d4441fda1b19450b4"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_delivery_check._motion_and_hidden_summary (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"48d4b7476a1b64b7e7a6bda6147b818915ca3defcd69a1f1182c8d1296e8e6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._normalized_chart_visual_styles (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1129}}}],"partialFingerprints":{"codehealthFindingId/v1":"206dc733effd6fc3510cb61bf5445c97e6893b8307961565de9b0b0a2b024fb4"}},{"ruleId":"D2","level":"warning","message":{"text":"converter.convert_pptx_to_svg (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"939f4f759d5677e0a00dbe25653f861c426d6ffd8b283147daf4b1354c7c082d"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_authoring._validate_compact_authored_preset_group (cognitive 41): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":208}}}],"partialFingerprints":{"codehealthFindingId/v1":"875202e167785188614ea07b47fba7ee1fa469b1997edd567b2b1110ea3d97dc"}},{"ruleId":"D2","level":"warning","message":{"text":"txbody_to_svg._emit_paragraph (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":1611}}}],"partialFingerprints":{"codehealthFindingId/v1":"43a41466394b2fafffedcfabea7008c7f035499c84e5d5a6ff61e4ed6c63a1b9"}},{"ruleId":"D2","level":"warning","message":{"text":"register_template._validate_brand_spec (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":521}}}],"partialFingerprints":{"codehealthFindingId/v1":"680d2aa179c8a562d0987613e92350087717d85f87fca83333b0c3f3696742b0"}},{"ruleId":"D2","level":"warning","message":{"text":"ppt_to_md._category_chart_to_markdown (cognitive 41): ppt_to_md._category_chart_to_markdown has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (18 pts), ternaries 4 (9 pts), loops 4 (7 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":917}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1ecd624494a9d7ec8ef5de75962ab5e7ef94edda8c18b6bded9b694d4e1ecb3"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._is_semantic_shape_candidate (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":525}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5b200e5f0550ef42b37109cc7fd35911f90200951311321abf7ffe215fd7c50"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._compact_semantic_shapes (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"8908f2248def5ef7c507b7b23072c07f55aea3d666b2a74bfe3c63323deeb1c1"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view.project_svg_batch (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2571}}}],"partialFingerprints":{"codehealthFindingId/v1":"f47ac3d066d7eed88616b90deebe67daa6a641076f4e3570192a8f5fd2b1ce97"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._clip_preset_geometry_error (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":3895}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cc17fc41330fe9a794d5fa2d7c7bd55c20d41f80faaf81a46f2b2c75e4dbe6a"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_patch._patch_cache (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb14e2036769e0aa8009c46187dd06c7f83b596f08315e0a07e2d14690bcab86"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_ast.formula_node_count (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py"},"region":{"startLine":498}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aa62ca1d0d8a5fd8bf846ff3cda6f68833310b0a72b2180080201b47d7e62c"}},{"ruleId":"D2","level":"warning","message":{"text":"video_motion_plan.build_video_motion_plan (cognitive 41): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_motion_plan.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"77bb123854cd4de4196e629e960a7c27d062cb6f5dc6becc6025f44383f244a1"}},{"ruleId":"D2","level":"warning","message":{"text":"compact_svg_styles._promote_common_group_defaults (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_styles.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6dd7a3e33fc821c0aea18a629e8fd745c8e409fb863c461b902c0f10146b6e5"}},{"ruleId":"D2","level":"warning","message":{"text":"language_tags.normalize_language_tag (cognitive 40): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/language_tags.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e3cda0e3abcb556b22a95d0ed2cd6d28731bbdff1337a4998a87e0c0fd5fda34"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._canonical_native_merge_status (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ad869c385c7a1929658bfed23873babc6d445a34243bc6ec60d551ab71d9502"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._load_project_svg_image_references (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8333}}}],"partialFingerprints":{"codehealthFindingId/v1":"8fe95a602723853783fce10c6a3c8fcd9b5b71ee78d17b2afd007451b25b1fe4"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config._resolved_animation_parameter_errors (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1325}}}],"partialFingerprints":{"codehealthFindingId/v1":"afbae00723e4bf076eb7a46fb17614458c98c9d1443ace31b9b7da828aa18de8"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_ast._node_vertical_extent (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"549f89825e9688c7c963783d258140e4017aa5c0af578da911fb9f415a0b0777"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._apply_template_text_language (cognitive 40): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6362}}}],"partialFingerprints":{"codehealthFindingId/v1":"8efa5aa50623c066d6fcb253023281760704cca3d6f203f3db63b32a9a3ddcc1"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._roundtrip_slide_patches (cognitive 40): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e17d118e605c90bb531aa2316694d4e85cbfa49e5a173e6ed6129ecdd1a5329"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._load_authoring_documents (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":623}}}],"partialFingerprints":{"codehealthFindingId/v1":"36308fff69de44a427e423bcf759134c6c4201fb38d8d19b43c8ae3f13d1c721"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._slot_plans (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1917}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3b9d1977585ae5a5628746dab0bfce521c87e0e9b8c025b4208b8f364d28ee8"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_opc_validation.verify_internal_relationships (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_opc_validation.py"},"region":{"startLine":265}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dca1064a1978cbc548228ca6f1d5f40c290aaa4e889c998cc8419b5a1a3c5fb"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageRotator.apply_fixes (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/rotate_images.py"},"region":{"startLine":348}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3cd9ae65915d0defd8e5030073f1184c5f594dde93ce591aea783d50fd94628"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._category_series (cognitive 39): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":878}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2ddda75635bd46bda085f103b2649bb51b3906fed69f1fbcc28eada3ea6d2fe"}},{"ruleId":"D2","level":"warning","message":{"text":"app.initKeyboardShortcuts (cognitive 39): app.initKeyboardShortcuts has cognitive complexity 39 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 5 (12 pts), boolean chains 10 (nesting depth added 10). None of this is in the body itself: all 39 points belong to 2 function literals inside it that branch (lines 1555, 1575). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":1554}}}],"partialFingerprints":{"codehealthFindingId/v1":"e47726a8fbbb284fceeb3febf6255bc1e442caaabc52bc6af5176bde57feba14"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_svg_assets._existing_placeholder_entries (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ddb961ca7de0936671fe8c4bc6e52542829872433c6fc8fde27b5731cc88a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"ooxml._container_geometry (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/ooxml.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fb9943751f969b6f205a6a955cc7f576c623ad509bd7859b6606019eb6cacc0"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._docx_image_occurrences (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"513a167fd271528105b8fcfbd4b6de3c8a81cb96988420bd4c82b846ab031ba3"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._prepare_odt_for_pandoc (cognitive 38): doc_to_md._prepare_odt_for_pandoc has cognitive complexity 38 (threshold 15). Drivers by points: if/else 6 (22 pts), loops 5 (12 pts), ternaries 1 (2 pts), boolean chains 1, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1586}}}],"partialFingerprints":{"codehealthFindingId/v1":"532006de08200b7df0252c50ce8f69f1834a4b66ac523e79f099ae734c3150d2"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._roundtrip_changed_font_families (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2123}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d7daf90c050b7d622b5ebbf4d3c877bc48821d32839bb710bcc08d1eb6db59"}},{"ruleId":"D2","level":"warning","message":{"text":"native_objects._decode_source_chart_package (cognitive 38): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba212f8fc20b23de4fb4528a0f5f738ce1b81abfdaddc34163399a3e19c8a075"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_omml._append_node (cognitive 38): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e2ee912fbd5c8ee6e4acc08014e65a1d7ce4e4f7f1803f3c6207e91ffb7b270"}},{"ruleId":"D2","level":"warning","message":{"text":"marker_status.native_marker_status_errors (cognitive 38): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_status.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"026a0e0cdfb2b72f1458d4a8d098bb8ffeb5c8d2a8e3efb499367a16100f782b"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._data_label_text_style (cognitive 37): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2539}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f3818319630546f826eade0b0c130a9e1fd87a4e5a22588ca3df7cca6d2c401"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._write_artifact_tree (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1342}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd1050f698cba10784298e773108a29a5ff73032bab0c10b3438d805a14902fc"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view.main (cognitive 37): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2771}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddb469b6149c577981962bdd3049480fa2f854bb1e77397ee46955899498bf56"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._record_carrier_receipt (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2714}}}],"partialFingerprints":{"codehealthFindingId/v1":"64a6f405a50b71a71baff9322437e996e2880855e1523d6d4d85c0c26dfb8d0f"}},{"ruleId":"D2","level":"warning","message":{"text":"paths.project_gradient_geometry_errors (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py"},"region":{"startLine":394}}}],"partialFingerprints":{"codehealthFindingId/v1":"878284e74cdf83ece5018339575e34ee202326e498e6d85d90b4012a29dfb724"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_xml._chart_plot_xml (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"494c59b3e3452f7e6afa68dcd68aa49dcaa7cc6a82bd67a4515ac9e5256d6cff"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._find_matching_character (cognitive 37): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1350}}}],"partialFingerprints":{"codehealthFindingId/v1":"268a2e7b57d6f9380d8dca4fafbafa0bd74e5bef92f0cae06052a40ea85f0bd3"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.template_prototype_lock_errors (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2202}}}],"partialFingerprints":{"codehealthFindingId/v1":"20cb47e4ca28db551ecc63b2a9a188586ac68cc5987a7f06f419cfa082da5aee"}},{"ruleId":"D2","level":"warning","message":{"text":"text_measure.main (cognitive 37): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"b72dea2225b18be51af0dc270b53a858ab29a07961d2a5d0101fa3fe9fdadf7c"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config.main (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/animation_config.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21057c003046b347b143360c42eb62c8fec8c430dcd9cd93407e93ca794daf8"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search._save_candidate_thumbnails (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":882}}}],"partialFingerprints":{"codehealthFindingId/v1":"0812e6c7af865d349c5672c186ae9b01ccfa632724ea323995b77bb4edcef36e"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._mark_explicit_breaks (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1271}}}],"partialFingerprints":{"codehealthFindingId/v1":"88ba150267fc59e688b1d9c964b2d3a0213b1a6ef306315bc83210d76891d80a"}},{"ruleId":"D2","level":"warning","message":{"text":"narration_sync._load_timing_plan (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":360}}}],"partialFingerprints":{"codehealthFindingId/v1":"31004a2c534edd9b8ba6c4d874c8d09ef9523d6cddffcef187d873586b6d5521"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations.validate_pptx_animation_package (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":3461}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d179777984baa7ea4ee0f01a89644c37970f1feaa0670fc1598463636f5429e"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._roundtrip_chart_package (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":2102}}}],"partialFingerprints":{"codehealthFindingId/v1":"240cd44a470bcd43e1f732c13f8d15297fe90c6168764c4b57b73b8727cea6ce"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._legacy_text_body_has_unsupported_formatting (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1112}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e0b02dbb7ed7a640f0b1caf01c72549fbca12b8dec26df763c5931b28176790"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_contracts.check_authoring_property_contract (cognitive 36): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":499}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7d8b7b156c7b1f6c7155891e94ae81d680a736071185752c8ccf034b50e2288"}},{"ruleId":"D2","level":"warning","message":{"text":"app.enumField (cognitive 36): 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 \u2014 checks laid out side by side rather than stacked \u2014 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"842e946c1cc9a3ec928e14c4d2d3676414b42e63eb5857f64527cf1099c32645"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._load_page_plan (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":628}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c464f4ea589298602b90caeff79176b7c8e547bf8ad616db0a5256871685edb"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._text_body_state (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1573}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dd4ad1768c40d876b2215142c5dcc7ce6860f06316cc2c7f26235ad1194f1b1"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._build_geometry_xml (cognitive 35): slide_to_svg._build_geometry_xml has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 8, error handling 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":1267}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab203c45125d7ee06f63d591af087081cf24854e0300d04e51fa04c6a2cecd09"}},{"ruleId":"D2","level":"warning","message":{"text":"txbody_to_svg._parse_paragraph (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":682}}}],"partialFingerprints":{"codehealthFindingId/v1":"28044fc5dfc77cc56316899ef6e0c17320a2af5c31e96889e5e61514e230c231"}},{"ruleId":"D2","level":"warning","message":{"text":"project_utils.validate_communication_trace (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"a3b61bb8e4db4aec9473d7168962320290e0b8480d8b9ee796b06589e72b7ef7"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_animation_group_ids (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5789}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ef9d1b02b2a88053ba3420e4ff6e67af5641e376cbff2a3b499f520741047a7"}},{"ruleId":"D2","level":"warning","message":{"text":"styles.build_gradient_fill (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee92e8eccc6192bbd605892946b5960570b76b07c23ffd0ac0480c51e52b1e80"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.template_lock_errors (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2363}}}],"partialFingerprints":{"codehealthFindingId/v1":"db745b7444636d004f8787ab28604c39126219b12e039742c74a0e11893686a4"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure._placement_lint_errors (cognitive 35): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":3675}}}],"partialFingerprints":{"codehealthFindingId/v1":"cda1cb1bde25e950f72b282bce513b691ee7080619a783487aaff02543a40f52"}},{"ruleId":"D2","level":"warning","message":{"text":"native_payloads.externalize_native_payloads (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/native_payloads.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b9cb78cfbef4ee89d54301c283386e4265f13aaad43f3e746c9f9dd3d2eda6"}},{"ruleId":"D2","level":"warning","message":{"text":"native_payloads._load_store (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/native_payloads.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd0dd5902eb78222dd0e6ef9d108077e6cef324e344e5373fc33611cdfb504ea"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._scale_animation_row_duration (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1182}}}],"partialFingerprints":{"codehealthFindingId/v1":"23552ffb48ba5245284421936c8ea5ff459962a7d1235373977b96c1c81f735f"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._resolved_line (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":731}}}],"partialFingerprints":{"codehealthFindingId/v1":"7022392171030e25fbe2e0c5e495cd741e8cbac2195b208056020a5dca77b9fd"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._canonical_title_paragraph (cognitive 34): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2412}}}],"partialFingerprints":{"codehealthFindingId/v1":"9434b67adc62416c7ea8981c7e3188c4547c89b78f1b7f063ff6711ec1612e95"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._managed_report_artifact_paths (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"60903467d8271fcfdedbdb6abe14d54ba9dc68bc20aef6b9b66603b81343bad3"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions._validate_transition_sound_package_parts (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2521}}}],"partialFingerprints":{"codehealthFindingId/v1":"8628404a313592e90a2cb9e66395245b65715bbfcea49632a22b79f84cfadfb4"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_rect_to_path.main (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/svg_rect_to_path.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b716e0ef1bc3ae7a7d30b3f20e215838e88a2be5839cef79820cb386fd373170"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._carrier_effect_receipt (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2821}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba2d9db44b8ffd03eeb7e41591430060755ff4c4f58566455251433565bb6d35"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._extract_background_candidate (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1656}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c18c746512a253c219dd45dff8009bfc38df8ac4ad70dae6bf7c09c4e8d914d"}},{"ruleId":"D2","level":"warning","message":{"text":"table._table_run (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":314}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e1a244c90523bb2cf5929e98729aae9dcae77be2a329f4aa52b3948929e494d"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._ensure_notes_master (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":5620}}}],"partialFingerprints":{"codehealthFindingId/v1":"96d29de1d4f8da3a4607152ba99ed8f76f7c7f40b8884ccb9b245fbacb7995e1"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_boolean._connected_components (cognitive 34): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":1080}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb711151ca5a88c1c055f86f58c844fad150c54ff7d6dd2c5743474fd09f83d2"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_workspace.inventory_package_resources (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":794}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8f2fb747213fdbd5dbdb3620785f94eb600f71f416852ead86758946cb6afaf"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._convert_docx (cognitive 33): doc_to_md._convert_docx has cognitive complexity 33 (threshold 15). Drivers by points: if/else 13 (18 pts), error handling 4 (7 pts), loops 6, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"73dc747bc553a45d307c1b966726d715c02faaef5b87a006be1f5b35b277d2a7"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._convert_ipynb (cognitive 33): doc_to_md._convert_ipynb has cognitive complexity 33 (threshold 15). Drivers by points: if/else 5 (11 pts), loops 4 (10 pts), error handling 2 (5 pts), ternaries 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1507}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fa491df47a8f11fce6ad21646a8f468fccf44b4b8ec3ad8630dc3fdc6b82413"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.parse_project_filter_params (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2712}}}],"partialFingerprints":{"codehealthFindingId/v1":"826e8c380d66a92dcdf2b3cf09a0ea545773c219c0e80da5bf58955fa4d46c38"}},{"ruleId":"D2","level":"warning","message":{"text":"native_objects._validate_native_object_marker_payload (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"edab49fdfe10c9062d5e1481d9cd661168324df386d4f14105777eb33c449f17"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_parser._collect_macros (cognitive 33): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"116922aa1e0cdd41fcddb7d8cdcb9d606435421c9312b8b4ede1cd65a9d208f9"}},{"ruleId":"D2","level":"warning","message":{"text":"total_md_split.parse_total_md (cognitive 33): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/total_md_split.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"be6fb3a43fe93382d7ae8169bfef8725c3baa6217eb143f4f034592f64633ca1"}},{"ruleId":"D2","level":"warning","message":{"text":"clone._report_all_dangling_slide_jumps (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5c951b1912a872301ee845e8b5dd2c698514026d73e3ca41afef884f828d45d"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_template_import.main (cognitive 32): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_template_import.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"38766b00ca0098d86e8d32a67ba4a58487a4a3d43b3295bcd36bafbbdade355f"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._payload_from_chart_xml (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"47e5997107b5b45ec579fafccc905f610cc5f7621bbce45d5aecbfb16d1f8372"}},{"ruleId":"D2","level":"warning","message":{"text":"pic_to_svg.convert_blip_fill (cognitive 32): pic_to_svg.convert_blip_fill has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (21 pts), boolean chains 7, ternaries 1 (2 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"687d51d4ee6ced499fcee19c884a5dc0424fcd34ed6c16e6343f59afde234b2a"}},{"ruleId":"D2","level":"warning","message":{"text":"page_context.build_page_context (cognitive 32): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/page_context.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2e2fc9ad690ea6599d883712c9b6713d475895f56c62f8b28b5ebc7c506412c"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._roundtrip_text_frame (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2445}}}],"partialFingerprints":{"codehealthFindingId/v1":"442ed74b3c2361e6196592ae98ca2effe8b10ed8a7aa7b959e8066b318111421"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_placeholder_carrier_flattening (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6289}}}],"partialFingerprints":{"codehealthFindingId/v1":"912254b46c2964bfb85ad9f5f815c78007509e54c55b85a0d76827d60d17f5e9"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_sourced_image_attribution (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7062}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5eea9cea8b659f176ee00256a33db59d66f827673569063ed56fe54454e4628"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config._resolve_morph_pairs (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":935}}}],"partialFingerprints":{"codehealthFindingId/v1":"571246150a7410170bf7071636ecb0b8a915ab756f77846e2694361d4dd331c8"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.validate_preset_geometry_metadata (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":978}}}],"partialFingerprints":{"codehealthFindingId/v1":"c1bf42662a028078cb450241e75b0e488ce2c1a40550f3a3f9c2377cbb4ec1c8"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.convert_circle (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1483}}}],"partialFingerprints":{"codehealthFindingId/v1":"600e70a4f90d0d0aed999ea67457907bba6ee9fe30bb78144b5123718b844612"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._legend_candidate_texts (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":675}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f3120a670696061f6c869e780afeb58ae28c721ca5c9fa83b1034c475c303e6"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._apply_morph_shape_names (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9b6537787f2f8886f0fe6b49b24b31c2cdbc15db190c9c7ddfcc31163ab6d37"}},{"ruleId":"D2","level":"warning","message":{"text":"manifest.parse_theme (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/manifest.py"},"region":{"startLine":425}}}],"partialFingerprints":{"codehealthFindingId/v1":"35e070713d891ca4b5e42ec3dc88b5b8ab75766f6c5a2f497300388c0d661555"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_minimax._word_boundaries (cognitive 32): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_minimax.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"67a43f20ec15423d9988efe1d835edeb238142651216a19cf1641c261f0bb294"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openai._collect_response (cognitive 32): backend_openai._collect_response has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (24 pts), boolean chains 4, error handling 1 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_openai.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"782ef58c3ac5fc568af2d956f8407f282eda0a7e39b10a93f36f6c3843e325b5"}},{"ruleId":"D2","level":"warning","message":{"text":"latex_render._make_png_background_transparent (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/latex_render.py"},"region":{"startLine":347}}}],"partialFingerprints":{"codehealthFindingId/v1":"c655ace83e8d465df66ecee0749dc65852df04dc2f94127935b8a3cfc83e966a"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._apply_timing_options (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1513}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a4db8a8a6bcccc945a31d902c50ffbab81df65f0e885260dea9051432d744b0"}},{"ruleId":"D2","level":"warning","message":{"text":"clone.clone_presentation_slides (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4f71f2babf0dd353500cc9ad95fec74d295f74d142418d2b0c90b9622be350e"}},{"ruleId":"D2","level":"warning","message":{"text":"converter.publish_staged_workspace (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1239}}}],"partialFingerprints":{"codehealthFindingId/v1":"49a0bf4d35dd88a8bc77195fcecd67270bb5cf0bf005646cc0058d3dec3a773b"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._write_roundtrip_manifest (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1602}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b28578e420e5724c022a716eea060616715af8cfea205c2d4b6ff35d3ed3578"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._convert_graphic_fallback (cognitive 31): slide_to_svg._convert_graphic_fallback has cognitive complexity 31 (threshold 15). Drivers by points: if/else 13 (20 pts), ternaries 4 (8 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":1907}}}],"partialFingerprints":{"codehealthFindingId/v1":"98c01bb32708b4d98ba20b34291dcdbcfeeee6d8482f73097c153e2eaf765acb"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_shape_svg.main (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/preset_shape_svg.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a92783052f0edb27a9f0f9e298b118e561e9bc540ceef3fd4bba67044979e05"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.extract_references (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":932}}}],"partialFingerprints":{"codehealthFindingId/v1":"7952fb39315f075a526b5ef4fa3d51c96b6fa538dc788cb0dbd5fe4f28bae9b3"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._sanitize_epub_manifest (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1288}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a11a11ebace70f1fb70f087fee7950e4bf05d14c31b41d813d20b2c4880d806"}},{"ruleId":"D2","level":"warning","message":{"text":"web_to_md.extract_metadata (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":797}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc24a936439ed01c52f56aa0677bc8dda2baeaca197a1e477fa26f81529f7c28"}},{"ruleId":"D2","level":"warning","message":{"text":"flatten_tspan.main (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":926}}}],"partialFingerprints":{"codehealthFindingId/v1":"25bbd4b8f93eae8d6afd18be74b95b398a36b08f61c98fc58984a265a144d1ee"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._text_width_diagnostic (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4131}}}],"partialFingerprints":{"codehealthFindingId/v1":"7678fb6927dbf2c84b63bd59fcb279ab75d0adbb0a19fe1e270c2880809043d6"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._nested_crop_clip_preset_geometry_error (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":4000}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dfe179361f781060acd742d601827e9e9bdec7e2d5c74abd5e88ffdf93773b0"}},{"ruleId":"D2","level":"warning","message":{"text":"paths._parse_svg_path_tokens (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py"},"region":{"startLine":186}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40ddcd5649023d3a2cf15fb94b0235b22d08ed83e674a5c919d510a38344f62"}},{"ruleId":"D2","level":"warning","message":{"text":"theme_fonts.apply_master_text_style_spec (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"5938c9804f389b24233ead1c70ed232b735dff91bdd3f26221f9c421a9b64fd5"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_omml._validate_drawing_element (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a0194c1ee7a01092a2cca171b324e2344cb676545660b73ebce47a8fdf0c67d"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._source_resource_audit (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1176}}}],"partialFingerprints":{"codehealthFindingId/v1":"0179cdf3b72482ff96ee48fdabe8e2830e16e5e7922270da2008c9bbfb2c2135"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.load_template_source_themes (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":580}}}],"partialFingerprints":{"codehealthFindingId/v1":"1dd6b9e97bf50fb185a172c944022f6aaba3e26f75f72a5949b66f959e855fe9"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_boolean._validate_geometry_presentation (cognitive 31): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ec98c1c08117892d2b53e9b3f364c915db9b31e52b3b7dfc1d534b00223e16b"}},{"ruleId":"D2","level":"warning","message":{"text":"app.initStage2State (cognitive 31): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4073}}}],"partialFingerprints":{"codehealthFindingId/v1":"83a5491a8a6b3f22f26d0cb288e0b3178e3a229c307817e13b7d05cab34e74d8"}},{"ruleId":"D2","level":"warning","message":{"text":"apply_template._plan (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"d07a68759d22665db1d897b90a208635951a1e8f7ebfa2a30f0e1e1d390f5253"}},{"ruleId":"D2","level":"warning","message":{"text":"beautify_identity._sample_observed (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/beautify_identity.py"},"region":{"startLine":163}}}],"partialFingerprints":{"codehealthFindingId/v1":"8a20e94b4d3af6979093f597e05ee7bbc5a5a93a40e9909a26ee40edd02fb42a"}},{"ruleId":"D2","level":"warning","message":{"text":"beautify_inventory.main (cognitive 30): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/beautify_inventory.py"},"region":{"startLine":370}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bf5e69f3e78cc7ab7a78e893a35cf8268376968066a9ebb8169547a9308f9e2"}},{"ruleId":"D2","level":"warning","message":{"text":"server._build_template_library (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"43363bf1645d5e31e8633c8a80312ee69f9f23738fba96c499b1fbe1ce895d34"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_svg_pictures._run (cognitive 30): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_pictures.py"},"region":{"startLine":890}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad1af2c6c80b78c5c037177c59aa7387d56023a3bb943f857309b8b06fb4f3cb"}},{"ruleId":"D2","level":"warning","message":{"text":"image_ocr.separate_zones (cognitive 30): image_ocr.separate_zones has cognitive complexity 30 (threshold 15). Drivers by points: ternaries 2 (10 pts), if/else 3 (9 pts), loops 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_ocr.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd612bccd5ffe45e85e47bde3a52e88adfef112c2299c89cc20a7231fc28f7ec"}},{"ruleId":"D2","level":"warning","message":{"text":"slideshow.custom_show_problems (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/slideshow.py"},"region":{"startLine":43}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6a7ea585d7ab366788bd9c9d89a94fe0dd4223b1f5ec30e63ba9100575f02c7"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._pie_visual_styles (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":909}}}],"partialFingerprints":{"codehealthFindingId/v1":"34cdb9b9ac63d0917f9ababcaff3c8c5dd8fed9a5a1abecd628b0d35e072ce80"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_authoring._validate_style (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":690}}}],"partialFingerprints":{"codehealthFindingId/v1":"974ef028782fac2c53989fa82aa5bbec9af2579e455063dae183159ffb6facca"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._effective_shape_stroke_properties (cognitive 30): slide_to_svg._effective_shape_stroke_properties has cognitive complexity 30 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 4 (10 pts), boolean chains 2, ternaries 2, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":1451}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e52fa13035500f3871fa4ed862cd700d4eb8b987af959076e7bd7207fb988ea"}},{"ruleId":"D2","level":"warning","message":{"text":"txbody_to_svg._build_run (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"310a4e036ddc4a16028ab17dad607b203766b0cc9845ce77ab716eb499d4a73c"}},{"ruleId":"D2","level":"warning","message":{"text":"_batch.run_path_batch (cognitive 30): _batch.run_path_batch has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 4 (8 pts), boolean chains 4, error handling 2 (3 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_batch.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb755b6847d2fadb61b9d96f0836880e602a7ac3e46f06b1904c4d6c4723371"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._convert_epub (cognitive 30): doc_to_md._convert_epub has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (17 pts), loops 4 (7 pts), boolean chains 3, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"c39947ad7270ea8024cf727642102958bf082f9f4339c04dfb83ef1084377195"}},{"ruleId":"D2","level":"warning","message":{"text":"server._validate_edit_attrs (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":298}}}],"partialFingerprints":{"codehealthFindingId/v1":"c308c4627d6c7268c02e151b6e2b9a11f890d329b0be0d6b179f13670b9a3bb7"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_contracts.check_forbidden_elements (cognitive 30): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb023c5a01d04afcde3f8162f8cef2d0daaa11d7783f9d1c6a7352093a6b469c"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_contracts.check_paint_compatibility (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":292}}}],"partialFingerprints":{"codehealthFindingId/v1":"50c93b5382becebccfe6706e42ae48577a1631344815e4b1283348eb4b511902"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._chart_companion_shapes (cognitive 30): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"61df2687e0b490f0b039268766981468d2731055133e95a7e5f637c63a1d7cd5"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_xml._axis_pair_xml (cognitive 30): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"95293c93918c9f7a4393b2eb4d57ce9e0d88f6db0313ad1de662ed6580f248bc"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._parse_sequence (cognitive 30): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c40c2787968fcbcca9c14c7f55158986fd2ba3305164ee8a3984c6e4dcb5e226"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._roundtrip_animation_config_for_pages (cognitive 30): 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 \u2014 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":242}}}],"partialFingerprints":{"codehealthFindingId/v1":"6971a08784e8e9996efed8801dcf737896bcaf1e04aa702df4ff19bf4803cc03"}},{"ruleId":"D2","level":"warning","message":{"text":"text_measure._run_calibrate (cognitive 30): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"81449bcc87abaa6eb8e174f6222ac4c380ba1808d07d66137a32ac1ad0e5e3f5"}},{"ruleId":"D2","level":"warning","message":{"text":"app.initRubberBand (cognitive 30): 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, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"551e337324f3dc65a10aa1406b6800504d7fd0af3a9f498a3003b6d0088c28db"}},{"ruleId":"D2","level":"warning","message":{"text":"apply_template._write (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":519}}}],"partialFingerprints":{"codehealthFindingId/v1":"177dead7d71df563e5d552d17477dee9234314a8ce0981b61f8a08500144bdc9"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_common.fit_size (cognitive 29): backend_common.fit_size has cognitive complexity 29 (threshold 15). Drivers by points: boolean chains 11, if/else 8 (9 pts), ternaries 4 (6 pts), loops 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_common.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"011e4454ee39f0aa609cf722078f02b099d75a0c74e4e2c6a40d31d7e47af9c8"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_gemini._generate_image (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4adbd5291e8a5550e70833712719f9079996f282e07c1c3d87524aaf7f1ab2c3"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._slot_wrapper (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7fac0ffb2551d731b4b842537137d4cbddc907cdfad9596be0d94cc004851fba"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_to_svg.main (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"1458e7d427ef854e551c4c5368eaa253a12321fcb5639e21ecd266c107ab483d"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._source_chart_text_style (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2668}}}],"partialFingerprints":{"codehealthFindingId/v1":"7285407a8d8206f329456bc6704810a9a37ec1548b396709c5744a35285bb5fd"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_walker._walk_container (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"f25152009f8aed4021d1ceaf6ccd5dc239626926277f81c87124a6e211443dc9"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._convert_cell_text (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1702}}}],"partialFingerprints":{"codehealthFindingId/v1":"048b29c38f2ba0995558cca81a840f01ec0c3326b4cc839cf80be9872aeb17c5"}},{"ruleId":"D2","level":"warning","message":{"text":"excel_to_md._content_bounds (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/excel_to_md.py"},"region":{"startLine":172}}}],"partialFingerprints":{"codehealthFindingId/v1":"48240221e28bb984658be45489631eb36c1303f1b007cdb2ea40366bd422e443"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._imported_model_text_lines (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3868}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c13eaae4a790c8033d9200cc38d8f2b5355f2b4ff03d3da5a48bb46cc29c66a"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_pattern_fills (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5949}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d348a971505209d3a4913e06974b00fc3a6de34c30643607501c8ba1e1243ad"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._valid_emf_payload (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e76a1a028da9d2adfee0fa40ea69c664b91ab6a6d492379ddcbdbca7ca3c895"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.parse_svg_color (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1791}}}],"partialFingerprints":{"codehealthFindingId/v1":"75218fdcf96a91e6299c5af55cf027487bf76275cf755e3792440bea44ddc6cb"}},{"ruleId":"D2","level":"warning","message":{"text":"table._table_cell_paragraphs (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"73ed08bbdc97d768429d4f889413fed1e9c3117386d0d8fa117e46d94d5490ed"}},{"ruleId":"D2","level":"warning","message":{"text":"text_measure._lexical_units (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8b6ba3664685e41ddee6ee51fd0e82572f507fd767a323b366d1002a86892a6"}},{"ruleId":"D2","level":"warning","message":{"text":"app.normTypography (cognitive 29): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1812}}}],"partialFingerprints":{"codehealthFindingId/v1":"79506e9ce1c38f0f39fff8d1a3a1971497ce2f9f5cb2bca1fcade82e2fe2e82a"}},{"ruleId":"D2","level":"warning","message":{"text":"app.renderColor (cognitive 29): 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, \u2026). The named helpers are already separate functions; the literals\u0027 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"b363c0373b0d70a2cba6d18cf92e7cba3dd387454ba0c72e24f4063666e43247"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openai._edit_image (cognitive 28): backend_openai._edit_image has cognitive complexity 28 (threshold 15). Drivers by points: if/else 17 (20 pts), ternaries 6 (7 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2e45915e823d51022b1623ac227b2639ead46537fb09616213d841ef6f10641"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._rewrite_packaged_assets (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2861}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e34121a4f0eb23154fc13947bc8687cccbf93aa3dd9cf6d02a9505f885d9b7d"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._timing_summary (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d67dfa0dbad7abde77e4283e998d9b6cf108bd8e8ed19c631b2b4ddaa4bd059d"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._resolved_solid_fill (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":680}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e77560c54c65c0c4b76a024811bcfa0577b4e4ee4cc26841a723084f7c9634e"}},{"ruleId":"D2","level":"warning","message":{"text":"chartex_to_svg._payload_from_chartex_xml (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py"},"region":{"startLine":93}}}],"partialFingerprints":{"codehealthFindingId/v1":"0d07ba510e0a64f5d4bbe5e545a7f9ceb1b61b418ca3a4bbf79970b44de5bd8c"}},{"ruleId":"D2","level":"warning","message":{"text":"slice_images._keying_findings (cognitive 28): slice_images._keying_findings has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/slice_images.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdd0c54ceceddc46a640aacf13bebb6079359f45ee4c0a40950a5ee581e8bb3"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._docx_replace_math (cognitive 28): doc_to_md._docx_replace_math has cognitive complexity 28 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 2 (6 pts), loops 3 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":608}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b686a6e3bd2c892a94d7b77f1f62bd62c8656299ea98d9de408c69bf6527371"}},{"ruleId":"D2","level":"warning","message":{"text":"web_to_md._curl_http_get (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":260}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d217f04b43423d3ed9dd71fa92d9ed7153eeba2cf4fdb4f1d864f44aad31db4"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config._declared_animation_sounds (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1425}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ff9729cab8cdad037d57c614bb4241254ef58ab26c5af5e5ded9d7ad725656"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._resolve_clip_geometry (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":4248}}}],"partialFingerprints":{"codehealthFindingId/v1":"a461debd6dc04be72e5b2076700e2794ce70c1c83cfc26035fb107d6325a980a"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._native_chart_export_payload (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":591}}}],"partialFingerprints":{"codehealthFindingId/v1":"19137558671acedb5a6a362dd662d59e2c98e8077b621eb942b5b5dcd408c66e"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._renumber_roundtrip_generated_shapes (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1640}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5dab8394cb69a6016ec07161a970dab5832d6f41898bb4f18f464aeff0f339e"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._placeholder_text_body (cognitive 28): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3902}}}],"partialFingerprints":{"codehealthFindingId/v1":"c23c6d66926a1146adc60459cc02ae8c5760f0927023242e3c3c1f334593d92b"}},{"ruleId":"D2","level":"warning","message":{"text":"app.renderDesignDirections (cognitive 28): 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, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":2277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9533e826591a15a7b3ea40bfdccc1a49cb7fba5c090985d499dbda65412ab2a"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._select_supported_timing_branch (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2872}}}],"partialFingerprints":{"codehealthFindingId/v1":"599c04e8fec9c6f9418622f2bdaa27e90a751c528b323bb038e88efea41ead3a"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_delivery_check._content_type_maps (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"11b1f2238631a64c4413c58f4cbc63d61db909b7254fccb7fc13f6f91e8e778a"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_embedded_fonts._font_relationship_ids (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_embedded_fonts.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"40dfb193a2aae5c5db59fe7b0efd59ab2a0f4c50863f8bc1859f75097d5b366c"}},{"ruleId":"D2","level":"warning","message":{"text":"clone._remap_reachable_shared_layer_slide_jumps (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":411}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4249b2db793a39371ee35c967df13a8488309175bb0610a0e3c115ff3c4fe8"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._apply_plot_data_labels (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2090}}}],"partialFingerprints":{"codehealthFindingId/v1":"e998c0eca5152736f5feaf83de79dc67210a76ca016f4d16b39d81dbc8fc468e"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_workspace.validate_roundtrip_output_path (cognitive 27): pptx_workspace.validate_roundtrip_output_path has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (15 pts), boolean chains 4, error handling 1 (4 pts), loops 2 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":929}}}],"partialFingerprints":{"codehealthFindingId/v1":"0686f33b916a0df15b40d3ea02a35239c4ed39af236d65e38cb937c0b9a506f8"}},{"ruleId":"D2","level":"warning","message":{"text":"_markdown_links._destination (cognitive 27): _markdown_links._destination has cognitive complexity 27 (threshold 15). Drivers by points: if/else 10 (23 pts), boolean chains 3, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_markdown_links.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb93701fe68ccfa29905f2eebc986c0fd3c5332f58312ff2e481c4aad4bb2150"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._docx_show_visible_run_text (cognitive 27): doc_to_md._docx_show_visible_run_text has cognitive complexity 27 (threshold 15). Drivers by points: if/else 5 (14 pts), loops 4 (11 pts), boolean chains 1, ternaries 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":543}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddc307592dbcb70b82373e103fe2ae522a88d5fcbdc69715fcd60184160d7e3"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view.adopt_authoring_object (cognitive 27): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"9c9d7e64c86571e84fb1d2a2f0f2f7e0910e127c42313127bc6b1b6e1c9d579d"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_icon_placeholders (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5403}}}],"partialFingerprints":{"codehealthFindingId/v1":"073f9dbce8095ab510495d7033bf55518519f9f6c6e876295b87cf1d66aaf89c"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._geometry_trace_metadata (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1772}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd2d52c4ed62d615ec20624e28a57fc1547f83d1205e69b2dcee829a65401fc8"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_parser._expand_macros (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":311}}}],"partialFingerprints":{"codehealthFindingId/v1":"88a36cce5671f005cd825f83b2d5bd82d5500a8b4108e27e0a78db95c44d7fe3"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._merge_roundtrip_relationships (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1231}}}],"partialFingerprints":{"codehealthFindingId/v1":"8da06c2f659cc98f63c61f8b0f64d2558bf46527f6d50d5ffd4310e6e09862c7"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._native_object_preflight_findings (cognitive 27): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1775}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ae565383400731a9daa7251bf079cf96116264ad8acc299990d932714477f54"}},{"ruleId":"D2","level":"warning","message":{"text":"app.renderDirectionComponentCandidates (cognitive 27): 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, \u2026). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":2472}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5da3fcbca64b9effc9519eb6c8333592ed5dc991ce98d10c36408cc15424bb9"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_svg_assets._load_reusable_assets (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":676}}}],"partialFingerprints":{"codehealthFindingId/v1":"1449e4e8247bb5f463641464de5494b7475cad928eec8a648a4aa1075df87a81"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._load_vector_assets (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":766}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e4218c651a44f4515e4996524cc7b6b0484cbd8bfbc678f97af7bf444a338a8"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._flatten_fixed_group (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1532}}}],"partialFingerprints":{"codehealthFindingId/v1":"f6c3750e2a8a946fd43f29164d5553e255ba698678559127742eeae4229578bb"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_import._normalize_colors (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/formula_import.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e39588f34689d5cc34b7098bc5476599bf963707b7e6fe57026918767f475d2"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._wrap_shape_group (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"69b7863e203c066c23a1d64195a161b83d38a4e2d64df4702ff67add2cf5b53a"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._cell_rich_paragraph_payloads (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1501}}}],"partialFingerprints":{"codehealthFindingId/v1":"6dc814c58b4d46f90c0c1c27f7ceea7f2417bbdc6e6ac22f59dc9c0bfb7db503"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.find_near_duplicates (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3372940f83998aff2eac5fc66970a9593be2b81b7f0693a8c9465f8454651eb"}},{"ruleId":"D2","level":"warning","message":{"text":"sound_sync.sync_sounds (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/sound_sync.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e6d4ddbfec6f6280f0c35e03c9b4180a405aa48d2c4293807a5b3f427e73a41"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.analyze_font_sizes (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":54}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad84c3cbf06d12173c8d781a7a903615a886ebda5293e45135395a31f26fcb07"}},{"ruleId":"D2","level":"warning","message":{"text":"web_to_md.main (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":1542}}}],"partialFingerprints":{"codehealthFindingId/v1":"bca54a72abbd17865b94b10d83b6616aac26edd2355ebc9d05b0be53b9a95681"}},{"ruleId":"D2","level":"warning","message":{"text":"embed_images._optimize_image_bytes (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_images.py"},"region":{"startLine":77}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dac39409c766a2fd3559107b33fb4612e06ed2fe5b1eb89e8fa0d17a4bdfd96"}},{"ruleId":"D2","level":"warning","message":{"text":"checker._parse_placeholders_fallback (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"45feed371241fdde02487426ac2704bc974b4fc435daed782ca8db9e5e96cf45"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.project_image_errors (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":417}}}],"partialFingerprints":{"codehealthFindingId/v1":"51df5c81624366954e2f433230661cf8b85bfbc9223217a3eff44e0e39089aac"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.convert_image (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":4983}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c847bc45b1d7b519207f83b85e7ea4d4785007273a42694b89768e59cab08b0"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._replace_roundtrip_transition_advance (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"700f378e507370fd00e5802c07ac0cde52206fd01dbf60fc4302a0a22a0e6b3a"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure._validate_template_slide_contracts (cognitive 26): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1945}}}],"partialFingerprints":{"codehealthFindingId/v1":"56d4002bba28717c49ada2c480aa5ef30f26865d1d8a92ae24686caacda918ca"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._load_current_assets (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":790}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1ae2ad57e85d422f3146605b86c2d21b8d469becd6eba9173bca958458aeb21"}},{"ruleId":"D2","level":"warning","message":{"text":"server._read_template_options_input (cognitive 25): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a14422a595ac44c81dc56f4ff31039fadfb26da14287d6057d0b6a932b5d6931"}},{"ruleId":"D2","level":"warning","message":{"text":"server._submission_stage_error (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1616}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdd27b7143a8725451c21f8f00cfa677160fedaad2e56f97eb13724fc870335"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openai._generate_image (cognitive 25): backend_openai._generate_image has cognitive complexity 25 (threshold 15). Drivers by points: if/else 15 (18 pts), ternaries 5 (6 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":607}}}],"partialFingerprints":{"codehealthFindingId/v1":"1242c8743116f002b4fdd99b1dcffe04b0d53e216c473665473790237614b820"}},{"ruleId":"D2","level":"warning","message":{"text":"image_gen.render_manifest_md (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":1178}}}],"partialFingerprints":{"codehealthFindingId/v1":"a46bbbf3f23a6b90b9c9b19d921da40f97755ae3327949bbe2090f5bbca93f2e"}},{"ruleId":"D2","level":"warning","message":{"text":"image_ocr.cmd_text_layer (cognitive 25): image_ocr.cmd_text_layer has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 6 (11 pts), if/else 5 (6 pts), boolean chains 4, loops 3 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_ocr.py"},"region":{"startLine":371}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ca97bc2087159718547e1f1321c7e625430a05ae776501730de866b0bd681a3"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._visible_leaf (cognitive 25): mirror_template_materialize._visible_leaf has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (14 pts), error handling 1 (4 pts), boolean chains 3, loops 1 (2 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1466}}}],"partialFingerprints":{"codehealthFindingId/v1":"b949454455166ae01c9a9cc0e778da35097375e44c97371ba742f7a8546de4e9"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_embedded_fonts.load_embedded_font_bundle (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_embedded_fonts.py"},"region":{"startLine":282}}}],"partialFingerprints":{"codehealthFindingId/v1":"600f3609a30a36cf1b8a51e9c13ccbee77e53145b3116eaa27833dd19f900e7e"}},{"ruleId":"D2","level":"warning","message":{"text":"clone._clone_part_private_deps (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"717bb3b3d65985497b8fc65d9cbf3a57235ee63a9e32c2766766ee57b2f18e37"}},{"ruleId":"D2","level":"warning","message":{"text":"fill_to_svg._resolve_grad_fill (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"accfaa8e388ae1cc9db441b76cbc9fdbcb8954a9924a389fac3b0771b80abbb1"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_import._preview_node (cognitive 25): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/formula_import.py"},"region":{"startLine":533}}}],"partialFingerprints":{"codehealthFindingId/v1":"adf1bce8ae52e27c747e561b54c77c173fa21d06c19b33f37283f8a0cd2b7dad"}},{"ruleId":"D2","level":"warning","message":{"text":"normalized_chart_svg._render_combo (cognitive 25): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"0045a05e5639ad3d294a111cea562bbfe4fe1030219f32b6004bbc08072b7765"}},{"ruleId":"D2","level":"warning","message":{"text":"notes_import.import_speaker_notes (cognitive 25): notes_import.import_speaker_notes has cognitive complexity 25 (threshold 15). Drivers by points: if/else 5 (10 pts), ternaries 2 (8 pts), loops 2 (4 pts), error handling 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/notes_import.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3e2093fd530ffcfdf6973526cc32dfc8f1ca9e6e4c100b83bb5324d57fdb408"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_authoring.render_preset_shape_fragment (cognitive 25): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d24a484066acefea4310c8fd4e759f86415c810e80da25d680e6095d045aabe"}},{"ruleId":"D2","level":"warning","message":{"text":"txbody_to_svg.convert_vertical_txbody (cognitive 25): txbody_to_svg.convert_vertical_txbody has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 7, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":275}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa0ff5d3ceeb4380764598d4c677b264bde586a770a1e3d244adec43de3da996"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.merge_adjacent_headings (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":395}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ec7867c31b264468c090c85a1257487a0e5ef89bfd67b53284eb572e774e95"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md._find_captioned_vector_figures (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":678}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ddabc76cb45bfd6950bf2668a8769de504eaa4c956da5fe96e9a7a8e91d1ab7"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md._extend_ruled_table (cognitive 25): pdf_to_md._extend_ruled_table has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1130}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bf93ef451a9bc092ee3da7f34ddc7242659d1ecb732950c15f0499e80ffcfc"}},{"ruleId":"D2","level":"warning","message":{"text":"web_to_md.process_url (cognitive 25): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":1391}}}],"partialFingerprints":{"codehealthFindingId/v1":"ef8124bb9fc0f2d8a3e0fe63aded9a313f2eb5325da335a42558aafaae774c0c"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._normalize_semantic_text_lines (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":700}}}],"partialFingerprints":{"codehealthFindingId/v1":"230b28236a840afdb32bf4a44776f31cf3005eb80823f72fcdc0652c28d41c2f"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._print_anchor_value_summary (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":10029}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a5fb1d10798fb075af19d4161fc5352786b9864543f27d5e92aa28e9c21caed"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_contracts.check_font_size_values (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7959f0b5bfa50c75fc760f9c162e19963231c5510910a166fd260457ab029bc"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config._animation_effect_entry_errors (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"b9789246445c4c81266d42cf15126b0f2a74e9d087cd144bd0bce90e35830a4c"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._build_run_properties_xml (cognitive 25): elements._build_run_properties_xml has cognitive complexity 25 (threshold 15). Drivers by points: ternaries 13, boolean chains 9, if/else 3. To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":2968}}}],"partialFingerprints":{"codehealthFindingId/v1":"dcc46197be12d6f6a351fdc869ac0e39312c12dd850dd5a9f5a6a8527fccf5a5"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._parse_owned_body (cognitive 25): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"80f0293be8b9552897118f89a38ecc7581e94d708b0f4cd4c1371e7df64afb18"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._parse_environment (cognitive 25): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"665d2dcf61cd1e5a0b8a60a54215ee86f29b385dfdcad59a358b7e842543b878"}},{"ruleId":"D2","level":"warning","message":{"text":"marker_common._element_local_bbox (cognitive 25): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"91621bc91e6cd00bb81fdb4496c566b9ead2c7bfabc67f302a2702a2aeaa71e0"}},{"ruleId":"D2","level":"warning","message":{"text":"marker_common._fallback_shape_records (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":557}}}],"partialFingerprints":{"codehealthFindingId/v1":"3bfdf4758db0e1237a77a5e90af50e06c460cd05eb24ab3f1f49f6e6db195dc2"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._apply_preserved_structure (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4473}}}],"partialFingerprints":{"codehealthFindingId/v1":"4195ee28c20061c0a5fce252307d837f7be645ab160fbf36b20b0ded74e01c0f"}},{"ruleId":"D2","level":"warning","message":{"text":"discovery.find_notes_files (cognitive 25): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/discovery.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"e77b66cfadb801b0124e2121f51f985f1de1df3ec8b82ab6f8f25a4b591f3f35"}},{"ruleId":"D2","level":"warning","message":{"text":"app.loadSlides (cognitive 25): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":620}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c172561aa907b29f9f81e858c0ae3da4c15cd7c5f01d2a0345f2b61f6446892"}},{"ruleId":"D2","level":"warning","message":{"text":"app.selectSlide (cognitive 25): 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"97eaea0f0a7f840e6f8e5b3034cf19096cf56cc25b6a3796b2e20e3fa5bbc82c"}},{"ruleId":"D2","level":"warning","message":{"text":"compact_svg_styles._remove_redundant_inherited_styles (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_styles.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffa696ea600d369e6b3b00273474f5b5c446bff2413f5025a57bcfed6668ea78"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search._search_one_item (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":2000}}}],"partialFingerprints":{"codehealthFindingId/v1":"67760687a13426de62de76a3a649213ac575b385b7aa36cf830c285a868a9b46"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._normalize_target_mapping (cognitive 24): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5abc02def0b1d88bdafdf3249f22408ea90fb278a74d9b3f1e3a63a0c66b954"}},{"ruleId":"D2","level":"warning","message":{"text":"PresetShapeSemantics._normalize_group (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantics.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"e41792d30465304ec8e971d1844bbde0a7fee79be4e2d04a1c2882265b7d39fc"}},{"ruleId":"D2","level":"warning","message":{"text":"fill_to_svg._pattern_foreground (cognitive 24): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py"},"region":{"startLine":716}}}],"partialFingerprints":{"codehealthFindingId/v1":"661f4689ce15cd33b73b11c5d4020f85b25d799d2af26ae2e52924a394d10905"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_import._serialize_run (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/formula_import.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"17bfaefc01531ddf1b5b1794a1d211a2b3c857fdcf51383252e7c8ffd5517937"}},{"ruleId":"D2","level":"warning","message":{"text":"pic_to_svg._apply_blip_image_effects (cognitive 24): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"71aa0674ad737fcf570ff17bff169100c01ef1060f1b6d3aa3db5a0bc32a878a"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_walker._build_placeholder_xfrm_table (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":435}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd76f04e2a4440a55a44e9166122d3a9ecae5edbcac58f6e93cc6d574509f88d"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions._transition_sound_elements (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2480}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e49a4ebf327d286879b13f7dee7562b9770e6e8caa3d22549d36a1302747c00"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.render_text (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":2219}}}],"partialFingerprints":{"codehealthFindingId/v1":"d03be6491c9f2d1cf69f8f770fc26696d11c5a4a22d61766ff3e1bd4ec0ba7a8"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_contract.canonical_authoring_errors (cognitive 24): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_contract.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"e824d9654484f81199b1ec5cc1a7fa9fa035650cede5c949aabbe5db5062ad24"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._extract_image_resource_rows (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8188}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a127ecb3ab2103dd3f001c63c67298683ae983c3ac7d1b5138adbee9d4b54d7"}},{"ruleId":"D2","level":"warning","message":{"text":"converter.convert_element (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1883}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb135f58792af5ddd65d063930755051f2d997745875ee8876a8bf570278b097"}},{"ruleId":"D2","level":"warning","message":{"text":"theme_fonts.infer_master_text_style_spec (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py"},"region":{"startLine":107}}}],"partialFingerprints":{"codehealthFindingId/v1":"391cfe59103cc308fc60d77d4a925f2a59d05d76597e2c9da1aa1545bfa10a61"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._chart_data_labels (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"d3f90c398d07c7f8085acd6c456cd3ac4e9abc89743403ab948546e214adacc6"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_ast.merge_run_styles (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py"},"region":{"startLine":429}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5ba3bb3a1ca0f71825af612736594039ce864df327a06d58d55271d1b0e9b39"}},{"ruleId":"D2","level":"warning","message":{"text":"table._native_table_fill_warnings (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1045}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d3815eced26d3447ca12ac935d85c3cd28006fabf552c3fd562660358cd361e"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._set_placeholder_theme_font_role (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4030}}}],"partialFingerprints":{"codehealthFindingId/v1":"660757c8360789091a7cd95f35b9cb53e448aa660e90e199c8f44d4bfc2f57d9"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.match_native_placeholders (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":3571}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31072b9defe85fa780bcc422f39b2cb627a6e6c806c9e0b97a66fca58df3a9e"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocalUseExpander._materialize_use (cognitive 24): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/use_expander.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"a40f507782468fc2371582cf2b54d546752741783de98625e41d5e2367bb1e71"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocalUseExpander._validate_fragment_reference_syntax (cognitive 24): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/use_expander.py"},"region":{"startLine":351}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e5a86e876f625a2c9d9907b964f279fb3baa9ab85f98df6d7d0556f4ee4802f"}},{"ruleId":"D2","level":"warning","message":{"text":"template_preview_pptx._write_review_svg (cognitive 24): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_preview_pptx.py"},"region":{"startLine":79}}}],"partialFingerprints":{"codehealthFindingId/v1":"304d9d1ec7501f908b397091980c2d452658dd4b5df051e31b3ae81db10efd96"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._prune_unreferenced_definitions (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"7eef5a36ddc84901ab24e039b559b7616404a59e52d2907bb140b767d6f3b3cf"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._merge_defs (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1424}}}],"partialFingerprints":{"codehealthFindingId/v1":"f661949587507467a08db3c86ae362ccbf6feb9b3b986b6afc3667c8238889e5"}},{"ruleId":"D2","level":"warning","message":{"text":"server._typography_error (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1368}}}],"partialFingerprints":{"codehealthFindingId/v1":"a63adeb840149f28f3fa548f956624381c0027f9d334f8f27d7ad33292c06e6c"}},{"ruleId":"D2","level":"warning","message":{"text":"server._build_session_state (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1807}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce6c298c9e33449b4f5dd2a04967cd1acdae2bbf31de4a7d1f8dc1b42258e884"}},{"ruleId":"D2","level":"warning","message":{"text":"finalize_svg._publish_candidate_directory (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/finalize_svg.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"7210aa70728acdeecc0d5445209ffdf0e18ed5e29e09794468f47de80e5907e2"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openai._select_size (cognitive 23): backend_openai._select_size has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 8, ternaries 1 (3 pts), loops 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":293}}}],"partialFingerprints":{"codehealthFindingId/v1":"ab6e3640ed0c5a1513a3d500ada578d83b08c04f5fc687729c04ecb7f6dde667"}},{"ruleId":"D2","level":"warning","message":{"text":"image_ocr.cmd_scan (cognitive 23): image_ocr.cmd_scan has cognitive complexity 23 (threshold 15). Drivers by points: ternaries 4 (9 pts), loops 4 (7 pts), if/else 2 (4 pts), boolean chains 2, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_ocr.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"9fb404bb5b712cbef11ced1a9383bcce9f88a326675bd161dc128217714145ae"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._source_bounds (cognitive 23): mirror_template_materialize._source_bounds has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (14 pts), boolean chains 4, error handling 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1697}}}],"partialFingerprints":{"codehealthFindingId/v1":"911248a0fe9e78526c908d510aa3168a348a1cbb9633f8abb97a1fb9193ee444"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_delivery_check._relationship_inventory (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"81fa7e6f7901fb16789d6ba51f305f6dc540164b575f894c190329880e1216b1"}},{"ruleId":"D2","level":"warning","message":{"text":"formula._apply_operator (cognitive 23): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/formula.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"a19528936615c7852f55f026a1f3b992ed9ee18150cfd9f5dd8433938ddda287"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_import.read_animation_config (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/animation_import.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b21e5f905ab23245071a295848fb0c75c5b745f067e1df505096de220053bdf"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._point_data_label_payload (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2730}}}],"partialFingerprints":{"codehealthFindingId/v1":"5e66512ae93991461741c8ecd7ca85f4b253a007f0f9b5b25f4fc618815d87e8"}},{"ruleId":"D2","level":"warning","message":{"text":"normalized_chart_svg._category_segments (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b918e57cf9af50b6048b06b9025d601da6421b0111ad99fb8b4c883a5ff817"}},{"ruleId":"D2","level":"warning","message":{"text":"normalized_chart_svg._render_pie (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":706}}}],"partialFingerprints":{"codehealthFindingId/v1":"49b5463390b770f3bfb1533da2ef138efa9452cf595693098327edd3c4811ba2"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._native_run_payload (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1400}}}],"partialFingerprints":{"codehealthFindingId/v1":"b62334a2d942ef8fcfbe84141a16e2b20ee08c6641a7e2a13a637e4252b52d7a"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.run_audit (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":2006}}}],"partialFingerprints":{"codehealthFindingId/v1":"c49407a2cbb460d8d0c423fabb00d03ea1af8724457032d19278f1648dfbfba2"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._docx_inject_charts_markdown (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":867}}}],"partialFingerprints":{"codehealthFindingId/v1":"97ea9623593e6858420eb16fb434edfa2ec84217c62a7e33a9fcc3614431de6d"}},{"ruleId":"D2","level":"warning","message":{"text":"server._inline_icons (cognitive 23): server._inline_icons has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (16 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":175}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e56d627ea8ef0b2a8e702fa04b30742e2af4c85873c79c453df1156ace449b9"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_viewbox (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2615}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2fb88e176ea5ee93b9baaaf0b76ccad9a370eb8cf745b526f84df22e0baa896"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._carrier_image_receipt (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2998}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71c18a4552c63a0c36b611c7c8040569d10ac7b4adedbc9197d5b1303f92e02"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._resolved_text_runs (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3373}}}],"partialFingerprints":{"codehealthFindingId/v1":"57b9123fbce28d5213bd88d419918683c8c94fb70d13f07fb5b793ed77e1f0b2"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_sourced_image_provenance (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9067}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b05ed706512904119dfc22aa0fd6fe74152ee70c97fabca2db0a2440d355f61"}},{"ruleId":"D2","level":"warning","message":{"text":"slot_capacity._text_targets (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/slot_capacity.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"bddf43aee6aac65026791511fbc5c39689694a773d9453ea378e4eebd407bb78"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config.scan_svg_targets (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"de50280a105315fd980a30d85bf23e8d4bc32524cbefa648ef2029c7245ff75b"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._build_source_shape_id_map (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1725}}}],"partialFingerprints":{"codehealthFindingId/v1":"6789ec6bf804b9fffd57b649a3745bf958d029c27df4af3dc76a27a22d5ffffb"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._resolve_nested_svg_clip_geometry (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":5526}}}],"partialFingerprints":{"codehealthFindingId/v1":"4732286a7d3d2e0c303b89ef721b64140245be021c01b9ec08864336e62818fe"}},{"ruleId":"D2","level":"warning","message":{"text":"paths._project_path_like_bounds (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py"},"region":{"startLine":338}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bff5b120c697228ab5160349d68331846985325057cdb09abd2c8f6839e7afb"}},{"ruleId":"D2","level":"warning","message":{"text":"text_properties.project_text_property_diagnostics (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":709}}}],"partialFingerprints":{"codehealthFindingId/v1":"9aff4363a43450054de74698364c5101ced3ce256515d3827971345eac04313d"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._parse_transform_operations (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":749}}}],"partialFingerprints":{"codehealthFindingId/v1":"645065c0962ccd4ecab2195847801802675b2578b00874ef90c86ad2b51cf38e"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.parse_font_family (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3310}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9ac0dc4746600fbd64f0063fcf7b7e1985990960732d2acb54d641c4458935e"}},{"ruleId":"D2","level":"warning","message":{"text":"native_objects._build_native_chart (cognitive 23): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":359}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af5e3299a1a3524f124d086ed23bee08c3c593465f9ff0484766682174f0c50"}},{"ruleId":"D2","level":"warning","message":{"text":"marker_common._fallback_text_records (cognitive 23): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"d06bde8ced9a47123e3566cad3ae0865de0c0af3409b8302c71c30ec947b9973"}},{"ruleId":"D2","level":"warning","message":{"text":"table._validate_table_cell_formatting (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":597}}}],"partialFingerprints":{"codehealthFindingId/v1":"86b1ec7625d5b31e3b29723a169c32bdb3cacd7782cc5da806fa79a4a27f0a2a"}},{"ruleId":"D2","level":"warning","message":{"text":"table._table_fallback_grid (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b0b6e4d31b6aae5232b56031f017953054a0b4aa1b5bfea79438a198f333221"}},{"ruleId":"D2","level":"warning","message":{"text":"narration.find_narration_files (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py"},"region":{"startLine":92}}}],"partialFingerprints":{"codehealthFindingId/v1":"9454cb24e8cd54a0e6d7fb4cb9b25e8e759beef424a8ee17e958b71f1417c050"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.parse_optional_layout_slides (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2023}}}],"partialFingerprints":{"codehealthFindingId/v1":"aaca629c07169545b5fd474f0acf6a368de88141612d8512bd7560e37f09a914"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure._scope_visual_resources_signature (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2785}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7337c6c59dab5bae492d51ab67e3f6b1f4664576aa8c8a36469fee43c73a194"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_boolean._close_filled_commands (cognitive 23): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":879}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6c3f9cb88f44671ad5ba4e4a36ed135fe35969a460dcbb8c0b10bac86601e1"}},{"ruleId":"D2","level":"warning","message":{"text":"app.directionStateSignature (cognitive 23): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1901}}}],"partialFingerprints":{"codehealthFindingId/v1":"172d1cc15f9a1315e71d868ed894d2be32c4fcda2f397114e5f943305dcb68eb"}},{"ruleId":"D2","level":"warning","message":{"text":"server._template_kind_from_spec (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":246}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e1ddc59f1a1ff66d1a5ffcc9ca2f0b2c01de063c76494f0364e87d466b7332"}},{"ruleId":"D2","level":"warning","message":{"text":"provider_common.score_candidate (cognitive 22): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_common.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a07f49e0f54b8eb6b58a229e3aee2f286f7449a2a150fd9e97a27c7d173e92c"}},{"ruleId":"D2","level":"warning","message":{"text":"provider_wikimedia.parse_results (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_wikimedia.py"},"region":{"startLine":91}}}],"partialFingerprints":{"codehealthFindingId/v1":"258438e597c55b1d8ac018872fb7679cee31600281668f864b08c5a8a7e530a0"}},{"ruleId":"D2","level":"warning","message":{"text":"edit_safety._table_merge_topology (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/edit_safety.py"},"region":{"startLine":251}}}],"partialFingerprints":{"codehealthFindingId/v1":"b80bdac11ee8e4000f656adff20dbc60b87ed4f320e62bf951a78273be6cc631"}},{"ruleId":"D2","level":"warning","message":{"text":"PresetShapeSemantics.grouped (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantics.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"f49b4d467adb6c870839229f549cd15715bc443d86c08e7b3cd1c87c0119c48d"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._annotate_roundtrip_slide_roots (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0998fe3cf8e3ce362a962b47c372fa8f5fd1822513c543f6180eacd9e23e07b"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_authoring.materialize_compact_authored_preset_tree (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":583}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfef3f52974edfbfac5dfbf7053d7c74bebd831b9fd5b87c94ca73cf0fe34ec"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_authoring._validate_adjustments (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f0e0d27638282d39ef0a1aa61ba3e94ef684e0a83b58e9daed26c9a2b4402f4"}},{"ruleId":"D2","level":"warning","message":{"text":"txbody_to_svg.convert_txbody (cognitive 22): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"551096e11343e58c65778f2cb122c7de7422ef4c8f3bd984f9175d158948c429"}},{"ruleId":"D2","level":"warning","message":{"text":"register_template._extract_entry (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a3cad2f0b1876dc59a42988bf308554e3a9d8ca907cacb8d781fc412c2657c9"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.should_keep_image (cognitive 22): pdf_to_md.should_keep_image has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (11 pts), boolean chains 10, ternaries 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ce165775c923fb3beb4bfd1b27940e8f772ccf1727115e9dcedfd0c2310d2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.find_page_tables (cognitive 22): pdf_to_md.find_page_tables has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 5 (8 pts), boolean chains 1, error handling 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1308}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0f6a66b8f170459b42b0a864e9e0ae5a0f12a7e2677bee283ec759902471d5c"}},{"ruleId":"D2","level":"warning","message":{"text":"embed_icons.process_svg_file (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_icons.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f1997c4ea8741c1dc1ce2c2889b7da579b16dbfb7b0d7603249d631607e5dd2"}},{"ruleId":"D2","level":"warning","message":{"text":"flatten_tspan._emit_mergeable_paragraph (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":492}}}],"partialFingerprints":{"codehealthFindingId/v1":"009d859ad0e3e9f9e472d5460815b21d8985ebf7afe085c59e799df8a3db1405"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker.check_file (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":1270}}}],"partialFingerprints":{"codehealthFindingId/v1":"4fe5e63e49cae1e6b587dfd9f281f0985eff463ece79f00767e9027dd84b665f"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._classify_preserved_mirror_geometry (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":1486}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3aac37dd77c32e4114cd06c97a5d2ddf377af2dccb4f3e358b779c0bdec37b2"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_text_output_geometry (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3540}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5b817013398aeb016684c3c6c943c7a9d723c4beb9ec267daf6aeaab3f073d2"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._print_result (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9556}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ded0a57236977d4f08f4818494e142a2f2ee4e493df9fa509f4c0a864221141"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._convert_semantic_shape (cognitive 22): converter._convert_semantic_shape has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 6, loops 3 (4 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae81320b9c1a004e5f475b9266556a0d3a33e5d9cd9b649bb17acb5dc86c29eb"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._valid_wmf_payload (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cae2f04b78a1f12eb5bbf9d81897b6f39507f9ca461cfbf63ee0630417c37f9"}},{"ruleId":"D2","level":"warning","message":{"text":"text_properties._diagnose_text_declaration (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":614}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ae547081698a91af38ccbf0590c2095aab2ae4a18a5c3d46167a8e6ea285d7b"}},{"ruleId":"D2","level":"warning","message":{"text":"geometry_properties.materialize_inline_geometry_properties (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/geometry_properties.py"},"region":{"startLine":81}}}],"partialFingerprints":{"codehealthFindingId/v1":"d37b18951b0cdce9d598282c191317e9b026c37c862e44fff929ae8ccc29d5ef"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._xy_chart_data (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1560}}}],"partialFingerprints":{"codehealthFindingId/v1":"96b2b23a34c54f3c5e1df1bca3bc9ec2e8ec6b7b2b1a581eb43555456dad76a9"}},{"ruleId":"D2","level":"warning","message":{"text":"table._table_padding_attrs (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1511}}}],"partialFingerprints":{"codehealthFindingId/v1":"eedd2bb91be0dff053e4cf0862dcca8b1c5df07850fc221422a9e49e669ea6e3"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._extract_baseline_layout_families (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":2828}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e96601b76eec1ad057d235b18b1b2127387482f377addd7edb45d106736d3b1"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._prepare_flat_structure (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":5199}}}],"partialFingerprints":{"codehealthFindingId/v1":"a486b4bdd7e4a414630ba311781839076944e96a99b592b814bd82185c5d0de1"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._prerender_legacy_pngs (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6298}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b948fb080d5f267dcd4e49c4aca3970e191bca341235a9c6d7d0f9749bc5cef"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._create_preserved_base_pptx (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6511}}}],"partialFingerprints":{"codehealthFindingId/v1":"d026dab20d45d6adb515c9d9e61b153ebb43de37aab65d16aa3ff49a91ce9328"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure._is_full_canvas_solid_rect (cognitive 22): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":456}}}],"partialFingerprints":{"codehealthFindingId/v1":"693dae26b37e40a291cf9fc01e1c53c832deda1c5e020f4e1c19ca7ff8783a96"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure._scope_css_signature (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2731}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a63cc5c962f7b7a77825253ccd5a97e2579bcfc232c7901e8a4f7406938eacd"}},{"ruleId":"D2","level":"warning","message":{"text":"video_sound_mix._publish_outputs (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"10f82d88dc2e1bd9074b7f2062cdfdbadcbbeae51e324261f9ab100745524d13"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization_catalog.resolve_visualization_reference (cognitive 22): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/visualization_catalog.py"},"region":{"startLine":262}}}],"partialFingerprints":{"codehealthFindingId/v1":"b461bf65d4cb67becb5584f75eef2c3b57b76d4b44ae64844efc81eac2465fe0"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_images.print_results (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/analyze_images.py"},"region":{"startLine":308}}}],"partialFingerprints":{"codehealthFindingId/v1":"e657df0095efd69dd0cab7a0b0072044cafb4e944a1ca4c8e4da885279839b98"}},{"ruleId":"D2","level":"warning","message":{"text":"beautify_inventory._frozen_strings (cognitive 21): beautify_inventory._frozen_strings has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/beautify_inventory.py"},"region":{"startLine":235}}}],"partialFingerprints":{"codehealthFindingId/v1":"879117bece63798e824ed13266b67fc88ecff142607c87dbc7d659458aa871d5"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_common.find_data_uri (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_common.py"},"region":{"startLine":215}}}],"partialFingerprints":{"codehealthFindingId/v1":"f27af23e07d1627b5131878075d3374f6d57bfd19d025efcf7486062a43f6e9d"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_common.save_image_bytes (cognitive 21): backend_common.save_image_bytes has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 5, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_common.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"3efd58efa3dd78b77b6f0cb5df9aa221d1906f9e336bd19d38de17950e7efa8f"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openai._gpt_image_options (cognitive 21): backend_openai._gpt_image_options has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (17 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"57189c206428d22c5b599b651b08738fbc404d55378bcfb3857bca67851eb822"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search._commit_staged_image (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c1c2d29de55e952d19ece5ebe01ee8d2dd25b4f90edd687a41ead972a4a072d"}},{"ruleId":"D2","level":"warning","message":{"text":"latex_render._process_item (cognitive 21): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/latex_render.py"},"region":{"startLine":408}}}],"partialFingerprints":{"codehealthFindingId/v1":"65ed960888f2cae27a1fe7602d2234459ed8e16c32eb4795b6c1daf73318bb03"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._namespace_ids (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e8534e83dd9a17eb927afe6238f4b1cf83bef93e7515664220b6b43862489dd"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._fixed_atoms (cognitive 21): mirror_template_materialize._fixed_atoms has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1596}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76d8507e057b275289a12d5150b5bd9dd7d9ea511fd570a3d9f0a50d0e9635a"}},{"ruleId":"D2","level":"warning","message":{"text":"clone._validate_internal_relationship_targets (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"26b64e95285d57ea4c7c9292e1b022b2c183443cea9692c42b0fff082c6e97ee"}},{"ruleId":"D2","level":"warning","message":{"text":"diagram_read.smartart_to_markdown (cognitive 21): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/diagram_read.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd37514da7fbd004d5f69b3376b43493d088f83ee512d71fbb20fb1fcd0afe93"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._resolved_shape_paint (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":783}}}],"partialFingerprints":{"codehealthFindingId/v1":"01dfd4a0fea5494220554b2ae663aa6b4f79f5ced8050771c0d970c08d23f27a"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._data_labels_payload (cognitive 21): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2802}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3b71952160b5ea3fe33021d3d1347580b412454f391fccd58ff1e3a53c5d325"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._managed_svg_paths (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":924}}}],"partialFingerprints":{"codehealthFindingId/v1":"9eb43ad3b4602bd65ff04dfc8f655468ceb506708ddabd8ea0d5e294c5102367"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._referenced_local_paths (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1110}}}],"partialFingerprints":{"codehealthFindingId/v1":"cbc851c84c4a0d144f18370746bc779a8baa1f501bef0485ecda14f55fa482e4"}},{"ruleId":"D2","level":"warning","message":{"text":"normalized_chart_svg._render_category (cognitive 21): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":201}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b3996f1f4e512b58d513e16d6814cccec86849acdb78ecd52a59c36419675ff"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._native_table_payload (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1223}}}],"partialFingerprints":{"codehealthFindingId/v1":"64997a878d24ef4154afc397a176d12817627f167fcbaf078a343fa97a8c098a"}},{"ruleId":"D2","level":"warning","message":{"text":"project_utils.validate_outline_hyperlinks (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"753cd19cba8bed5bf478e30cc46c97ab7f597b8c1788e55d34724b7f16621e01"}},{"ruleId":"D2","level":"warning","message":{"text":"ImageRotator.generate_contact_sheet (cognitive 21): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/rotate_images.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"6468577c47bfa71a2e286424a9ae3998680f205138fdfbc1a611d62bd15a8a03"}},{"ruleId":"D2","level":"warning","message":{"text":"sound_sync._load_sounds (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/sound_sync.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9db6f9f5ad244e7ee51804217cad3a9437ab72b4dd9e06ad11bf8dfdcf3973"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._convert_with_pandoc (cognitive 21): doc_to_md._convert_with_pandoc has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (14 pts), loops 2 (3 pts), error handling 1 (2 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1675}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b81482afcc487e67c4ecf27e23918f7ad820cc665661bc93001ade6a77ba370"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.detect_vector_figure_rects (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"abb02cd57851f2ef3ee60167ec381728c1ee3a5ad80b12c772588771136faee0"}},{"ruleId":"D2","level":"warning","message":{"text":"ppt_to_md._unexposed_chartex_markdown (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":1036}}}],"partialFingerprints":{"codehealthFindingId/v1":"48f282a88ce3415a082658767c3f457c0f5effea3cdb5efb920712a274607f4b"}},{"ruleId":"D2","level":"warning","message":{"text":"stamp_native_fallbacks.main (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/stamp_native_fallbacks.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"06ad9487671a132e63d638569c54119bbe4ab56257f71b392fed69aca03e45c2"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._compact_text_runs (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":991}}}],"partialFingerprints":{"codehealthFindingId/v1":"346e4d5b9a2e45d00f2ea51afc5fa0d784e3622b3fa9838b187d5a0ebd920928"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._compact_semantic_tables (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":1274}}}],"partialFingerprints":{"codehealthFindingId/v1":"d033af4e4c4b403482a1fd7e2e3070891af8daec803fa21dd1f55a8330d10376"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._rewrite_adopted_fragment_ids (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2084}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ce05c028455d776c22f96e09e59fddf0bb29fea04cc1b88efbe0a572d7ec4a"}},{"ruleId":"D2","level":"warning","message":{"text":"annotations.promote_tspan_to_text (cognitive 21): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/annotations.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea9cb8b316206bc958c738dbcfbaeb29cb90fd98f3f40c2a7cce3a64d7d4019a"}},{"ruleId":"D2","level":"warning","message":{"text":"flatten_tspan._create_text_element_from_line (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":781}}}],"partialFingerprints":{"codehealthFindingId/v1":"9dd45730fe7b3c025c749203d6f72eaf2a4553275e464a70de948e3009d87b59"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_fragmented_paragraph_text (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5041}}}],"partialFingerprints":{"codehealthFindingId/v1":"c9e4950c8e08d384efa9efc10bf047321dfc22606f1a5f395fc689e2b7d316eb"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._fixed_layer_group_errors (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7919}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f44f0629e3829836d6a0a25d5af4d31a7bc9304083678f74fd361f70c330114"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._carrier_receipt_summary (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9666}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5c88d7f3c1b5f9a34a5076fd7c7265f0a59bf9d14431000a17f2aed72924ed8"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_contracts.check_opacity_values (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":414}}}],"partialFingerprints":{"codehealthFindingId/v1":"c5f0556f2d9e3817d0372a3720cd612db878b8962baea269344da8d296aca79c"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.convert_line (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1644}}}],"partialFingerprints":{"codehealthFindingId/v1":"114c49bd3e21305f993ce38ec32d137f4d2c30c64a50ee74137018e5cfe2b9b6"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._collect_inline_runs (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":2775}}}],"partialFingerprints":{"codehealthFindingId/v1":"d49038ad6ca2a238db85b0d8261deb42b62370183513dc3d8641083d7c1db5c4"}},{"ruleId":"D2","level":"warning","message":{"text":"text_properties.materialize_project_text_metrics (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":568}}}],"partialFingerprints":{"codehealthFindingId/v1":"5622cce2b1035946ec2136fe34e5c8e2b84a583d11df7818087a6a34c0665949"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._data_label_point_items (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":203}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6fa8fe00c761d14ba26b48a25fbaa98e6cb2b5186bd95f81024f8f5c789ffac"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._fallback_bar_clusters (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":989}}}],"partialFingerprints":{"codehealthFindingId/v1":"b92f2bf1d188758503cb5cea670049702cb6208b6cb441ab18c285bfe8eddf8a"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._parse_scripts (cognitive 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":939}}}],"partialFingerprints":{"codehealthFindingId/v1":"e79562a7851f89d3e1c87c5cf7c9e00d3209dff5b506e4040c40fef6c155cd92"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._parse_environment_rows (cognitive 21): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1600}}}],"partialFingerprints":{"codehealthFindingId/v1":"af58c1df54dee2f052f2367d33895f7452990ec2234fc8cbd9f2b2fec29547e0"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._prune_unused_slide_layouts (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":5049}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5824c305b002e9e5faef73954f47d8e4a1d10ce52616512046a13bcabed7ce2"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._materialize_slide_sound (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6166}}}],"partialFingerprints":{"codehealthFindingId/v1":"1945279d6b6cb2a72090a3bc717f08fe82723abe8c44dd629b331b10f0c8ac43"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._install_source_embedded_fonts (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6684}}}],"partialFingerprints":{"codehealthFindingId/v1":"9924e4c9346bce823e81427aa33b974ae02f714e5615a2ce5160fcceef11a46c"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._report_roundtrip_omitted_opaque_payloads (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8ee5cc66cdbb51c5a1e8e8c3558ff24e5b42f5ce39dea6de8ced050a5affb63"}},{"ruleId":"D2","level":"warning","message":{"text":"template_validation._validate_unique_creation_ids (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3b24b17d562060f8529876ed0bd37b6337a8520aa2e5d7a2f36c95211bec45f"}},{"ruleId":"D2","level":"warning","message":{"text":"app.fontScriptTokens (cognitive 21): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1701}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec034f236fdbed3a19c13c662e527624ce4a6923939adb4c0bccf40db3ce4be1"}},{"ruleId":"D2","level":"warning","message":{"text":"app.attachPropEditors::commitGeo (cognitive 21): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2788}}}],"partialFingerprints":{"codehealthFindingId/v1":"504b9970d7499c0f6d011d209c55ec7eb7c988df22aa5ebb7a951f8ed61899f3"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._publish_files (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":3051}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f93e03081dd51402d687d8f5e2d70e5abcb9e21ab75b487ba0656639646f179"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_walker._build_placeholder_lst_style_table (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":474}}}],"partialFingerprints":{"codehealthFindingId/v1":"aba8fb26fe8d5d430ddbce7fcc163d63e0391771dfca0b20d46711387f4630f6"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._effective_placeholder_tx_body (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":808}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f03ed8b21957b2d2a462e10f5a49bd669b61029888e4b441a6e3914c587de1d"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._table_tx_style_run_props (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":237}}}],"partialFingerprints":{"codehealthFindingId/v1":"2afa2ccce71535843ffa28ff9601dc3be3387fe10ff5412d1a859e5d626ca1a7"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_shape_svg._render_batch_items (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/preset_shape_svg.py"},"region":{"startLine":451}}}],"partialFingerprints":{"codehealthFindingId/v1":"f653d0ebf8acad4ba64179b78c0a74c4ef54a4ae62d9839191393833b17c74bf"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectManager.init_project (cognitive 20): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":288}}}],"partialFingerprints":{"codehealthFindingId/v1":"18c87697c1d2c136f57a583d92bb0bbee112ac637512ab787bf5749a490f4415"}},{"ruleId":"D2","level":"warning","message":{"text":"register_template._print_completion_card (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":1371}}}],"partialFingerprints":{"codehealthFindingId/v1":"760c1a9e5a4145052c84a9facd60787c125c3efd429638ec9c3a9a900cd1e7cc"}},{"ruleId":"D2","level":"warning","message":{"text":"web_to_md._decode_response_text (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":418}}}],"partialFingerprints":{"codehealthFindingId/v1":"f054858d652b9a47d846fcdb241b2e8fb1db31a535155fd5f0f023ea8e9e92fd"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._materialize_adopted_context (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2007}}}],"partialFingerprints":{"codehealthFindingId/v1":"da81d85fdc6892ccbfc0e6b270a00debf944366de211b136ba906340032944b5"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._image_crop_mechanisms (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8544}}}],"partialFingerprints":{"codehealthFindingId/v1":"6498971d8264b0437a085f8cb40ab6053e45f7273c381155669115d4f777b755"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config._transition_scope_errors (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"409b5f4af54e689943ccb2e309a84cfff7dcfe5e15bdef0e6c8130679db4f77d"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._chart_projected_texts (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":1258}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb66bf97e4f5ea9660f37c71eb7d0b13cbadb7fd2bd28bc1e4bb09a86157dbd4"}},{"ruleId":"D2","level":"warning","message":{"text":"formula_omml._validate_matrix_dimensions (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":862}}}],"partialFingerprints":{"codehealthFindingId/v1":"eea62d3dab571448bd1f542d068af1f03be53cff58e48c6719a4c0b807d97918"}},{"ruleId":"D2","level":"warning","message":{"text":"table._table_cell_parity_style_gaps (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":869}}}],"partialFingerprints":{"codehealthFindingId/v1":"43b4a4a93f17fe8862127b57c6660bec77c08f5accaf16620601e443363212c5"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._replace_roundtrip_motion (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1309}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd9ba13a6ac81d09551b1abc9c1786403a5bacc1c9f0318d54175f90995e09e0"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._remove_all_notes_parts (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":2087}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a3bf18c1bdfe4c693cf5f0ac93e09924070b9b35c726e800b41f43b578febd7"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._solid_background_xml_from_shape (cognitive 20): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3355}}}],"partialFingerprints":{"codehealthFindingId/v1":"45e64c0b6a152d5299e9a60cd8a322c8fc227e9c8dc076c2f07b91d489360e6f"}},{"ruleId":"D2","level":"warning","message":{"text":"narration.read_narration_start_delay_xml (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py"},"region":{"startLine":718}}}],"partialFingerprints":{"codehealthFindingId/v1":"88627ecf2c04d6d68310620eb5f2cfab754fa67f3d9ff5b59ab53a1731f47bc5"}},{"ruleId":"D2","level":"warning","message":{"text":"text_outline._resolve_text_style (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/text_outline.py"},"region":{"startLine":457}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed7aa095da1e6c3634b31fb01d62e50eac6db1dc7f3d6f40ec29d85f4e54989f"}},{"ruleId":"D2","level":"warning","message":{"text":"text_outline._font_candidates (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/text_outline.py"},"region":{"startLine":757}}}],"partialFingerprints":{"codehealthFindingId/v1":"c509fa4dde452efa48fb334957beca9292a65ff6a76bd924f059567482b262ab"}},{"ruleId":"D2","level":"warning","message":{"text":"_LocalUseExpander._rewrite_clone_ids (cognitive 20): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/use_expander.py"},"region":{"startLine":402}}}],"partialFingerprints":{"codehealthFindingId/v1":"4de8493d8d2877795bbb4163b5dbba150df06d80492bee518399447cf72bf206"}},{"ruleId":"D2","level":"warning","message":{"text":"template_preview_pptx.main (cognitive 20): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_preview_pptx.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"633b94851ff8dd7377113520c10c5ca38848596e1bb2766919a1ba9c6e3491e1"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_elevenlabs._word_boundaries (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py"},"region":{"startLine":119}}}],"partialFingerprints":{"codehealthFindingId/v1":"fca8cbced8a6b8eed4fee17a6f162db6dc1b4f5c6bedea3b9b4d7ce85eb8f4d8"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization_recall._score_candidate (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/visualization_recall.py"},"region":{"startLine":111}}}],"partialFingerprints":{"codehealthFindingId/v1":"08f7c2378650bba9c37b1b54a28028490c4873fb4b93507371019a9e6bb86305"}},{"ruleId":"D2","level":"warning","message":{"text":"app.promoteTspanDom (cognitive 20): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2509}}}],"partialFingerprints":{"codehealthFindingId/v1":"35a8dccedbb3b95e0a2dcbd4b6f2e3228ae0da9adbfe0fd3ec868c37325a28c4"}},{"ruleId":"D2","level":"warning","message":{"text":"beautify_identity._layout_text_sizes (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/beautify_identity.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"88bfa57ccfad97e5d54df021642f65adbd856509abb3a20c8c25fa379031f929"}},{"ruleId":"D2","level":"warning","message":{"text":"server._build_template_options (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"ea25428fdaf42d5a8b18197e9ce4bf76aaa44bc72ed53c062e5c5634ef6eea39"}},{"ruleId":"D2","level":"warning","message":{"text":"image_ocr.cmd_merge_base (cognitive 19): image_ocr.cmd_merge_base has cognitive complexity 19 (threshold 15). Drivers by points: loops 6 (10 pts), if/else 6 (8 pts), ternaries 1 (nesting depth added 6). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_ocr.py"},"region":{"startLine":256}}}],"partialFingerprints":{"codehealthFindingId/v1":"b591febff5977126e06d6bb93836063f35cb023111c2488db735f2789e585d9b"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._validate_source_ref_closure (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":875}}}],"partialFingerprints":{"codehealthFindingId/v1":"1824b1ed873894a40887a544e83ecbeb108e7073d683175ca0c8dca217da19cb"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._invisible_degenerate_source (cognitive 19): mirror_template_materialize._invisible_degenerate_source has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (10 pts), loops 5 (7 pts), boolean chains 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1664}}}],"partialFingerprints":{"codehealthFindingId/v1":"71b6c67b10b2d541b8ddd299da99d820777752de2843c46a62d55346d332cfd2"}},{"ruleId":"D2","level":"warning","message":{"text":"narration_sync._merge_subtitles_result (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":1841}}}],"partialFingerprints":{"codehealthFindingId/v1":"626c5c7a8f3b53aa6acc81e191c138a88d495094c84a3cce3ec31157d8b52102"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._build_mixed_main_steps (cognitive 19): pptx_animations._build_mixed_main_steps has cognitive complexity 19 (threshold 15). Drivers by points: loops 5 (9 pts), if/else 4 (8 pts), boolean chains 2 (nesting depth added 8). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1784}}}],"partialFingerprints":{"codehealthFindingId/v1":"b683adcae6d07643b02fe0e6021a622554519d13d57b19c8b62e53ab9e8523ea"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_effects.project_effect_status_errors (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_effects.py"},"region":{"startLine":42}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cfe40ddc8304cf7fd5e4262d80e352f2b5fe96d5f24397a6b8fa0c93a1e133"}},{"ruleId":"D2","level":"warning","message":{"text":"PackagePartRegistry.register (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/package.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"91e82b79c412d06af0fbbc5b76c60af51f5f670ae37606fb88fe513178ea697b"}},{"ruleId":"D2","level":"warning","message":{"text":"package.unreferenced_slide_relationships (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/package.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"b204b6480a892f44b91fa6345298d1e85b15cdbf9697f9415a19873c933b3701"}},{"ruleId":"D2","level":"warning","message":{"text":"slideshow.reset_slide_show_selection (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/slideshow.py"},"region":{"startLine":18}}}],"partialFingerprints":{"codehealthFindingId/v1":"5083dac4546819217c9285fb1f9a4e1cd73a95cf5eeebad10743fc6b2745f415"}},{"ruleId":"D2","level":"warning","message":{"text":"ColorPalette._load_scheme (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/color_resolver.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb4a061c317518eb0ecaa6fbfd0ae070ef66951f77078aa4a5cbfc29a904fe7c"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._overlay_staged_tree (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1206}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7a710b7f10a4284f7cbb7c2435a7c8a7fbdc4b2b5f9b1d2396cd84bb4213903"}},{"ruleId":"D2","level":"warning","message":{"text":"notes_import._notes_markdown (cognitive 19): notes_import._notes_markdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (12 pts), loops 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/notes_import.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"af5b88a93b5a88684b2a2a5fdc5666949d32838d7477cb0bef4be27ff2ca82d8"}},{"ruleId":"D2","level":"warning","message":{"text":"OoxmlPackage.iter_all_layouts_with_parent (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py"},"region":{"startLine":480}}}],"partialFingerprints":{"codehealthFindingId/v1":"90083c4c4605129818a126db3b17bdb32b761c167ec2917fceafc8b5bbcf2e4a"}},{"ruleId":"D2","level":"warning","message":{"text":"preset_authoring.validate_authored_preset_tree (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":528}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc76a378e3721d3b2d44cd2a14b1d3a8a0be785d43fa0934342ef45bd1fa4dcd"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg.assemble_part_solo (cognitive 19): slide_to_svg.assemble_part_solo has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 4, 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":341}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccdaee11e7d78ac886e13fc038f3f07e27e57413804430e568fd19cc1adb0efe"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._clip_blip_image (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":1556}}}],"partialFingerprints":{"codehealthFindingId/v1":"f11b4ba8bfdf72fef85c5a085b40b60b9151131cf002e6785d1b9d36ae72c83b"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic_table._iter_cells (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/semantic_table.py"},"region":{"startLine":305}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ee6de04d3ced0f0d764bbecd7c183d457259b0b85675bcaf3654023d616656e"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic_table.compact_semantic_table_payload (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/semantic_table.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"78d3d3db6fceffecb2b9652bf00cf534d88a30d5fa53aed40e59951748b5c6a8"}},{"ruleId":"D2","level":"warning","message":{"text":"ppt_to_md._paragraph_to_markdown (cognitive 19): ppt_to_md._paragraph_to_markdown has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), ternaries 2 (4 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":349}}}],"partialFingerprints":{"codehealthFindingId/v1":"233aecd78197daec181e2abd4d26cf16b83bd54010b7e8528eb93535ea356961"}},{"ruleId":"D2","level":"warning","message":{"text":"web_to_md.element_to_markdown (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d43af127aee690d06e3924196d6a0aa518c58e6af9da88fc80be5bae3124a5f"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._load_authoring_summary_manifest (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":1682}}}],"partialFingerprints":{"codehealthFindingId/v1":"619ddf424e20a86a8ebae4f675c98e7d2c71f29a9b2ca27fbf14d81ad16e7b18"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._publish_existing_directory (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2518}}}],"partialFingerprints":{"codehealthFindingId/v1":"0aa0f258997282ba95e904b821c750528d8d69b16ec6dce1158d289d75d57a4d"}},{"ruleId":"D2","level":"warning","message":{"text":"flatten_tspan.nested_positional_tspan_errors (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":233}}}],"partialFingerprints":{"codehealthFindingId/v1":"b25dab647be40294c9a368716ceb9ba1c12964377d31ae660a1f5871b18e8023"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._check_pptx_structure_metadata (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6225}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e51b93e6be6244f0a5682cb27e519e17ea13d7ebed8b3a9e1b78f908118e524"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._configure_prototype_context (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7198}}}],"partialFingerprints":{"codehealthFindingId/v1":"943afb36d12295907f088a94fb99b2f5952a8521747582ed6b4744f70f6f31d8"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._extract_spec_roster (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9443}}}],"partialFingerprints":{"codehealthFindingId/v1":"906612c46a32237ab785a419301dba2fd7d7cf58bf5209226983e81294de4a21"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config.resolve_slide_svg_files (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":364}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce50b9e4e4d500108799128c7ea2fd235ff7cccc3a4cddf9daf45411b32d1298"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._require_native_marker_attributes (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"31891e305798364500d3b5beb24745da2abdf03f2e6a45c76beef9ae15f9c112"}},{"ruleId":"D2","level":"warning","message":{"text":"converter._roundtrip_graphic_frame (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dcdceddd1b43cc02f276e63a49e91ceb4a4ef28cc62a53b1ef7adb1829ce384"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._override_run_attrs (cognitive 19): elements._override_run_attrs has cognitive complexity 19 (threshold 15). Drivers by points: if/else 15 (16 pts), ternaries 2, boolean chains 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":2664}}}],"partialFingerprints":{"codehealthFindingId/v1":"1926144d2f70ca5c6d81411a5633178d191e723f5e03d9a49db8283a6cc3cbce"}},{"ruleId":"D2","level":"warning","message":{"text":"text_baseline.drawingml_text_baseline_offset (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_baseline.py"},"region":{"startLine":67}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cead98609912751938e54608378abe99694984c8e76be6b0f363491222561a1"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.iter_project_opacities (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1654}}}],"partialFingerprints":{"codehealthFindingId/v1":"d6ab7561705fe91d8ea73c3150bb14d4886795a240d167c85da89d122d118cc4"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.iter_project_paints (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1887}}}],"partialFingerprints":{"codehealthFindingId/v1":"21519353a6d197f5fc65ffa5e3d8655be00cb161d919a7aadeb102d28e834e71"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._native_chart_category_order_warnings (cognitive 19): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":945}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ff9553479d67db8892a57fb1bf3a73e0a4ab88c7a8361691da0e8084fefff81"}},{"ruleId":"D2","level":"warning","message":{"text":"table._table_text_run (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"b272544abad247c319a697769c0f5d624707e05b03d89ee8e3b2a66ddf8a7660"}},{"ruleId":"D2","level":"warning","message":{"text":"table._native_table_inset_graphic_warnings (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1188}}}],"partialFingerprints":{"codehealthFindingId/v1":"9ba810ff1afe0440a2d5ee5924dcb355e249830df381aea3e4dcdb25a1eb91e3"}},{"ruleId":"D2","level":"warning","message":{"text":"workbook._minimal_category_chart_workbook (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"a6cb6adf838366409a040227aeee56363562ca56f1d6c5096ce34e169307c851"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._promote_common_slide_backgrounds_to_masters (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":442}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce3096b0a141ad59f80ae021a0cfdbd2da4fc17ca89189858b08a880dbec17f8"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._slide_animation_settings (cognitive 19): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":5829}}}],"partialFingerprints":{"codehealthFindingId/v1":"29433014e484d2e286b93f4d22018f6aa7ce5ec78817415dea4940b0514bb780"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._opaque_roundtrip_slide_dependencies (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f51368f6ec9eb146e0afc2c12c7ab6cf46b089b23ecfa17a413e91721efb765"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._write_postflight_report (cognitive 19): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1412}}}],"partialFingerprints":{"codehealthFindingId/v1":"01359202585cb01900871f5200cbddece0b08eaba72272ccc9177cd5fc72b372"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.template_placeholder_bindings (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":385}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8baf6c904b8947f2f6d9fb2efe77efb52f1430a470a49027a5bdc3e01cf1af3"}},{"ruleId":"D2","level":"warning","message":{"text":"text_outline.text_element_to_path_commands (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/text_outline.py"},"region":{"startLine":204}}}],"partialFingerprints":{"codehealthFindingId/v1":"87950101bd65df6830a78e04a940f76a6ab23782ba9ed944563a7eb527fc2b00"}},{"ruleId":"D2","level":"warning","message":{"text":"use_expander._symbol_viewport_transform (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/use_expander.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cbc768a6f313753eb8032231aa73355f626cfd30ce920835792e772562a31ed"}},{"ruleId":"D2","level":"warning","message":{"text":"text_measure._roles_from_spec_lock (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec5e4de680b157bb99a6726b46059dfba248ef44573862869407696939b93a96"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_edge._hard_split_span (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_edge.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"e241ac2b40e6573ff1bca2bfd70170e27990c731c22fb1c8f1ff19bfd5aa3acf"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openai._finish_response (cognitive 19): backend_openai._finish_response has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 4, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_openai.py"},"region":{"startLine":209}}}],"partialFingerprints":{"codehealthFindingId/v1":"db735f23635ea822da34b18e9d39d35f6be11762cc5c7fe67ad1b87c21ec84a7"}},{"ruleId":"D2","level":"warning","message":{"text":"visualization_catalog._load_family (cognitive 19): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/visualization_catalog.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"8faeb3982a3a0275217b618c4fb90b8f515b11a876f8faabcab1c843e285d0f9"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip.preserve_adopted_source_links (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1133}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce4acbbe1cfd818f0ce435e7dc1ff0ff12b59fe2ffa52336c285aa4c3a7858ba"}},{"ruleId":"D2","level":"warning","message":{"text":"server._stage2_custom_candidates_error (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1579}}}],"partialFingerprints":{"codehealthFindingId/v1":"1315b7450ead9221f658982d7f738ade7ea45064a67bd6dbf21c892228da358f"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openrouter.generate (cognitive 18): backend_openrouter.generate has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (11 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openrouter.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3cdafdfc7b9ee2dbd7e1e462199fc0e6e523b2c68877f055d930b9ea5bd0907c"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._merge_group_inheritance (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1499}}}],"partialFingerprints":{"codehealthFindingId/v1":"adc42967b2d511636103c92939a61eaffc5bca68e6911ec96adad5096eccf4eb"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._preflight_output (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2946}}}],"partialFingerprints":{"codehealthFindingId/v1":"be1c17209c53b296e730fba32c1424eaaa96c2e565aeedc6bc7e2c36bd12782c"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations.read_slide_animation_sequence (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":3139}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbb2799ea2e0a1b4264139f16343450f31ed0fb1870654874b23ddedab87b6cf"}},{"ruleId":"D2","level":"warning","message":{"text":"diagram_read._ordered_nodes (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/diagram_read.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"af063691701c6916c6779b123e5360a49063ba605b9b027d26d9dff2acc3de2e"}},{"ruleId":"D2","level":"warning","message":{"text":"edit_safety._chart_edit_capability (cognitive 18): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/edit_safety.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"d40defd2690592de4017ab6fe63e9f2057a4227f3053b9ca62154fefadb8b2df"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic_hash._native_fallback_subtree (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantic_hash.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"902702cb8a1dee627ee5bf2f2fa6ea9250ac58effff3139fcdc3bebb906d95ed"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg.extract_native_chart_payload (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"16597964c8cc0f6f70e4e61d6b0a2eb360a2abbfbaefff538804c6050e0cf703"}},{"ruleId":"D2","level":"warning","message":{"text":"color_resolver._compatible_color_element (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/color_resolver.py"},"region":{"startLine":550}}}],"partialFingerprints":{"codehealthFindingId/v1":"a5fc1deb4b7c0d88176f76557d008a2b4ab15802c8d9424c816d872abb38046c"}},{"ruleId":"D2","level":"warning","message":{"text":"effect_to_svg._validate_color (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/effect_to_svg.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"40a74ecdb8c958e7845a9989fb24093f4516f2adc9a93e55c85fd1bfdd43e23c"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_walker._build_placeholder_body_property_table (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":506}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c09d2208ac7d9661172e2d692b7a366196c2408510a86e1b40438db16fb1f69"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg._materialize_inherited_list_styles (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":853}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bb6caeb2d9989d4c00a0685a1f20cdcbbb2984e10f7a21d6dcad984ab790ea0"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions.normalize_transition_effect_options (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":1023}}}],"partialFingerprints":{"codehealthFindingId/v1":"ebc417692b7c9c492ba3e2936e61374f8844f339188e88d4af86d5f967fc0ff4"}},{"ruleId":"D2","level":"warning","message":{"text":"project_utils._outline_hyperlink_lines (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":472}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c64a3242e5dd1293fa7e3370a5bdc50788df1a9b34a7af9ca58c8dab3b2f016"}},{"ruleId":"D2","level":"warning","message":{"text":"prompt_audit.extract_paragraphs (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"1911db6dbdc424337894f96ce6e6cf336618079bf2ea613a3e80d033da47eb4c"}},{"ruleId":"D2","level":"warning","message":{"text":"register_template.main (cognitive 18): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":1423}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d8edf81e0b64960cfd82ea87ff40129233b95313d6dc91f6d1d2464991dd99e"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md._write_generic_image_manifest (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b90729a2225f87d293c1fda3b9ebabb770a36fb3b66a6b708952b1d9af1b8c"}},{"ruleId":"D2","level":"warning","message":{"text":"doc_to_md.convert_to_markdown (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1821}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0f04caa5bf863dad8071185a67aacf63a5768dc1b5e140ab40c16530931af8a"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_compatibility.normalize_single_child_group_filters (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_compatibility.py"},"region":{"startLine":20}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf3f6eae67d011a4e7e0b6e6833ccf10249668076ceac31b0260b9c4464ed775"}},{"ruleId":"D2","level":"warning","message":{"text":"embed_images.embed_images_in_svg (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_images.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"80e7a4453d01c944ae88026617564717fc6944d3b72830110582cece5f6a3855"}},{"ruleId":"D2","level":"warning","message":{"text":"fix_image_aspect.main (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py"},"region":{"startLine":332}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc1c943511bdadc148e0b220d54e3700b3f14ee8ab7643abf9e08dff4a148de3"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGPositionValidator.extract_all_positions (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":886}}}],"partialFingerprints":{"codehealthFindingId/v1":"44805028a0742591728b409f711ae2e0896dd2f02df88a986913494fa137a711"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._prototype_drift_allowances (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6525}}}],"partialFingerprints":{"codehealthFindingId/v1":"a60c102df5d6fc459607edbff007f7c6180829057236d01aa8cd4116f60e1fee"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._page_target (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/cli.py"},"region":{"startLine":46}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1e608c73893cebb8b05081e56fae15a6f6005bd102e15ecc8af72b950ed44e9"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config._animation_group_errors (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"338865847e3417da7253c4c99d4dcad2cbc55eb88ec60800c39a4254b31a00e5"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._fit_full_image_target (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":4589}}}],"partialFingerprints":{"codehealthFindingId/v1":"946136d259b54f724bd8ba99863b4e8db9a0ad2b09d6207c2d911a23146abf55"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.project_nested_svg_crop_errors (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":5490}}}],"partialFingerprints":{"codehealthFindingId/v1":"5ff667a96c3775d2d61c25df6d8fea59bbb384e792e5e41709e74209612a16f0"}},{"ruleId":"D2","level":"warning","message":{"text":"paths._expand_arc_argument_tokens (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"1796f8c89e1f9d41b32053a96193ed650ad80d43469875f6314427e3018387d2"}},{"ruleId":"D2","level":"warning","message":{"text":"styles.build_stroke_xml (cognitive 18): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"58eb3762fc24593572737437ac5bfa5aa45988241fbc65427c46ea75fc1e1a60"}},{"ruleId":"D2","level":"warning","message":{"text":"theme_fonts.load_theme_font_spec_from_pages (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"913cdb8b6257693597a43c4d8c8598d87b34e650c5b4bf603da153f74d7cfe01"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._category_chart_data (cognitive 18): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":970}}}],"partialFingerprints":{"codehealthFindingId/v1":"242c38f8d534d6d18607e8bbdc63798181d911d2cd8b55032d99b35b73c467e9"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._chart_number_formats (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":1225}}}],"partialFingerprints":{"codehealthFindingId/v1":"eec4e06d89dc7ce0b934901c2d27b1af555d27a7cdfff71dac36d985e1a1b957"}},{"ruleId":"D2","level":"warning","message":{"text":"workbook._minimal_workbook (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py"},"region":{"startLine":38}}}],"partialFingerprints":{"codehealthFindingId/v1":"943832f690324c1c64473844db015910455980bfd0e9506b07a61c554434a603"}},{"ruleId":"D2","level":"warning","message":{"text":"workbook._minimal_xy_chart_workbook (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"c30b2762e9b3c9fde0da790b04eea40cd8d33d692cb2e98f4a1e295691aa3fb2"}},{"ruleId":"D2","level":"warning","message":{"text":"workbook._minimal_chart_ex_workbook (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"8104bfa87fb5bdbfda33d867b35a30891b4d764b5498aefc0aa61e70087a0957"}},{"ruleId":"D2","level":"warning","message":{"text":"narration.inject_narration (cognitive 18): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py"},"region":{"startLine":611}}}],"partialFingerprints":{"codehealthFindingId/v1":"02b380ce308062f66b7c8e213f365278a0742d4aca7a38c95a950c80a750840f"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure.native_structure_lock_errors (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":3612}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3e030e6602139cb7d96a2dac4eb59a3320966c45b61250557ccbc750cdac33f"}},{"ruleId":"D2","level":"warning","message":{"text":"text_outline._font_catalog (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/text_outline.py"},"region":{"startLine":626}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e9337987287a15800e704dafbb648ac9ae0f804961f5921e1c460af4a11669d"}},{"ruleId":"D2","level":"warning","message":{"text":"native_structure.build_native_structure (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/native_structure.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fceba9379fbcc82d834a2a1803047c92eacb1cdc07cb1adb30c9917f2eb539"}},{"ruleId":"D2","level":"warning","message":{"text":"template_preview_pptx._roster_spec (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_preview_pptx.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"2fd3296d6ba3142ac4de3764c4b8c61e0adb705a4cedf201d8b1bded47e6869f"}},{"ruleId":"D2","level":"warning","message":{"text":"app.initTemplateOptions (cognitive 18): 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\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f004b6045a82feb2d742f8809f4cf85b757c27d542880b4803c8bd7d198296"}},{"ruleId":"D2","level":"warning","message":{"text":"app.tspanBaseline (cognitive 18): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2459}}}],"partialFingerprints":{"codehealthFindingId/v1":"3076300fd958758032dbc9f72155da221587d1dcc9861c59988f013c3567d769"}},{"ruleId":"D2","level":"warning","message":{"text":"apply_template.read_template_install (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":460}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a73bad3f22de333c4f6d256c04b2a22bf98f91e125dd8573e5cd61dec75eeef"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._rebase_resource_references (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1484}}}],"partialFingerprints":{"codehealthFindingId/v1":"a86c17da614a15b46103a74b0ec2a30684dc9d44631494791b75e9b8f3510f4a"}},{"ruleId":"D2","level":"warning","message":{"text":"server._apply_locked_recommendations (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2033}}}],"partialFingerprints":{"codehealthFindingId/v1":"20b43a392c9e477614e4527d64262ea8d3f207d8a8b4ff0006720fcc3fe69b46"}},{"ruleId":"D2","level":"warning","message":{"text":"extract_svg_assets.extract_directory (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":1041}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4a46886c3cb3d29c7c096dc0d25ebd8450879d39a536cd0b443d137dc0b25fa"}},{"ruleId":"D2","level":"warning","message":{"text":"generate_examples_index.generate_examples_index (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/generate_examples_index.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"de08868051fbf25f80f18bf7dca86591500e019a6a33c88637f86fac4fe90e49"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_gemini.generate (cognitive 17): backend_gemini.generate has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 2, error handling 1 (2 pts), loops 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8191eebbbd939a383cec74169eed504f954c4a6f95c17312cbb01bd16c63614"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openai._validate_request_options (cognitive 17): backend_openai._validate_request_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":523}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3c3f5e4fa4359d1c0c374a28decb207297f3011f64288895d17e8497b3b59d2"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_tencent.generate (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_tencent.py"},"region":{"startLine":198}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b15c4ac35db76f601145971643712dca1b9b2df108c1eed660eefb272f413b5"}},{"ruleId":"D2","level":"warning","message":{"text":"image_layers.cmd_check (cognitive 17): image_layers.cmd_check has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (9 pts), ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_layers.py"},"region":{"startLine":89}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcd04b493289c671924372ef3a4df1ae3c0a50cf726036b63efcb307f744b76e"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search.fetch_url_replace (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1743}}}],"partialFingerprints":{"codehealthFindingId/v1":"4938d0ba9978dd73eb845cac8d06924c569dfcf1f2c807b4afa1d74d11481640"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._resolved_placeholder_decorations (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2218}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a9065c904a53cd55abb8af2c5be2ea5cba0942cd7d9502893a6b04277d2f6e9"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._row_timing_profile (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1266}}}],"partialFingerprints":{"codehealthFindingId/v1":"c6f167c6d859ca3516d49416156de407ee9f8c4dc9f7bf68687db0af7f7d061c"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_animations._row_matches_powerpoint_behavior (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2659}}}],"partialFingerprints":{"codehealthFindingId/v1":"e93cc396d7ecd73feafd6093d2f5a27e0d9a6b225e7f8e8a24f4eb57ba304d6c"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_intake._diagram_summary (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_intake.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"a79e38c5c5b279117f067a84c7ba22d220a3e60e6d36d451fd2fc68540b07830"}},{"ruleId":"D2","level":"warning","message":{"text":"diagram_read._diagram_parts (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/diagram_read.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"b32e2e1bb5f0a18dc3daa042a946281ba2b4db7bff59513e2e07fad04b821c93"}},{"ruleId":"D2","level":"warning","message":{"text":"effect_to_svg.convert_effects (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/effect_to_svg.py"},"region":{"startLine":112}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce8c09bbfca0e08a43edc675c3f8c4456b9c96aa0d53aeae30a113acd8716014"}},{"ruleId":"D2","level":"warning","message":{"text":"tbl_to_svg._native_cell_payload (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"647c1824597ed20377548e163581186a50bd9cb7fa9c35229a9dfb04d6b5720e"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions._apply_slide_motion_unchecked (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":1834}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e63bc0875acdcda402be58e2175db45741d23c38c3935ca01f3c707174a1a5c"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_transitions.validate_pptx_transition_package (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":2627}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ea88e57b47de0e3d969f18989a228ac8ba668897ef629e31ed2f067c89a7dd5"}},{"ruleId":"D2","level":"warning","message":{"text":"page_context._page_image_filenames (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/page_context.py"},"region":{"startLine":149}}}],"partialFingerprints":{"codehealthFindingId/v1":"5caf9d81d07f8b050a946c9bb12cb9590937182d6fc4136d7d770f163cd47173"}},{"ruleId":"D2","level":"warning","message":{"text":"semantic_table._factor_cell_styles (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/semantic_table.py"},"region":{"startLine":404}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bcd40ff45fac9c92b66bf48d71105ece541d079865c4c96b2034043865c32b0"}},{"ruleId":"D2","level":"warning","message":{"text":"_markdown_links._definition_end (cognitive 17): _markdown_links._definition_end has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 3 (5 pts), boolean chains 4 (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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_markdown_links.py"},"region":{"startLine":189}}}],"partialFingerprints":{"codehealthFindingId/v1":"629897989e09b5efb4f315cf89f2f18145e78906b99df19720683a7e70ed092a"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.get_heading_level (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":101}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e353e4f23761e7213809a426106380d382517da7cf55399949dc35d1f2f2c70"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.detect_headers_footers (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":317}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4cedca1997d43ce60de0af6851d43b077101fe74ccd1a4eae3509a9dc7f1192"}},{"ruleId":"D2","level":"warning","message":{"text":"ppt_to_md._chart_date_category_note (cognitive 17): ppt_to_md._chart_date_category_note has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), boolean chains 3, ternaries 2 (3 pts), 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":893}}}],"partialFingerprints":{"codehealthFindingId/v1":"83eb5bbdd1329942c4176960d88bf2613c8a758c380d0d5bc943c5b7a4d56df2"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_authoring_view._definition_closure (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":1106}}}],"partialFingerprints":{"codehealthFindingId/v1":"4a4def5485a26aca3dcd3b66f1b0b71f78555e3bb517b9668924029dd73b3c3d"}},{"ruleId":"D2","level":"warning","message":{"text":"server._apply_edit_record (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":391}}}],"partialFingerprints":{"codehealthFindingId/v1":"dac707bf23f287eb575efabd19f6e6a0c572bf580f5b73376885e9a17e90d100"}},{"ruleId":"D2","level":"warning","message":{"text":"embed_icons._namespace_icon_elements (cognitive 17): embed_icons._namespace_icon_elements has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (4 pts), boolean chains 1, 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_icons.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"16617feb65db62cba5615d22709e2ca6d3751158c0e5e290f185d3afb45e90a4"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._ungrouped_slide_local_facts (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5897}}}],"partialFingerprints":{"codehealthFindingId/v1":"15c261b374fb170471317a002a30307a6add67578e874cb08762fbc676b0d2de"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._print_template_summary (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9945}}}],"partialFingerprints":{"codehealthFindingId/v1":"a36fed3dccc42dd2dd8e5e0a3868583ffa63e5409c3ab266a7f638ced72beaf6"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._provenance_categories (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":10138}}}],"partialFingerprints":{"codehealthFindingId/v1":"d0f985e7dfae749514c8b4afe20a4bf5ef8d7cb24dfbc2238284da80690e293e"}},{"ruleId":"D2","level":"warning","message":{"text":"svg_contracts.check_freeform_geometry_values (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":940}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bfff3c07aef6d900cfc4d712caec6c6c2b899b7ab0148b37ac6eabceb5d0c38"}},{"ruleId":"D2","level":"warning","message":{"text":"elements.convert_rect (cognitive 17): elements.convert_rect has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 8, if/else 7, ternaries 2. To reduce it, split the body: this score is breadth rather than depth \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1278}}}],"partialFingerprints":{"codehealthFindingId/v1":"b21494583dbe7ebcfaae660b7344bd8d8f478541399216428236d3145cfa40b6"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.is_picture_effect_carrier (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3151}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f0207bfc2f3c1de648620700450bc68b313d6833143453cfc241b1ed575e75b"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.estimate_text_cluster_widths (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3839}}}],"partialFingerprints":{"codehealthFindingId/v1":"60c046ea78ea93e03717c1ce9574a23ff09a996a9d063c6499ac36a66f471c08"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_data._combo_plot_entry (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1134}}}],"partialFingerprints":{"codehealthFindingId/v1":"6993b7bd765c04701d6044c64e6c022c31a4bd00a50b46865e47c24ffe84c7d3"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_patch.patch_chart_package (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d43d3a7003243dce8527922448f8de0999592e265bfeb256e461dc13d0ecfde"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._native_chart_line_marker_warnings (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":837}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a73cb49b9a425eb229749a394c5c1e1b6a0becd04f18331828e55313cb281b"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_style._native_chart_area_warnings (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":894}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a2f29fdd0ad1eeb9879e4a68870bbe2eb6600c582c5e86dfd530eec1795059e"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_xml._combo_plot_xml (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":1099}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4f6d629be82e9c262cd22bdfe0778427b111cb2954979887a3308dde87b257"}},{"ruleId":"D2","level":"warning","message":{"text":"_LatexParser._parse_atom (cognitive 17): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":531}}}],"partialFingerprints":{"codehealthFindingId/v1":"498086e64a249974ce5521953b83fadd344358bfe06537f7368df7f95aec73a4"}},{"ruleId":"D2","level":"warning","message":{"text":"marker_common._hex_or_none (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":121}}}],"partialFingerprints":{"codehealthFindingId/v1":"340c6ae9ff38d49c40c73c8cb8de89cd87476f10dba6f39926bd8ef7e8deccce"}},{"ruleId":"D2","level":"warning","message":{"text":"table._native_table_header_warnings (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"e49e8e308c4d65c41e596ea997d4a283486644a59d8956e3b5627a91c5cdb08b"}},{"ruleId":"D2","level":"warning","message":{"text":"narration._animation_timing_branches (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"d45204d9c165d5ecd0e7d542f0f9619d79f55a0bb98b8cf4be497347e9df4a75"}},{"ruleId":"D2","level":"warning","message":{"text":"notes.create_notes_slide_xml (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/notes.py"},"region":{"startLine":64}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fd03ee38f3fc7231f7e2ae2344b88867b01a429c33ade654720016b3f821a84"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure._mirror_element_difference (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":3064}}}],"partialFingerprints":{"codehealthFindingId/v1":"c60f0acfb2265905b5698351f6274c5709936f289fb77db6052f8395629464f7"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_boolean._require_closed_commands (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":914}}}],"partialFingerprints":{"codehealthFindingId/v1":"97b2aaa606b2fa92cef1e6e9e4df3e0507bcfb1083f8af9f9c4cac6f568131fd"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_boolean._fragment_paths (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":1018}}}],"partialFingerprints":{"codehealthFindingId/v1":"01291c72a1679a6eaa7150e855026dc60eb9c0252acbbae826bcd79e62b199af"}},{"ruleId":"D2","level":"warning","message":{"text":"shape_boolean._effective_style (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":1218}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1fae448250c1081ea305c2c40b9af1fec927be2cf9b4b70dc112da50638da5a"}},{"ruleId":"D2","level":"warning","message":{"text":"template_preview_pptx._verify_output (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_preview_pptx.py"},"region":{"startLine":240}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a7f8b68b06bf5b9c4dc9ea049cc12df08968cefb588b8c981b8254ebcaf6901"}},{"ruleId":"D2","level":"warning","message":{"text":"text_measure.wrap_text (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"ecd84535a7a52bb0524c1d76e528ba05bb418902138870e637610611a3527a55"}},{"ruleId":"D2","level":"warning","message":{"text":"total_md_split.main (cognitive 17): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/total_md_split.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4ffe4b3dba502239c7bdab9231bb81e70ff11be194d9018cc8348dad51bc84d"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_edge._subtitle_cues (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_edge.py"},"region":{"startLine":344}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d6d1ccbe7c3e30064014d07fa211c37f4c32c026029218303b3495cad5ba37"}},{"ruleId":"D2","level":"warning","message":{"text":"video_subtitles._hard_split_span (cognitive 17): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_subtitles.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"bcbfa54e8a2019ead0465b17fd812932862f98a4ebd00e031cfd74690493287a"}},{"ruleId":"D2","level":"warning","message":{"text":"app.enumField::makeChip (cognitive 17): 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 \u2014 checks laid out side by side rather than stacked \u2014 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1474}}}],"partialFingerprints":{"codehealthFindingId/v1":"428ed59c0754d266cc13181d4d657f09b680fd4eb454e87a5357f1d7730c8aea"}},{"ruleId":"D2","level":"warning","message":{"text":"analyze_images._analyze_images (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/analyze_images.py"},"region":{"startLine":224}}}],"partialFingerprints":{"codehealthFindingId/v1":"e42dd83836e51ce3fdd1444c5af705c2b82a7f91e413b17ed7ff79a411055d07"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._roundtrip_source_svg_names (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":280}}}],"partialFingerprints":{"codehealthFindingId/v1":"6a3103a08829ff898e0c1f996081a5cc9d5189dcf856932c3f7defd77646ea79"}},{"ruleId":"D2","level":"warning","message":{"text":"authoring_roundtrip._referenced_assets (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1204}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97940cf84d065c9a1208ff9f5009c4e33a4945127db32dc170ec8f435501238"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchValidator.validate_project (cognitive 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/batch_validate.py"},"region":{"startLine":82}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ec102917b42dd03dbad21fffd2efd5846f677a2fd78b5e068cca37fedad3d8a"}},{"ruleId":"D2","level":"warning","message":{"text":"BatchValidator.export_report (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/batch_validate.py"},"region":{"startLine":216}}}],"partialFingerprints":{"codehealthFindingId/v1":"c18ee77445b614e5f513580f35cf9d3f817c28f5cb94b661fba42ccd06adb7ac"}},{"ruleId":"D2","level":"warning","message":{"text":"config.load_prefixed_env_file (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/config.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"522e8efc07fd5708370cfff3608a838a7e35788804abda52097ef94d03074e1d"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_openai.generate (cognitive 16): backend_openai.generate has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (11 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":828}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0a6906923834cbe814db3eeaf278b261e248ecce1f5c06d6601c754ba3607a0"}},{"ruleId":"D2","level":"warning","message":{"text":"backend_tencent._generate_image (cognitive 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_tencent.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"2e36b4daa351d3d84a4d03621823ca6a101ec5b1754342b50ad2b52af65e6daa"}},{"ruleId":"D2","level":"warning","message":{"text":"image_search._retained_pool_candidates (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":832}}}],"partialFingerprints":{"codehealthFindingId/v1":"79cd0895a8bd41e275533815b1e7659c7c2216ad0f841a03bf60d14b7b7d26d9"}},{"ruleId":"D2","level":"warning","message":{"text":"provider_openverse.parse_results (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_openverse.py"},"region":{"startLine":69}}}],"partialFingerprints":{"codehealthFindingId/v1":"c44e43aa96399ede08f188cb6d0c12f8f0b985dc2550d420ae69925e05d1f243"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._text_body_segments (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1243}}}],"partialFingerprints":{"codehealthFindingId/v1":"76ebe3e23bf3db639987a9b6094e0c7ba58faaaac2bd58c4b6480cb316b6a826"}},{"ruleId":"D2","level":"warning","message":{"text":"mirror_template_materialize._sanitize_connector_references (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":2800}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5a88b1a1ad4ff6ec44bf0b3b00f4ccf4f6d2e9626b42bfe0e82b9abe6f19db5"}},{"ruleId":"D2","level":"warning","message":{"text":"narration_sync._parse_srt (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc179356b80203aa11ba54a1af1a6406a99117f591b6aa51d75c2512684bc804"}},{"ruleId":"D2","level":"warning","message":{"text":"narration_sync._align_audio_starts_to_video (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":1661}}}],"partialFingerprints":{"codehealthFindingId/v1":"13d38ae4c0675471e15a03dc4af4a8ff55d8a3d1c648060cffeb3f2bbaa58afa"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_effects.txbody_has_run_effects (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_effects.py"},"region":{"startLine":187}}}],"partialFingerprints":{"codehealthFindingId/v1":"b71c7e53b6da5a9e37912779f150d5cdfbbf15cc5d9a2743013126e43b245ff9"}},{"ruleId":"D2","level":"warning","message":{"text":"clone._remap_cloned_xml_part_slide_jumps (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":468}}}],"partialFingerprints":{"codehealthFindingId/v1":"93b47f1b000e9f9cc01707baa5603f9a0b7b33a02376e228d830c48b03b903c2"}},{"ruleId":"D2","level":"warning","message":{"text":"pptx_template_import._managed_resource_paths (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_template_import.py"},"region":{"startLine":153}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fe73012fe1590b8acea5a1dd1c86274914851e0a837c4961f4ecdf8945e8d85"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._chart_visual_styles (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"9597eed334e3458b760f4f243ebfad7aa3186ef8ff4f5c3340a2011873fb0937"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_to_svg._validate_normalized_axis_topology (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1639}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1547cc17b231a46aa4fd4b3c7e934c6dc2b6217773c4879defe6feb75aa91a2"}},{"ruleId":"D2","level":"warning","message":{"text":"ln_to_svg._project_degenerate_stroke_gradients (cognitive 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py"},"region":{"startLine":301}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccd9c4eed863ecf8620e929ee3f38babfb49d064254c612f081661a6e76ee044"}},{"ruleId":"D2","level":"warning","message":{"text":"OoxmlPackage._load_presentation (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py"},"region":{"startLine":284}}}],"partialFingerprints":{"codehealthFindingId/v1":"588d6428a595f678cf63dccb02d50144189495ad18e7051624b871b602fc4cab"}},{"ruleId":"D2","level":"warning","message":{"text":"slide_to_svg.assemble_slide (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":230}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e19972763c07e460ba5270bdf12092cc7a8af1375a26d2457e369bee032dd59"}},{"ruleId":"D2","level":"warning","message":{"text":"txbody_to_svg._resolve_theme_typeface (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":1153}}}],"partialFingerprints":{"codehealthFindingId/v1":"364518f20046810568dcf527d7a4980033d84ab4e36405401fa86d9215492ad4"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectManager._merge_image_manifest (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":636}}}],"partialFingerprints":{"codehealthFindingId/v1":"147a2e952503d3c75560acdae46782159731975fcbdd723cecd7fe3ad4265eb2"}},{"ruleId":"D2","level":"warning","message":{"text":"ProjectManager._propagate_image_assets (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ff8519e6a59e346809c30c027484963577e6b9a449126f69b6b4a7205811d3b"}},{"ruleId":"D2","level":"warning","message":{"text":"rotate_images.main (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/rotate_images.py"},"region":{"startLine":752}}}],"partialFingerprints":{"codehealthFindingId/v1":"64713ef4342a61e8918f35311d53545445ff0fcd4582c15a5bf2c20d4456772e"}},{"ruleId":"D2","level":"warning","message":{"text":"pdf_to_md.merge_markdown_continuation_tables (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1435}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e38b569df24f6833bf9eae66277e471414fbd32b252e920bc44fdd3475ce808"}},{"ruleId":"D2","level":"warning","message":{"text":"_PublicConnectionMixin._new_conn (cognitive 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fd93914a2eeb2c1b4dc80a59a6df0b44d8443939f1a68860cc804372ddfbdf2"}},{"ruleId":"D2","level":"warning","message":{"text":"fix_image_aspect.get_image_dimensions_basic (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py"},"region":{"startLine":63}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d980457c276d7c1d4c0fb9e7b555a51591ebf19a83e813f938885e81dedf15"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._has_zero_opacity (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4537}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3823e0aa752d3a91c031d989b0be6273833b670e3ca6d53b884e1fe4da08c1f"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._layout_contract_fingerprint (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":7979}}}],"partialFingerprints":{"codehealthFindingId/v1":"adcbd9ebb41910e9976f61a5e469ce8c2cd0bb41aa0da0c77153d288ef739b02"}},{"ruleId":"D2","level":"warning","message":{"text":"SVGQualityChecker._apply_aggregated_issue_counts (cognitive 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9982}}}],"partialFingerprints":{"codehealthFindingId/v1":"975d4538818d46cf84c52554496cc4367378c404bac08daf6072eb0362145e08"}},{"ruleId":"D2","level":"warning","message":{"text":"animation_config.build_group_listing (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1861}}}],"partialFingerprints":{"codehealthFindingId/v1":"dbfdae9222af1ac837a7b7bc254d97d2d0f6e84e90cb12f155812514514ac2a8"}},{"ruleId":"D2","level":"warning","message":{"text":"elements._build_text_fill_xml (cognitive 16): elements._build_text_fill_xml has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), boolean chains 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":2881}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7fbf9917f78eeeb02f0c58cf86366cac2360700b4f7285155f7395a5dd18036"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._transform_operations_matrix (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1752fe6310b8690f05510b848db14923a4fbd0e91ef3bf45ebf8365d0a309cf"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.classify_project_marker_shape (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":2066}}}],"partialFingerprints":{"codehealthFindingId/v1":"adb2f10e8578529189c5d85ba5ac0b17f220c2cf3471cd8f34faa608d97dbe02"}},{"ruleId":"D2","level":"warning","message":{"text":"utils._is_imported_preset_preview_filter_target (cognitive 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3081}}}],"partialFingerprints":{"codehealthFindingId/v1":"925598ed49475e0cb22427c39ba0e9e460e23a3c38a9902e0356fa1a7f382593"}},{"ruleId":"D2","level":"warning","message":{"text":"utils.detect_text_lang (cognitive 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3487}}}],"partialFingerprints":{"codehealthFindingId/v1":"be5179edb917581e38dedfeaf93dcec77f59fcdb75bdd8e83de73fb1d4a4cd83"}},{"ruleId":"D2","level":"warning","message":{"text":"chart_patch.chart_edit_is_data_only (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"388e03565311c2295bb318c986540384fb520e0c52ad1294bcca93b06d53ca85"}},{"ruleId":"D2","level":"warning","message":{"text":"_ChemParser._parse_grouped_formula (cognitive 16): _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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f96bccd4b0de6ca32cb97447c3767ea2dd9b86816a18892241ed438cab1a3fbf"}},{"ruleId":"D2","level":"warning","message":{"text":"marker_attributes.native_metadata_payload_matches (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_attributes.py"},"region":{"startLine":99}}}],"partialFingerprints":{"codehealthFindingId/v1":"76bae839810721f5adc49548725660474f0a9364a05b467f7fc65bfc7ef0b110"}},{"ruleId":"D2","level":"warning","message":{"text":"marker_common._fallback_fill_candidates (cognitive 16): 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":804}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ab3d39aaf346c2b6fd06e5222b0f2ad8b207bad34b909a401d84c2e7b080ee"}},{"ruleId":"D2","level":"warning","message":{"text":"table._native_table_warnings (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1310}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2364aed3e9d0853e44664a85abb0df4e622bf627e8ca9d92400c441fcf02c9a"}},{"ruleId":"D2","level":"warning","message":{"text":"builder._apply_template_slide_backgrounds (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3559}}}],"partialFingerprints":{"codehealthFindingId/v1":"43be67b89ce3d037a3883701b12c8769c21e81831f755e9dc4da02542b6edd0f"}},{"ruleId":"D2","level":"warning","message":{"text":"cli._conversion_trace_dangerous_normalization_count (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2f970e8e28dbd8b52410f00379811fd1d7ad32f1d3c6c678308c67e95bfdbeb"}},{"ruleId":"D2","level":"warning","message":{"text":"dimensions.resolve_svg_canvas (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/dimensions.py"},"region":{"startLine":139}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c1b631eedb4ba917ef1d381be12b94be146f767e50e05392bac33450202772f"}},{"ruleId":"D2","level":"warning","message":{"text":"template_structure._validate_placeholder_carrier (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1437}}}],"partialFingerprints":{"codehealthFindingId/v1":"835ca236a864e3826aed0d29b36d207683f9fd51314ecdfafd0d3a9c2e836557"}},{"ruleId":"D2","level":"warning","message":{"text":"text_outline._font_files (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/text_outline.py"},"region":{"startLine":679}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f009b08ecc07fe75c6434528eae5a67be32ddc091ab086aeda4235a34b451f1"}},{"ruleId":"D2","level":"warning","message":{"text":"video_subtitles._parse_srt (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_subtitles.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"28d1282ca2b3f5eaeab576e600ef41f03b2cc91e61b6450a9417e62718de1d65"}},{"ruleId":"D2","level":"warning","message":{"text":"_AutomaticTranscript._should_retain (cognitive 16): _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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/workflow_transcript.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"f76f0391a2a511d8c980bfbd70a4b25c299eb9e2abcc7159e8a61897c37d0b84"}},{"ruleId":"D2","level":"warning","message":{"text":"app.localized (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":788}}}],"partialFingerprints":{"codehealthFindingId/v1":"d978a7913a5afb1b220407479299fd4b72157bc96fe44478a0cc4056d51f690d"}},{"ruleId":"D2","level":"warning","message":{"text":"app.legacyRecId (cognitive 16): 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1372}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e92881759ffbfad857a4e76df12f312e5e7b4e8c1bf1b024c96ddf26dc6eefa"}},{"ruleId":"D2","level":"warning","message":{"text":"app.updateNavLabel (cognitive 16): 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":592}}}],"partialFingerprints":{"codehealthFindingId/v1":"0471fc648be85cc7149c37aa50ffb2efc5508833c395d28a29f8c48db8edf525"}},{"ruleId":"D2","level":"warning","message":{"text":"app.modalConfirm.addEventListener(\u0022click\u0022) (cognitive 16): app.modalConfirm.addEventListener(\u0022click\u0022) 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 1815, 1841). 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\u0027 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":1785}}}],"partialFingerprints":{"codehealthFindingId/v1":"7d7a7dff9b303b5afb37d61befb8ad38cc3081fe4894718c207e52e02e23b0e6"}},{"ruleId":"D2","level":"warning","message":{"text":"app.renderEditableProps (cognitive 16): 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\u0027s 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 \u2014 checks laid out side by side rather than stacked \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2100}}}],"partialFingerprints":{"codehealthFindingId/v1":"33f4f6987bc4d5340c24a0fb5bc45854eabc7f88c0c13844af021a15dc271743"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_package/builder.py: FileTooLong \u2014 6985 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 6485 over it, 13.97\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b2834279132aa1e0879a5c87bda4e2582b38b521c5e24a69a845d1f526d317e"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drawingml/elements.py: FileTooLong \u2014 4364 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3864 over it, 8.73\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"87f8b59012e65465394ab17f57f5887473581037dff28a0fd05c404855e69669"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: static/app.js: FileTooLong \u2014 3644 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 3144 over it, 7.29\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f99d3d12b6a49a24eb16e50dc8a01678139e08827c9568b2adafc4a4e5ae5a6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/pptx_animations.py: FileTooLong \u2014 3073 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2573 over it, 6.15\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9cba2a4ee97d00aa38880281c2c9b95c6b2a66599a9f64e094284db6d195b6d9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_package/template_structure.py: FileTooLong \u2014 3009 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2509 over it, 6.02\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57bdd67bf64074efb7bd0fc843f80009df3cfc0109978779f8e47450b8fa74a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drawingml/utils.py: FileTooLong \u2014 2984 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2484 over it, 5.97\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"31b3607aaae59e9806f415962451a90eb83c224e84d2e6d1eafa99a939b5ba7b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/mirror_template_materialize.py: FileTooLong \u2014 2964 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2464 over it, 5.93\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"46c3ff38bfa2e41788525606d85df82f34142517e7b6b564ab9e02190c35b8d4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/chart_to_svg.py: FileTooLong \u2014 2724 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2224 over it, 5.45\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a54dcacbab49df8d7f4de9d5117a7ffdcda73b9a16dadbd05cef0e8a1746d48"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/pptx_transitions.py: FileTooLong \u2014 2530 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2030 over it, 5.06\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9bd24074ef5c8ac4a0578db6501d52b9583e9b9a7726d6da3c798afce1a5906"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/svg_authoring_view.py: FileTooLong \u2014 2372 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1872 over it, 4.74\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb1f570aafd2320373301c35b03bf7221990fec6b5e76d7537357c4d3acfbb63"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: static/app.js: FileTooLong \u2014 2309 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1809 over it, 4.62\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ede923e2c7e21369f12ced76449ce49be22b64eb4133aafc8041e8e581df5650"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/image_search.py: FileTooLong \u2014 2253 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1753 over it, 4.51\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"096996b7794d2515dbf9555e2567694c89b220b68ea35723553d0ace95e1a380"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/slide_to_svg.py: FileTooLong \u2014 2167 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1667 over it, 4.33\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d45ec577d5bf1a4b0e2d82f48f746f1510499f2d3a78a863818d95fa0116fb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drawingml/converter.py: FileTooLong \u2014 1994 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1494 over it, 3.99\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"40b41525fa7c5e084d38e7aa86a4fcde28897cfd411995085e33ebd7a3fc4d77"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/authoring_roundtrip.py: FileTooLong \u2014 1963 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1463 over it, 3.93\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4287c5f18dcc7f3a441447375a71c8019f467f164598eeb2f28973a200cc83b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/prompt_audit.py: FileTooLong \u2014 1895 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1395 over it, 3.79\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"74f4670bf5ae4c70f2c55c8f55ccac8aff0793fe208dd9dbbcb2366b85a85854"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_objects/formula_parser.py: FileTooLong \u2014 1829 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1329 over it, 3.66\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7c13ebcdc4474ddf534b3ef9bae764fd597e4943442acbb7a8098cae7bf0471"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/narration_sync.py: FileTooLong \u2014 1758 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1258 over it, 3.52\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb785e49649f420be85bbf11520afc8a208766c811d0b082824252a89de66e92"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_package/cli.py: FileTooLong \u2014 1727 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1227 over it, 3.45\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c7b5df7685d2136e6dab24c326988163a714b71fd16a286a3a5258bcdb5fccb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_objects/table.py: FileTooLong \u2014 1675 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1175 over it, 3.35\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"02fad721c2f5e19fa54e95d0656c1f6d952dc1e920c11507cfce15e9212e50bc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/tbl_to_svg.py: FileTooLong \u2014 1622 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1122 over it, 3.24\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"2657a82487df5ccfb3432e86b17ff72ab39c478bb7a0699becc83cfabf6cc29b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/converter.py: FileTooLong \u2014 1510 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1010 over it, 3.02\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc20628e08574c773683da2bd21b25681beb731465b28e1001930d0a501d1505"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svg_to_pptx/animation_config.py: FileTooLong \u2014 1502 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1002 over it, 3.00\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f67ab37784bfa52bf0a9d1ff5cca07cf624ae4fc6b168faa2348462d949386d6"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_objects/chart_xml.py: FileTooLong \u2014 1486 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 986 over it, 2.97\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"b1e9ba56da58f02413442b24db7f641cfbbfbac6c9c1a0278e2cb368520fd163"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source_to_md/doc_to_md.py: FileTooLong \u2014 1450 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 950 over it, 2.90\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"6585e53df81b578ee17e571ecf6441d75e6159f5ada3302c2fc544c5e83184dc"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_objects/chart_data.py: FileTooLong \u2014 1413 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 913 over it, 2.83\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"92ece9b00518d85105cf5fe57b410e9a797008e06ed483be66d19a02da7880fd"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source_to_md/pdf_to_md.py: FileTooLong \u2014 1388 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 888 over it, 2.78\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5d47a8c98af52f2b55cb4412d8a557a60dfb27845b9865e543c5846be594e8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_objects/chart_style.py: FileTooLong \u2014 1388 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 888 over it, 2.78\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d79d45615e0f592267783544117778dc765d09205c06bbf6455e109688383ed8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/txbody_to_svg.py: FileTooLong \u2014 1373 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 873 over it, 2.75\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffba4a1d717cd0ac8d5d4d0ce6db51171c99db8b895926b8dac8c22aec086a16"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/video_sound_mix.py: FileTooLong \u2014 1322 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 822 over it, 2.64\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"a0ebfea2e28f9acff13c594df4fcf1c3e918b9fff5140a8dae45bee1322fba6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.renderTypography: FunctionTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":3058}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8abd08ca2495808bd57348a77f786bb1ab01e80a7be347512a77054431072a7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_package/template_validation.py: FileTooLong \u2014 1254 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 754 over it, 2.51\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f256dc19239280042dda8bef384ac2fe8514ed9949c9d2136770ec3698f307c9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svg_editor/server.py: FileTooLong \u2014 1249 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 749 over it, 2.50\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac830a04c2f2ac692447ef28a83f1756eaa158dfea50da822830df5e5bed28c0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source_to_md/ppt_to_md.py: FileTooLong \u2014 1238 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 738 over it, 2.48\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"50ee7ee91c2895ac1284a2ffba991d45759fcd1fd38ea6e5ff135bd4a319c5b4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/normalized_chart_svg.py: FileTooLong \u2014 1228 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 728 over it, 2.46\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"00284f1739f965ef6d47db19952b09c8b8ea9b30b74900289b4ac26f08733c1c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: source_to_md/web_to_md.py: FileTooLong \u2014 1190 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 690 over it, 2.38\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d7553907c7f8d9eeeb46773b3d89bed92aa522988d3b75d62fb4cc73372a8d"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/image_gen.py: FileTooLong \u2014 1163 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 663 over it, 2.33\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df7db78dee01220fb20f3ef7018f4ffcb722d6347f90feefd6362dd56e30de50"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: project_management/cli.py: FileTooLong \u2014 1158 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 658 over it, 2.32\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5dc6d8414759b1e8f497e9bf186ef0d7f1df2e9a267b8eacad79d42aaa625e09"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/register_template.py: FileTooLong \u2014 1112 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 612 over it, 2.22\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5688f119c6b7bfbe34f518d82cceef45f92a8bde601da84118663a54e35c72f0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svg_to_pptx/shape_boolean.py: FileTooLong \u2014 1082 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 582 over it, 2.16\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f39da62d72ee4b9b066bd9f8c08be2104767b9d9866d1f2b34558dab5928420"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.renderImageDirection: FunctionTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":3566}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6322e4cb5db6b57791e1ab5f7a32a4c636ecf2ac608045f32ccafce7879def2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/extract_svg_assets.py: FileTooLong \u2014 960 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 460 over it, 1.92\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae554c35524809f946d6c9bc298fa96e3ebef087fb76672248f01c762b31b643"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: _LatexParser: TooManyMethods \u2014 57 methods. The bar is 30 methods; this is 27 over it, 1.90\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1702cfcd13b34071902eccc3e23c4bda2d137c19f9605b343eb10fa5a47eefb"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svg_to_pptx/text_outline.py: FileTooLong \u2014 923 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 423 over it, 1.85\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/text_outline.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e8de98b5d7f1d904910f9f775cc1f629e7addab751f02298172deb036f2ba46"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/svg_position_calculator.py: FileTooLong \u2014 920 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 420 over it, 1.84\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4240b67dd7ca45b25a84f99646424dd7cb737345dbb310669fa008c9088ed8e2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/pptx_delivery_check.py: FileTooLong \u2014 909 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 409 over it, 1.82\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"9298cc1d972fa22b402bdee5e7f1a3f6d1de611de7d0d256804fea18e7f99a4c"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_objects/formula_omml.py: FileTooLong \u2014 899 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 399 over it, 1.80\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"75d006c6c1be1455a4c36b0c6058e180911e21db7a7d40472821168e5e670529"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svg_quality/svg_contracts.py: FileTooLong \u2014 896 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 396 over it, 1.79\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60b3ea2d35fffa0731b369b1399ba7092568d53f9f5eb98f6348c0af079727ac"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_objects/marker_common.py: FileTooLong \u2014 888 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 388 over it, 1.78\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fab408de7796019395dad82ef1f17d72de08cdd028f26366c87969d2ab2df3af"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/slice_images.py: FileTooLong \u2014 877 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 377 over it, 1.75\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/slice_images.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"25c073b1f8fccc1a9f57576bb497b765fdde522cea7ff0e213852b43adc1b428"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/notes_to_audio.py: FileTooLong \u2014 797 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 297 over it, 1.59\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/notes_to_audio.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c2d7f8e542c425ef7b7bbbbe862db81a397184f3f1315ad4fcd0737ece5d4fb4"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/pptx_workspace.py: FileTooLong \u2014 787 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 287 over it, 1.57\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7ac0ca4b14ef36e563cba4790bdc421ffb7bda6c862fc041e21ca7047820ff7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: project_management/page_context.py: FileTooLong \u2014 778 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 278 over it, 1.56\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/page_context.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc332f3a7bf1f4846fde7640ebdd2a4e1b47458f9729c086c2cd52e4f3406e0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/text_measure.py: FileTooLong \u2014 770 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 270 over it, 1.54\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"57672ad0aa7f0cac8d2f947ceccb3b72193f9a2929730de9d0b253f9e5175e6d"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.enumField: FunctionTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"c58080b2985d40af0cd97922e6ee2cfff0721e534a14b6844fc7e6aad348ce05"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_ooxml/clone.py: FileTooLong \u2014 733 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 233 over it, 1.47\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f773218a8c54ea1f75b255ca6f403374af5203fe2740bbf6f38a8b746f97b5fa"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/color_resolver.py: FileTooLong \u2014 709 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 209 over it, 1.42\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/color_resolver.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"df19dc6fa6e62a3b0416c0ce3de3110f80a68f48ecf1f034ab662207f8eafd22"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/preset_authoring.py: FileTooLong \u2014 706 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 206 over it, 1.41\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f79ae820befaafc37f6d4d4e0b4bb2c50f763fc8af2eded54c2859ed10471494"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: svg_finalize/flatten_tspan.py: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e24acb9ecaaa4956b0922f88fab7269430c872f1ae6aa7d5a5ac83eaa2fbdb3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drawingml/paths.py: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/paths.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5fd3b6c500cce7ca683b505b17f5d7b92db72d6d4d9c81f0d21553b2c2c9929"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: template_import/manifest.py: FileTooLong \u2014 656 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 156 over it, 1.31\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/manifest.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5345dffa71810b3d3a1e3ad09c11e672dd0bdf4ae46778dc3c90f060f82d21b2"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_package/narration.py: FileTooLong \u2014 653 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 153 over it, 1.31\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4293ef039fdefb9f12e460bef6fd6089314749d3e95daa0ca0458b3e83bbbbc8"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: native_objects/__init__.py: FileTooLong \u2014 649 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 149 over it, 1.30\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffd800f4d65901204c8bb3ec46bd5fe929d8e0422f12ea9db1aa35326bf9df89"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: image_backends/backend_openai.py: FileTooLong \u2014 638 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 138 over it, 1.28\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3a88c3fba95d644f79767b1e2e32040eb6dbaa1e2021c495d10046b7385c4e0"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drawingml/text_properties.py: FileTooLong \u2014 629 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 129 over it, 1.26\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"dba99a220e8e049f3f6614a2ab3962ad4929dcefd596b4a284acba6a28c0f862"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/project_utils.py: FileTooLong \u2014 615 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 115 over it, 1.23\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"60d83265d3aa5b426dfc5dca7f7afbde6335ade2036f4b0b54f99fe330c8618a"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/fill_to_svg.py: FileTooLong \u2014 612 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 112 over it, 1.22\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"bd90b5ed61bc5e773400e5311d0459f9e2bda6b89b155e7a7f756d3cb2cdf2c7"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: pptx_to_svg/formula_import.py: FileTooLong \u2014 572 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 72 over it, 1.14\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/formula_import.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"c55488388c63ab0545174679c6ba7e3aa9379f67cb089baa76e63b33ac3e2fc9"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/rotate_images.py: FileTooLong \u2014 564 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 64 over it, 1.13\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/rotate_images.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca032e36f287299bea41e6bc0018d6dfec60125416d603751b92d7ef93340e0f"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/video_motion_plan.py: FileTooLong \u2014 558 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 58 over it, 1.12\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_motion_plan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c10090bcd5782b1cfa880a805a09f279c21711e9e73c1b6e149c42692eae74b"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: scripts/apply_template.py: FileTooLong \u2014 550 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 50 over it, 1.10\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"71345d2ba23fa8bd84a3f249f036660348d2aaed44424bae192ca3497ec101bd"}},{"ruleId":"D3","level":"warning","message":{"text":"TooManyMethods: ProjectManager: TooManyMethods \u2014 32 methods. The bar is 30 methods; this is 2 over it, 1.07\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"00299a080620c051c5bd5410b5a7cbd3c89e38af59f0a9c11459c3695aad50e3"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: drawingml/styles.py: FileTooLong \u2014 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0c9db5321c178c01e2d76c87b6f8f81b9f65d77992628b8dbd6997874b79cbf"}},{"ruleId":"D3","level":"warning","message":{"text":"FileTooLong: image_backends/backend_common.py: FileTooLong \u2014 527 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 27 over it, 1.05\u00D7 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_common.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb9965dcf0db025534c6596191a7007301579fad0e82ad8cbb2a1aaf543f3f9f"}},{"ruleId":"D3","level":"warning","message":{"text":"FunctionTooLong: app.renderColor: FunctionTooLong \u2014 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\u00D7 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 \u2014 the runs of statements that work on the same values and would earn the same name \u2014 into its own named unit, and have this one call them in order."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":2839}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc538e628f3b11a9a3372d410ec8848febdade2484a4e97cc36f92c67d25adc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (12 members, 26 shared lines): skills/ppt-master/scripts/image_backends/backend_bfl.py:184-221 | skills/ppt-master/scripts/image_backends/backend_fal.py:149-187 | skills/ppt-master/scripts/image_backends/backend_ideogram.py:154-191 | skills/ppt-master/scripts/image_backends/backend_minimax.py:229-265 | skills/ppt-master/scripts/image_backends/backend_modelscope.py:156-195 | skills/ppt-master/scripts/image_backends/backend_qwen.py:201-238 | skills/ppt-master/scripts/image_backends/backend_replicate.py:172-210 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:149-189 | skills/ppt-master/scripts/image_backends/backend_stability.py:144-182 | skills/ppt-master/scripts/image_backends/backend_tencent.py:202-244 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:217-264 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:175-212 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_bfl.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"792943915e5284d80f1f513352abb6ce50229a037fea50343f96548e9461a2b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 26 shared lines): skills/ppt-master/scripts/image_backends/backend_minimax.py:170-222 | skills/ppt-master/scripts/image_backends/backend_qwen.py:145-194 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:106-142 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:167-210 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:130-168 \u2014 These 5 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 5 times. The repair is at the members\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_minimax.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"aab65ba692877d6d9e93f615f99160f6fd7a39de202b060bfa4e04e7664e2a22"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member family (5 members, 25 shared lines): skills/ppt-master/scripts/image_backends/backend_fal.py:105-142 | skills/ppt-master/scripts/image_backends/backend_minimax.py:170-222 | skills/ppt-master/scripts/image_backends/backend_qwen.py:145-194 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:106-142 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:130-168 \u2014 These 5 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 5 times. The repair is at the members\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"5db1db9d81ace7cceb4d6987a34526e93ff44b927c232080fe19b1eae298c217"}},{"ruleId":"D4","level":"warning","message":{"text":"Near-duplicate member pair (58 shared lines): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2929-3078 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4551-4764 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"33e09f316484e84e4cc0adcbffe34e70bc092aa31de4d7ee9ebbbfc4f68fb23c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":564}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a8ef64c7089d9239922130c05af90cc16b3b9e1c30097c0829c9c79c7185fc0"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (17 members, 50\u002B identical tokens): 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 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":156}}}],"partialFingerprints":{"codehealthFindingId/v1":"83f7a4afcbaf5a98c5ec85dd05b00dcb962382d5f5ccba3e55b98dab1c88ac96"}},{"ruleId":"D4","level":"warning","message":{"text":"Members sharing a duplicated core (4 members, 50\u002B identical tokens): skills/ppt-master/scripts/image_backends/backend_gemini.py:159-260 | skills/ppt-master/scripts/image_backends/backend_openai.py:612-711 | skills/ppt-master/scripts/image_backends/backend_openai.py:719-821 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:93-162 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe80c2a1f82d6b7385189a62f50cc2cb4210ec1e01542a3efdae08751c5d6813"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (97 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3900-3997 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4005-4101 \u2014 These two members are one piece of code written twice and then edited apart: 97 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":3900}}}],"partialFingerprints":{"codehealthFindingId/v1":"fdcafffbdaf5bd3fe7effe45ee09678793139281c64a31767ae4becc5d1c8df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (94 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:245-338 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:356-453 \u2014 These two members are one piece of code written twice and then edited apart: 94 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"d425a8b1e2002f70819b54f38e552492b8df0af54f6855fbdab7c524064824ae"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (44 corresponding lines): skills/ppt-master/scripts/narration_sync.py:226-269 | skills/ppt-master/scripts/video_subtitles.py:69-113 \u2014 These two members are one piece of code written twice and then edited apart: 44 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"6b343f5b6490ac413fdb5f198f8705465ed1f31d4f9e244e4723f8c9066f2add"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): skills/ppt-master/scripts/batch_validate.py:217-257 | skills/ppt-master/scripts/svg_quality/checker.py:10102-10136 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/batch_validate.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"5af5ab3bd654ae0f6dd022e049c556fffc9cc7558a5c6f4131d66c769c711678"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (57 corresponding lines): skills/ppt-master/scripts/image_backends/backend_gemini.py:272-350 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:173-229 \u2014 These two members are one piece of code written twice and then edited apart: 57 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":272}}}],"partialFingerprints":{"codehealthFindingId/v1":"330f5e21bcda094444db2b99e3e4b6a2e4c4ff8d0ef79b53cc6211b01d10473e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (36 corresponding lines): skills/ppt-master/scripts/svg_position_calculator.py:184-249 | skills/ppt-master/scripts/svg_position_calculator.py:254-289 \u2014 These two members are one piece of code written twice and then edited apart: 36 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"a82b3316111e63cf3abd08fcb4eea30b6c8e1d6a85ec32873c9d7675f3b3fba5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (41 corresponding lines): skills/ppt-master/scripts/svg_quality/svg_contracts.py:883-923 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:1002-1057 \u2014 These two members are one piece of code written twice and then edited apart: 41 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"428b16c6edd41c2e572a468948b4961f620cea15ccc04ef1bc001efc15f6997a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (52 corresponding lines): skills/ppt-master/scripts/svg_finalize/embed_images.py:249-300 | skills/ppt-master/scripts/svg_finalize/fix_image_aspect.py:333-385 \u2014 These two members are one piece of code written twice and then edited apart: 52 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_images.py"},"region":{"startLine":249}}}],"partialFingerprints":{"codehealthFindingId/v1":"d374c62e470684050992ef31bc759a399d20da43afddd75b4c57d2dc1229f25f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): skills/ppt-master/scripts/tts_backends/backend_edge.py:278-310 | skills/ppt-master/scripts/video_subtitles.py:164-197 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_edge.py"},"region":{"startLine":278}}}],"partialFingerprints":{"codehealthFindingId/v1":"36558bc212625f8eec548e902c6ffcc9367339a6d15ec94ad210c965e68f634e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 31\u002B corresponding lines): skills/ppt-master/scripts/image_sources/provider_openverse.py:70-102 | skills/ppt-master/scripts/image_sources/provider_pexels.py:64-94 | skills/ppt-master/scripts/image_sources/provider_pixabay.py:65-98 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 31 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_openverse.py"},"region":{"startLine":70}}}],"partialFingerprints":{"codehealthFindingId/v1":"413df349e9b5129aa7b8c9c2aa5e6c5874f9ac35b6a3fa6698477d5458e0174e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (30 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1900-1931 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1977-2007 \u2014 These two members are one piece of code written twice and then edited apart: 30 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"940edae5fb8ae66f951fe5f5da808678d885e4188658ffbac31097ccf34a8657"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2409-2443 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2448-2485 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":2409}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e394d5bd247c2c909e842305637a518279325ef9a9925d0200461b0993e480b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:943-958 | skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:1022-1045 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":943}}}],"partialFingerprints":{"codehealthFindingId/v1":"b371d4138b0b541838889658cdd277c9e4dad8edeb7dac461e1d691c2a71ed6e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 26\u002B corresponding lines): skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:438-471 | skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:477-503 | skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:509-534 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 26 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":438}}}],"partialFingerprints":{"codehealthFindingId/v1":"ffca4a995a83ca79170dbe35b77882c5649c5e835910cc5d868983b88fba5488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): skills/ppt-master/scripts/attribution_guard.py:124-147 | skills/ppt-master/scripts/attribution_guard.py:159-184 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/attribution_guard.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8c3116040864ae650a0ea018f0130f178e7209f3c3315f9aa88e6c0776592b0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (40 corresponding lines): skills/ppt-master/scripts/confirm_ui/server.py:2171-2210 | skills/ppt-master/scripts/svg_editor/server.py:1296-1343 \u2014 These two members are one piece of code written twice and then edited apart: 40 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2171}}}],"partialFingerprints":{"codehealthFindingId/v1":"63ebe8de47a4d4f4c20526a39df4945979ac054cd25e439d059c70397babfa3e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): skills/ppt-master/scripts/source_to_md/ppt_to_md.py:195-219 | skills/ppt-master/scripts/source_to_md/ppt_to_md.py:223-250 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":195}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7b4031dd7af2e488dd6bd8b889d5fca414e200ed8ff07cd187e672fc5040533"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_colors.py:238-256 | skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py:360-382 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_colors.py"},"region":{"startLine":238}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ad7edce06cfe40064707b3c88cb07915b7230eea623e16bddec918761912a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): skills/ppt-master/scripts/pptx_transitions.py:3107-3131 | skills/ppt-master/scripts/pptx_transitions.py:3135-3170 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":3107}}}],"partialFingerprints":{"codehealthFindingId/v1":"470b11912436941df04bf010edeaea0baf92c4d8b682b84bf12b7cbecf2afc82"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (25 corresponding lines): skills/ppt-master/scripts/image_gen.py:847-872 | skills/ppt-master/scripts/project_management/cli.py:193-217 \u2014 These two members are one piece of code written twice and then edited apart: 25 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":847}}}],"partialFingerprints":{"codehealthFindingId/v1":"493ab6ae7abea30378bf5f787cc793c52e04b78dff94e60bfe2cd80a0a2a9f53"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): skills/ppt-master/scripts/pptx_effects.py:110-133 | skills/ppt-master/scripts/pptx_gradients.py:45-69 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_effects.py"},"region":{"startLine":110}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa234c0dcdfdf1a2155d7cc13914d7e0b228949794392bfec5ce38fdae5c486e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (35 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/converter.py:683-723 | skills/ppt-master/scripts/pptx_to_svg/converter.py:734-768 \u2014 These two members are one piece of code written twice and then edited apart: 35 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":683}}}],"partialFingerprints":{"codehealthFindingId/v1":"845066dff05ff9e422bf94b1492a8929ff34f2546d1bdab2dfba95f9c86eb37a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (24 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:883-911 | skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:918-941 \u2014 These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":883}}}],"partialFingerprints":{"codehealthFindingId/v1":"65f7eecbe4f9a42f938544ff82f87189794902f1ad077b79a5c4c942744594b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/ppt-master/scripts/svg_position_calculator.py:668-686 | skills/ppt-master/scripts/svg_position_calculator.py:758-772 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b844659b2daee4d4976579b912217689ab83d0b0c0cd2479de5d6d5dd27d3e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (20 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1657-1676 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1890-1909 \u2014 These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1657}}}],"partialFingerprints":{"codehealthFindingId/v1":"af0a1ed28e84c8a3ab15b35a13a63153e674d77c07915f086e05d8fc13a309da"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (29 corresponding lines): skills/ppt-master/scripts/svg_quality/checker.py:4573-4601 | skills/ppt-master/scripts/svg_quality/checker.py:7128-7159 \u2014 These two members are one piece of code written twice and then edited apart: 29 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4573}}}],"partialFingerprints":{"codehealthFindingId/v1":"d68e40950c7d0749f572c277932e0aa4e8650da4af6cc30c99e3155d414243b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:80-93 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:869-886 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:893-910 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"2bacaf93d2bf63a87935cb74663458af71c14a0de740239b0155d39e60dc2901"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 22\u002B corresponding lines): skills/ppt-master/scripts/image_backends/backend_minimax.py:124-145 | skills/ppt-master/scripts/image_backends/backend_qwen.py:115-138 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:101-123 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 22 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_minimax.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"babaf04823e1d6b03f23193e430cc0c94a68f4e6cc4687d8a0ef4f6b65adf687"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (21 corresponding lines): skills/ppt-master/scripts/source_to_md/doc_to_md.py:736-756 | skills/ppt-master/scripts/source_to_md/ppt_to_md.py:636-666 \u2014 These two members are one piece of code written twice and then edited apart: 21 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":736}}}],"partialFingerprints":{"codehealthFindingId/v1":"791012d12eafc3a20d5b943621180d8e655fc4d554211cc4abd2430065b4937d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1614-1626 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1680-1697 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1913-1925 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1614}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6c9ddc66117ee1651a104cf0c95668f655019d1c50b0a4af388cc81e4312bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (26 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:437-466 | skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:481-506 \u2014 These two members are one piece of code written twice and then edited apart: 26 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py"},"region":{"startLine":437}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc85c65a9c6daaca85a0c24462d0aa231b0846ac5477567c4a4a2816abc7caa8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:990-1008 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:2001-2015 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":990}}}],"partialFingerprints":{"codehealthFindingId/v1":"28e5382414625402221930d11404014a69d2a41b61aa4d9e7dcebfe9640fed3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1457-1475 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1503-1521 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1457}}}],"partialFingerprints":{"codehealthFindingId/v1":"f97dec7b34d748112c723cfc7f2811de19374e70d47a37e830093d2631c90e25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 14\u002B corresponding lines): skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1759-1772 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1824-1839 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1845-1862 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 14 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1759}}}],"partialFingerprints":{"codehealthFindingId/v1":"53b2285291ff5af0e8e3e02f368d96c4178eec467f8dced19344d514a3dfc0a1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): skills/ppt-master/scripts/extract_svg_pictures.py:247-259 | skills/ppt-master/scripts/svg_to_pptx/use_expander.py:117-137 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_pictures.py"},"region":{"startLine":247}}}],"partialFingerprints":{"codehealthFindingId/v1":"ff82573e5f65bec5a9ca20461c7d0e42c00c3e0941598c86523636568756c405"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (16 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:782-797 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py:215-233 \u2014 These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":782}}}],"partialFingerprints":{"codehealthFindingId/v1":"f75a637408a83ca350c861525dc8d6e71e1876b8907426336d06c10369e8c9bd"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:593-605 | skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:609-621 | skills/ppt-master/scripts/pptx_to_svg/color_resolver.py:651-664 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/color_resolver.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad394984271e622282ca430554a60384419f8bddb1ed8e0218f55a74512938f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): skills/ppt-master/scripts/tts_backends/backend_common.py:30-46 | skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:95-114 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_common.py"},"region":{"startLine":30}}}],"partialFingerprints":{"codehealthFindingId/v1":"da7181f250189aa610f39115b4f2f5116b939ed91a934fcc5f2e2795e46dcc05"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py:476-500 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:618-634 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":476}}}],"partialFingerprints":{"codehealthFindingId/v1":"d80abcd28d6592f8a9be1b9a9a46c2602f2398c60771a01c6191bf756056f9c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): skills/ppt-master/scripts/image_search.py:1422-1438 | skills/ppt-master/scripts/pptx_intake.py:53-69 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1422}}}],"partialFingerprints":{"codehealthFindingId/v1":"0159406a42b371a6b4d5dac495e288a4ab698a4c6900827d0358da24e572aabc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (19 corresponding lines): skills/ppt-master/scripts/image_sources/provider_common.py:277-302 | skills/ppt-master/scripts/image_sources/provider_common.py:343-361 \u2014 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 \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_common.py"},"region":{"startLine":277}}}],"partialFingerprints":{"codehealthFindingId/v1":"c25fd5f826ef5535d9ad86b849ec8c6630f39a29ec4803bb6fb5d010b08c8709"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (31 corresponding lines): skills/ppt-master/scripts/video_sound_mix.py:323-353 | skills/ppt-master/scripts/video_sound_mix.py:357-391 \u2014 These two members are one piece of code written twice and then edited apart: 31 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4d95e096f8d9a1131fc619abbcd07f45c67063373cd4caa90a589cc70a8033b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): skills/ppt-master/scripts/compact_svg_styles.py:184-205 | skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:418-434 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_styles.py"},"region":{"startLine":184}}}],"partialFingerprints":{"codehealthFindingId/v1":"d24e8e08f33ab55b98b99c7b800113e45659131f54d6d54da1c292bfdbc4cfdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (33 corresponding lines): skills/ppt-master/scripts/source_to_md/doc_to_md.py:1884-1919 | skills/ppt-master/scripts/source_to_md/ppt_to_md.py:1603-1635 \u2014 These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1884}}}],"partialFingerprints":{"codehealthFindingId/v1":"db1b79b0a0747fc8b2219474da0674180c48667b41ed08610d599e7595b9f2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:705-726 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chartex.py:21-37 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae48fd999ea22e6ce9333aaa0b7e29ef20aca5986df0fb4d5b22da35dc834e3c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): skills/ppt-master/scripts/pptx_effects.py:137-152 | skills/ppt-master/scripts/pptx_gradients.py:100-113 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_effects.py"},"region":{"startLine":137}}}],"partialFingerprints":{"codehealthFindingId/v1":"00bb76fb7444852a92b0daec5d8abc4ff32b65ec8ba1adca31d9fe9597693959"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): skills/ppt-master/scripts/mirror_template_materialize.py:3035-3048 | skills/ppt-master/scripts/svg_authoring_view.py:2471-2486 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":3035}}}],"partialFingerprints":{"codehealthFindingId/v1":"3fdc39b4313f90557552f7ba29d5835436b75e6ef2e059c45ccfb034e25f8830"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/ppt-master/scripts/authoring_roundtrip.py:212-220 | skills/ppt-master/scripts/mirror_template_materialize.py:547-557 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":212}}}],"partialFingerprints":{"codehealthFindingId/v1":"78a55bdbd7c3ad5ea3b78a4ff8bb18c648f60d0851c4ab06bb6955ca94c58793"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (18 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1438-1455 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1462-1484 \u2014 These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1438}}}],"partialFingerprints":{"codehealthFindingId/v1":"51946261a0afe4065795d6f6122697f9c4437e5736580b0abfbaf90189e514e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 16\u002B corresponding lines): skills/ppt-master/scripts/compact_svg_coordinates.py:234-251 | skills/ppt-master/scripts/compact_svg_styles.py:568-583 | skills/ppt-master/scripts/svg_authoring_view.py:2264-2280 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_coordinates.py"},"region":{"startLine":234}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f312c3cfe33ce9f12b517e16db8d491315741bf8ba7971d51908b18dc5267e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): skills/ppt-master/scripts/pptx_ooxml/ooxml.py:159-170 | skills/ppt-master/scripts/template_import/manifest.py:162-177 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/ooxml.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c429780ed300fdd3f766c3ac105d8f90ce46d57e27a6bbd45ae116debde2d80"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2485-2501 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2508-2522 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":2485}}}],"partialFingerprints":{"codehealthFindingId/v1":"4587270ddf7d45b55c55d175200c65ae1ff9e41975ce94e94e92de28b6dda5f9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/ppt-master/scripts/extract_svg_pictures.py:263-272 | skills/ppt-master/scripts/preset_shape_svg.py:370-382 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_pictures.py"},"region":{"startLine":263}}}],"partialFingerprints":{"codehealthFindingId/v1":"2624f4d9d1c7c64b695cde5f04cc87ce4f37251c908ebde4727056baf4a63a56"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py:241-252 | skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py:256-266 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py"},"region":{"startLine":241}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb715f9e7b4eb352ab9f53361eb161b53cc463d3422b9e63cf0d17c8e5147671"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (17 corresponding lines): skills/ppt-master/scripts/svg_quality/checker.py:3522-3538 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:2105-2122 \u2014 These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3522}}}],"partialFingerprints":{"codehealthFindingId/v1":"a203d9a2378ded320d9a4f28ae949e61d0986d1e9d54501f30c9d74d14222532"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/ppt-master/scripts/source_to_md/pdf_to_md.py:645-654 | skills/ppt-master/scripts/source_to_md/pdf_to_md.py:808-817 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cef5fa381baf83c84284000852e9d46d84faa83de1a4fbcf595976f9020b710"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): skills/ppt-master/scripts/authoring_roundtrip.py:1354-1360 | skills/ppt-master/scripts/extract_svg_assets.py:189-195 | skills/ppt-master/scripts/svg_authoring_view.py:1093-1103 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"730a0fb99c74de11e25a75ba6b745b53b75101bb259a8c7b185c7384b64e14b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1668-1681 | skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:1879-1889 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":1668}}}],"partialFingerprints":{"codehealthFindingId/v1":"d48c68b06ba54a66072858367e72fe67aaed5bc4459065241f7d06c1d96306d5"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (15 corresponding lines): skills/ppt-master/scripts/stamp_native_fallbacks.py:128-142 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:393-415 \u2014 These two members are one piece of code written twice and then edited apart: 15 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/stamp_native_fallbacks.py"},"region":{"startLine":128}}}],"partialFingerprints":{"codehealthFindingId/v1":"136e30f41b76ab88b7e2640984d26ad453788da9c4ddce1419588f9b56b96488"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:855-863 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:867-875 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":855}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ae0f1ae8029ed20246c193a2f2f08b1b312e7a6dfaedea57010bc69fa27ce93"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1320-1330 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py:1341-1348 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1320}}}],"partialFingerprints":{"codehealthFindingId/v1":"2b7bd7d3e3110af8b464d11eb7355be81d5a44407cdc93377673d179c4c0b7df"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): skills/ppt-master/scripts/svg_finalize/align_embed_images.py:162-173 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4529-4545 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":162}}}],"partialFingerprints":{"codehealthFindingId/v1":"743ce0accd22f72498f6083845ccfcb4d06b6659df073ecca66a0211f629045e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:422-432 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:158-169 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantic_hash.py"},"region":{"startLine":422}}}],"partialFingerprints":{"codehealthFindingId/v1":"efee125c688f858815b3c1bd2ae58b56708a5b1985f1bf084d6eed7432ceb6f4"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 10\u002B corresponding lines): skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:352-361 | skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:364-373 | skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:376-388 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 10 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c391a9c2fc2896c6396c557205a75aaa9e4140e3eb4fe30a166b26856af330"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/ppt-master/scripts/pptx_animations.py:510-515 | skills/ppt-master/scripts/video_motion_plan.py:104-109 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"b19db4aef73a1398c6730b9b3586097bf5f963150b80df43ed91f83db48a49c8"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:191-200 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:209-217 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"aae6843aa88d4bcb878f5c95bbe6e2564a3c0591250bca9ab8571f1e81501e61"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/ppt-master/scripts/language_tags.py:297-306 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3449-3457 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/language_tags.py"},"region":{"startLine":297}}}],"partialFingerprints":{"codehealthFindingId/v1":"e142d626fa98a0274fcdbd8d7fc0f4f75738a1c4a1758b7970ba6867175b06ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 11\u002B corresponding lines): skills/ppt-master/scripts/svg_quality/checker.py:1021-1034 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1931-1944 | skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:269-279 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 11 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":1021}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ed3c38acd03f73c493dbc43dddf024d3fe4c479ebe851f532ed66e5a6ec7bc1"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (11 corresponding lines): skills/ppt-master/scripts/svg_quality/checker.py:1042-1055 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:2105-2115 \u2014 These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":1042}}}],"partialFingerprints":{"codehealthFindingId/v1":"614f804e98d24c1a96d18e46f95ea069a59ce688b68ef88671fa16cddac24919"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:774-787 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4359-4373 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":774}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fdb0aebb2b0caf4fe5bc5ecff60ffd7f108d460478dd17c5140acf20f76490e"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (14 corresponding lines): skills/ppt-master/scripts/pptx_shapes/loader.py:180-193 | skills/ppt-master/scripts/pptx_shapes/loader.py:231-245 \u2014 These two members are one piece of code written twice and then edited apart: 14 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/loader.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2bfa991b59d65585d3ae03e87eb16c730d9cc6af16df5c7dff308fb14772e84"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): skills/ppt-master/scripts/authoring_roundtrip.py:202-208 | skills/ppt-master/scripts/mirror_template_materialize.py:593-600 | skills/ppt-master/scripts/svg_authoring_view.py:1928-1937 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":202}}}],"partialFingerprints":{"codehealthFindingId/v1":"08eac809f940bdbc95ef7b9849b8fdfafc16ff88b1b76047ca66b49e96a58389"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:94-99 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py:117-121 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_patch.py"},"region":{"startLine":94}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e0455e239bbab27eadf9d5a571fab74e69de36921f3c17e837b210049fd853f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/ppt-master/scripts/narration_sync.py:217-222 | skills/ppt-master/scripts/tts_backends/backend_edge.py:404-408 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":217}}}],"partialFingerprints":{"codehealthFindingId/v1":"6be7fee2ddcdfc6b0915dc0c58cb1c97b81b6322b6849c7412c50214c320da4f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (6 members, 9\u002B corresponding lines): skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py:23-31 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula.py:71-83 | skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:232-240 | skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py:118-126 | skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py:51-61 | skills/ppt-master/scripts/tts_backends/backend_minimax.py:50-58 \u2014 These 6 members are one piece of code written 6 times and then edited apart: every two of them correspond over at least 9 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 6 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":23}}}],"partialFingerprints":{"codehealthFindingId/v1":"d123e795d2633d0621bf770a0c8ab3bbece88b919513b328fdbebfe66efcdc16"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/geometry_properties.py:133-140 | skills/ppt-master/scripts/svg_to_pptx/use_expander.py:468-475 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/geometry_properties.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f6063cb627503f1625c2142103c4ef78e15ad56c20ddad5f7b81ec623892971"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4894-4902 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4906-4914 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4894}}}],"partialFingerprints":{"codehealthFindingId/v1":"417c33e93f54beb7c7ab22fd6dc7504e9110fbe94627d644542e0a5c7b0cb92b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (13 corresponding lines): skills/ppt-master/scripts/extract_svg_pictures.py:500-512 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:2697-2710 \u2014 These two members are one piece of code written twice and then edited apart: 13 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_pictures.py"},"region":{"startLine":500}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2338c6825692fb284c6d91fa9e41aab82154b107db6d01558fb282cd27735f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/ppt-master/scripts/source_to_md/ppt_to_md.py:133-137 | skills/ppt-master/scripts/source_to_md/ppt_to_md.py:173-177 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":133}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7718442cd19bf1f49c06173bee92b3a0537e340d1daf615350db7a03bc8203a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): skills/ppt-master/scripts/image_search.py:1255-1267 | skills/ppt-master/scripts/image_treat.py:188-199 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ec781f4d7505930fa80cd00c0c7ee544811093987f0324664dbca0ccfe52c5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/ppt-master/scripts/mirror_template_materialize.py:1430-1437 | skills/ppt-master/scripts/svg_authoring_contract.py:91-100 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1430}}}],"partialFingerprints":{"codehealthFindingId/v1":"f07566616c53a9e8f574120dcb711d78074d26502f1b5a662e98462f88bcc2fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/ppt-master/scripts/register_template.py:453-462 | skills/ppt-master/scripts/visualization_recall.py:305-314 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":453}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35a87853c5447a62f348dcc4bcba3a3438b214931c974f2c449bf14663cb131"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:31-44 | skills/ppt-master/scripts/pptx_workspace.py:479-483 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py"},"region":{"startLine":31}}}],"partialFingerprints":{"codehealthFindingId/v1":"8858b9c171b2ed95fc02a5f0738edfc4363bf0521ce69f75295b5d92f4b5077d"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (12 corresponding lines): skills/ppt-master/scripts/svg_authoring_view.py:1960-1971 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1388-1399 \u2014 These two members are one piece of code written twice and then edited apart: 12 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":1960}}}],"partialFingerprints":{"codehealthFindingId/v1":"f8cc301ffc1ef1bc8bb713bf0081c951d67c02b311f9aa2619b35ce7dc1859c3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/ppt-master/scripts/video_sound_mix.py:1057-1066 | skills/ppt-master/scripts/tts_backends/backend_common.py:65-72 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":1057}}}],"partialFingerprints":{"codehealthFindingId/v1":"41db9010d7800ee5d3eb4f5daab306faa9744bd0b6ba57606a1b6826688f15a0"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/custgeom_to_svg.py:159-165 | skills/ppt-master/scripts/pptx_shapes/loader.py:345-350 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/custgeom_to_svg.py"},"region":{"startLine":159}}}],"partialFingerprints":{"codehealthFindingId/v1":"e0493345317c716502593df95f95fdb34a16c8c1f90ef8781ae7e06184e13bc7"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:1219-1229 | skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:635-642 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1219}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12ac7973fb02d5e1c3f5bf01e582c3d425cd33ad057947df548cb6d46ce4d4a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/ppt-master/scripts/svg_finalize/align_embed_images.py:116-120 | skills/ppt-master/scripts/svg_finalize/flatten_tspan.py:77-84 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":116}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e28508cfd13d032c7940114663301213d853181acf6e97c8891f0ddd797ce58"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 13\u002B corresponding lines): skills/ppt-master/scripts/compact_svg_coordinates.py:255-275 | skills/ppt-master/scripts/compact_svg_styles.py:587-599 | skills/ppt-master/scripts/stamp_native_fallbacks.py:279-298 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 13 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_coordinates.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ae821592418bb3ded665bda43f9e418748a87f3127dc37c763f07780ec73448"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/ppt-master/scripts/extract_svg_assets.py:164-169 | skills/ppt-master/scripts/mirror_template_materialize.py:853-858 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"028e41b3b42c2ac3766952c3349bc195794fd5629caaedbfa614d963c75a23b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (10 corresponding lines): skills/ppt-master/scripts/source_to_md/doc_to_md.py:174-183 | skills/ppt-master/scripts/source_to_md/ppt_to_md.py:1104-1113 \u2014 These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f2cade99f4435807fa2261ad7c858085d18da1a4ffe095ac2a99e52046c9e9a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/ppt-master/scripts/compact_svg_coordinates.py:228-230 | skills/ppt-master/scripts/compact_svg_styles.py:499-504 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_coordinates.py"},"region":{"startLine":228}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3fa5d2affe88ed2e94dc2a32e99085b4a486df1f03bd7d81172aba267c57a3"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (9 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3408-3416 | skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py:65-74 \u2014 These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3408}}}],"partialFingerprints":{"codehealthFindingId/v1":"754a07215d12805460ff8f6ab161189fccd37d03f59d401e37fd49f25fda9812"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/tspan_flattener.py:35-40 | skills/ppt-master/scripts/svg_to_pptx/use_expander.py:479-484 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/tspan_flattener.py"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"21ee3d17a259618fb667225f4a53adc2d807bc6f12ec884c2fa58e8d5c564bbc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/ppt-master/scripts/attribution_guard.py:58-63 | skills/ppt-master/scripts/console_encoding.py:23-27 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/attribution_guard.py"},"region":{"startLine":58}}}],"partialFingerprints":{"codehealthFindingId/v1":"d9d621c2faf91ff4c08ef7c16329f1618a6521b1cf299e2c4667e1397d96ecd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): skills/ppt-master/scripts/pptx_shapes/loader.py:354-360 | skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py:607-615 | skills/ppt-master/scripts/pptx_to_svg/ooxml_loader.py:150-158 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/loader.py"},"region":{"startLine":354}}}],"partialFingerprints":{"codehealthFindingId/v1":"922f6bd821be2ccd5d2160fbf97cc459037f8a6292e549beb8dd2ad596211d2b"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (8 corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:3605-3613 | skills/ppt-master/scripts/svg_to_pptx/text_outline.py:1092-1099 \u2014 These two members are one piece of code written twice and then edited apart: 8 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":3605}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12fcecc0176d78c7a8cc68bb6e3670e1f8950c10c2cc02ff3735b9bdd862f25"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (5 corresponding lines): skills/ppt-master/scripts/tts_backends/backend_edge.py:165-169 | skills/ppt-master/scripts/video_subtitles.py:117-122 \u2014 These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_edge.py"},"region":{"startLine":165}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf350426eef67623980497d191a003cffc7911c9fc1b155d9df5e2f01c3f4bdc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (6 corresponding lines): skills/ppt-master/scripts/register_template.py:466-471 | skills/ppt-master/scripts/svg_finalize/embed_icons.py:344-350 \u2014 These two members are one piece of code written twice and then edited apart: 6 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":466}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b617a0cd9a779e9905418b20ff13b49d91f831a46b86d5e49dd4c7017ac8b6"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (4 members, 3\u002B corresponding lines): skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:170-172 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:914-916 | skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:1353-1355 | skills/ppt-master/scripts/svg_to_pptx/text_outline.py:1119-1121 \u2014 These 4 members are one piece of code written 4 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 4 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":170}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c0e0453ce8d9d01f301ad9f26063355cb14ded4d183143bc0df04b77b333a6a"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/ppt-master/scripts/confirm_ui/server.py:874-876 | skills/ppt-master/scripts/svg_editor/server.py:131-133 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":874}}}],"partialFingerprints":{"codehealthFindingId/v1":"1a5a1590d91a1b90ff4722fff655a253ef92a7b2e624d24c37a49f37f40025d2"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 7\u002B corresponding lines): skills/ppt-master/scripts/image_backends/backend_minimax.py:108-120 | skills/ppt-master/scripts/image_backends/backend_qwen.py:105-111 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:102-108 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 7 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_minimax.py"},"region":{"startLine":108}}}],"partialFingerprints":{"codehealthFindingId/v1":"40087f062de4783a5f7d6ee31d7ecbb8e0934e08b269ac0730cc1ff7e5f8f54f"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): skills/ppt-master/scripts/pptx_animations.py:1344-1346 | skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py:258-261 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:471-475 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1344}}}],"partialFingerprints":{"codehealthFindingId/v1":"f339b9315bb06d5277def3d764dbf92f8bc181a5899bcef19dc801a6a87995fc"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copies of one member (3 members, 3\u002B corresponding lines): skills/ppt-master/scripts/pptx_ooxml/ooxml.py:96-98 | skills/ppt-master/scripts/pptx_transitions.py:2457-2459 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py:345-347 \u2014 These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 3 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members\u0027 grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/ooxml.py"},"region":{"startLine":96}}}],"partialFingerprints":{"codehealthFindingId/v1":"c69b1edf43cfe2a73ab844251f48e4f4a9c0f594abbd179a5772b8201975cd90"}},{"ruleId":"D4","level":"warning","message":{"text":"Edited copy of a member (3 corresponding lines): skills/ppt-master/scripts/pptx_to_svg/preset_svg_markup.py:171-175 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2692-2694 \u2014 These two members are one piece of code written twice and then edited apart: 3 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below \u2014 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\u0027 grain \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_svg_markup.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"d5af3186716ca50146f1d6524ec294764a2e4a933f90800ad38d396fd0fd86cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (60 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3924-3983 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4025-4084 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":3924}}}],"partialFingerprints":{"codehealthFindingId/v1":"968a4209641c4da1312189c5a62acd49f104ffcb3555da24fce9e3b8110e287c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37 lines \u00D7 2): skills/ppt-master/scripts/image_sources/provider_pexels.py:104-140 | skills/ppt-master/scripts/image_sources/provider_pixabay.py:108-144 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_pexels.py"},"region":{"startLine":104}}}],"partialFingerprints":{"codehealthFindingId/v1":"eeea1adf54f183f066b975b180e31926aa674f111bbb45cd6bdd10a90f9ae844"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (37\u201338 lines \u00D7 2): skills/ppt-master/scripts/image_backends/backend_openai.py:643-679 | skills/ppt-master/scripts/image_backends/backend_openai.py:753-790 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":643}}}],"partialFingerprints":{"codehealthFindingId/v1":"5f084ef99b6d296dc6f336013c1e6204839456a7cf628b29fcf2fba016b3576d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (35 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:2242-2276 | skills/ppt-master/scripts/svg_quality/checker.py:2294-2328 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2242}}}],"partialFingerprints":{"codehealthFindingId/v1":"bc745e5435337be03c13220fde91199f4eecf31e304863db1e60b66474b7599c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (31 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7506-7536 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7655-7685 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":7506}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac68f85056426472cd3f0a7052dd2f85e89d89faea5f9bbe9b77b6c6f47ae2ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): skills/ppt-master/scripts/finalize_svg.py:145-173 | skills/ppt-master/scripts/pptx_to_svg/converter.py:1311-1339 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/finalize_svg.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"ce96270aeb4cddb5bdfdd4b7ec5af70c4d43155695d1fd142d8f6f634789eb37"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (29 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1605-1633 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5178-5206 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1605\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1605}}}],"partialFingerprints":{"codehealthFindingId/v1":"2870b4abd71d35c36380c13a567b0bc886f700e6d4e5fc7733ceaebf4166c8ef"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201328 lines \u00D7 2): skills/ppt-master/scripts/pptx_transitions.py:3107-3128 | skills/ppt-master/scripts/pptx_transitions.py:3135-3162 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_transitions.py"},"region":{"startLine":3107}}}],"partialFingerprints":{"codehealthFindingId/v1":"cec0f6850c279508fe9df15d3d4cd5d41d53bb47deaaeab10bd7b3b55a99b495"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (27 lines \u00D7 2): skills/ppt-master/scripts/narration_sync.py:226-252 | skills/ppt-master/scripts/video_subtitles.py:70-96 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":226}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b9db526d788d768c18dc8f2aa5fc56a78c606cf0422249cfc0d3f662fc6350d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201327 lines \u00D7 2): skills/ppt-master/scripts/pptx_animations.py:2817-2834 | skills/ppt-master/scripts/pptx_animations.py:2842-2868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_animations.py:2817\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2817}}}],"partialFingerprints":{"codehealthFindingId/v1":"2f9492f0fb2636b5303178c6e3f6fc7f632d1c73ab2f25544e29d31bbd188220"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (26 lines \u00D7 12): skills/ppt-master/scripts/image_backends/backend_bfl.py:196-221 | skills/ppt-master/scripts/image_backends/backend_fal.py:162-187 | skills/ppt-master/scripts/image_backends/backend_ideogram.py:166-191 | skills/ppt-master/scripts/image_backends/backend_minimax.py:240-265 | skills/ppt-master/scripts/image_backends/backend_modelscope.py:170-195 | skills/ppt-master/scripts/image_backends/backend_qwen.py:213-238 | skills/ppt-master/scripts/image_backends/backend_replicate.py:185-210 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:164-189 | skills/ppt-master/scripts/image_backends/backend_stability.py:157-182 | skills/ppt-master/scripts/image_backends/backend_tencent.py:219-244 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:239-264 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:187-212 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_fal.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_ideogram.py\u0060 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 \u2014 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 \u0060image_size\u0060 to \u0060str = \u00221K\u0022\u0060 in one and \u0060str = DEFAULT_IMAGE_SIZE\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/image_backends/backend_bfl.py:194\u0060 calls \u0060get\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_stability.py:155\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_bfl.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"32d24674ffd2c6031b16b43fae41742c3c09897b656bd2618a6541d66135c1fa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201326 lines \u00D7 5): skills/ppt-master/scripts/image_backends/backend_minimax.py:174-192 | skills/ppt-master/scripts/image_backends/backend_qwen.py:149-174 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:109-123 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:171-187 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:134-149 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_minimax.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_qwen.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/image_backends/backend_qwen.py:148\u0060 calls \u0060note_aspect_ratio\u0060, \u0060replace\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_siliconflow.py:108\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_minimax.py"},"region":{"startLine":174}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ded2cd41f2cba0a4e51a25cddcb65568a0cdc42f60efd94f57ef54a0a8663fd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201325 lines \u00D7 6): skills/ppt-master/scripts/image_backends/backend_fal.py:113-127 | skills/ppt-master/scripts/image_backends/backend_modelscope.py:119-133 | skills/ppt-master/scripts/image_backends/backend_qwen.py:154-178 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:114-127 | skills/ppt-master/scripts/image_backends/backend_stability.py:104-120 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:140-153 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_fal.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_modelscope.py\u0060 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/ppt-master/scripts/image_backends/backend_stability.py:104\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 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 \u0060model\u0060 to \u0060str = DEFAULT_MODEL\u0060 in one and \u0060str = None\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":113}}}],"partialFingerprints":{"codehealthFindingId/v1":"c4ccb7309f236f0466f27e315056b48e48bd2a047720a51e64398a5f4412b9f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201324 lines \u00D7 2): skills/ppt-master/scripts/confirm_ui/server.py:2756-2774 | skills/ppt-master/scripts/svg_editor/server.py:1467-1490 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060skills/ppt-master/scripts/confirm_ui/server.py:2756\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2756}}}],"partialFingerprints":{"codehealthFindingId/v1":"7c8f0021d93d82cd83f13618aabfde39d96b205ffdb182ac84e9f475a803c374"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23\u201324 lines \u00D7 2): skills/ppt-master/scripts/extract_svg_assets.py:889-911 | skills/ppt-master/scripts/extract_svg_assets.py:935-958 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":889}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa7bd78e5fc3ccec43450759f4fe8230e87a3a61fb87fb9fc1bfe0e8ee9774b8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201324 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7576-7599 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7613-7634 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":7576}}}],"partialFingerprints":{"codehealthFindingId/v1":"23d52ae6a86fe031522e3e01ac107cb8393f3cdbcbb32ecf0d95119e3c83e8d1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (22\u201323 lines \u00D7 2): skills/ppt-master/scripts/image_backends/backend_openai.py:689-711 | skills/ppt-master/scripts/image_backends/backend_openai.py:800-821 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/image_backends/backend_openai.py:689\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":689}}}],"partialFingerprints":{"codehealthFindingId/v1":"a21556fc12ce6f99e4f571e863822cff60666164b2a421603e3dd04c18775118"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (23 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1909-1931 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1985-2007 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1907\u0060 calls \u0060PathCommand\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1983\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1909}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b17eb461f81a3cb7e9bf82a435d33a38772272e7fa54382dfa5d27400da49aa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201322 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:146-161 | skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py:293-314 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":146}}}],"partialFingerprints":{"codehealthFindingId/v1":"c14c72f93d883073d29726848cf22648f3aef2a59ddff5244a950ba26299db50"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21\u201322 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3020-3040 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4665-4686 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3020\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3020}}}],"partialFingerprints":{"codehealthFindingId/v1":"97f25992190ec15065efadef1372344bf0e97206cb98415e839a0a428907d997"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (21 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/converter.py:602-622 | skills/ppt-master/scripts/pptx_to_svg/converter.py:635-655 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/converter.py:602\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/pptx_to_svg/converter.py:634\u0060 calls \u0060iter_slides\u0060 and \u0060skills/ppt-master/scripts/pptx_to_svg/converter.py:601\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"4dccc12f2d33c0a4fe03913f4405640e888f921dc5ab623a5cdb43cb6943e4d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19\u201320 lines \u00D7 2): skills/ppt-master/scripts/confirm_ui/server.py:2192-2210 | skills/ppt-master/scripts/svg_editor/server.py:1324-1343 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060skills/ppt-master/scripts/confirm_ui/server.py:2192\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2192}}}],"partialFingerprints":{"codehealthFindingId/v1":"e6776ec4c71f817f62f30e97e368be458df0971de9484f8f719e7a2aa795b3bc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (20 lines \u00D7 2): skills/ppt-master/scripts/image_backends/backend_gemini.py:331-350 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:210-229 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060skills/ppt-master/scripts/image_backends/backend_gemini.py:331\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":331}}}],"partialFingerprints":{"codehealthFindingId/v1":"c769b005388153c655c48e0d32639d96d3d41a973ec5f564e8b1ab3a9414cf1b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): skills/ppt-master/scripts/pptx_animations.py:666-683 | skills/ppt-master/scripts/pptx_transitions.py:1085-1104 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060skills/ppt-master/scripts/pptx_animations.py:666\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":666}}}],"partialFingerprints":{"codehealthFindingId/v1":"627a2600206170a3ce3e2c61cd2b9ceaa98dae8c328fc8ac27fc65b2de3b0211"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201320 lines \u00D7 2): skills/ppt-master/scripts/svg_editor/server.py:984-1003 | skills/ppt-master/scripts/svg_editor/server.py:1110-1124 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":984}}}],"partialFingerprints":{"codehealthFindingId/v1":"f329a72d871a45c530bddfc8c803910d918572027e2eb275939fd7f08b5ce3d3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201320 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:7573-7592 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:8134-8151 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":7573}}}],"partialFingerprints":{"codehealthFindingId/v1":"dd326ef029dfd218e7bf06925e8e0a0e35eb22e65222059b6740aa856b275dca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 3): skills/ppt-master/scripts/image_backends/backend_openai.py:669-687 | skills/ppt-master/scripts/image_backends/backend_openai.py:781-798 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:124-142 \u2014 there are 3 copies across 2 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 3 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":669}}}],"partialFingerprints":{"codehealthFindingId/v1":"714980fb6bf7b7b8f1afc907b8d29b8c455fabf8e9738421d43dd3a7d6a41bf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201319 lines \u00D7 3): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1826-1844 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1909-1925 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1985-2001 \u2014 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 \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1907\u0060 calls \u0060PathCommand\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1983\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad4459796885a3e9d785642759d0206e0eb2891a4c614fe59ed4c95727b191e0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/ppt-master/scripts/authoring_roundtrip.py:819-837 | skills/ppt-master/scripts/authoring_roundtrip.py:881-899 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/authoring_roundtrip.py:817\u0060 calls \u0060isinstance\u0060, \u0060AuthoringRoundtripError\u0060 and \u0060skills/ppt-master/scripts/authoring_roundtrip.py:880\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":819}}}],"partialFingerprints":{"codehealthFindingId/v1":"7bdab9006abb152411b79ad5c54ad7d67e423c8ba65d3c48f6a63419f7910cad"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18\u201319 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:261-279 | skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:451-468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:261\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":261}}}],"partialFingerprints":{"codehealthFindingId/v1":"7320c6232e8125a2b9778455f381e4b0e6e89cebc1fc26420a2a52a5b6469a93"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:553-571 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:1732-1750 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:553\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":553}}}],"partialFingerprints":{"codehealthFindingId/v1":"8bc5a380c9a24f19e964c8a3b9d684f7c5e44a00e28da4612de4954adcac2101"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:968-986 | skills/ppt-master/scripts/svg_quality/checker.py:991-1009 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"dae48fc3b6c89336b14643b1a279a9b1916dbc70dfd50186858cbc0399be24bb"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_parser.py"},"region":{"startLine":1217}}}],"partialFingerprints":{"codehealthFindingId/v1":"a788890c7f6c9fc7e29b2793c189ee808bfe08d407e40d273e5160b5c9661724"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): skills/ppt-master/scripts/confirm_ui/server.py:2805-2822 | skills/ppt-master/scripts/svg_editor/server.py:1504-1521 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2805}}}],"partialFingerprints":{"codehealthFindingId/v1":"ec9eda4dcd12975fb38c7c05abb836fa8720f00eb67b45e3b98aa3a2169eedf8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17\u201318 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:321-338 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:437-453 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":321}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cd29a3d9ba76a5bf3c98aea7d6c50d88d58a864c72fa50d086ab3acfb3d852c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (18 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1370-1387 | skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1445-1462 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1370}}}],"partialFingerprints":{"codehealthFindingId/v1":"e067d9c860ab8cddc60a52b3b55e700cf62d72eb4661ce58f8ec56cdf92122db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (19 lines \u00D7 2): skills/ppt-master/scripts/batch_validate.py:236-254 | skills/ppt-master/scripts/svg_quality/checker.py:10115-10133 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/batch_validate.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"b87b534af130c7e2b629a769f17b7cc1ff038bc39c0aba008729a46ba54221cf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16\u201317 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:699-715 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:718-733 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:699\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":699}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c3c25198ab629d00611bf3b54ce62cd64495a2d138055b1ba5b765b6844771c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201317 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:4573-4589 | skills/ppt-master/scripts/svg_quality/checker.py:7128-7142 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4573}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b1e407e2a18ca564aed050e298bfa55f0aae514d3e0d87e17ee1f30cda8fe6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (17 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1374-1390 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1621-1637 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1374\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"e367a509ef2034b338f88d5fb86b9e41e13c566ef930368c0bf742141c8ef6ba"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/ppt-master/scripts/confirm_ui/server.py:2327-2342 | skills/ppt-master/scripts/svg_editor/server.py:650-665 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2327}}}],"partialFingerprints":{"codehealthFindingId/v1":"c8e46f6c767ab4fe588bff481f1f98b3758f2d19cab8b46451b60d0950ac0c42"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/ppt-master/scripts/image_gen.py:857-872 | skills/ppt-master/scripts/project_management/cli.py:202-217 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060skills/ppt-master/scripts/image_gen.py:857\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":857}}}],"partialFingerprints":{"codehealthFindingId/v1":"19f16bc6afc75ff28f10af021036dabfa3cd3fd3491a9a7e1990362da21f653b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/ppt-master/scripts/mirror_template_materialize.py:1376-1391 | skills/ppt-master/scripts/svg_authoring_view.py:398-413 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e958dcee1a41dfe3d634b5c4ba1bf75d2e931d6f06032a62955eb285555236f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/ppt-master/scripts/narration_sync.py:254-269 | skills/ppt-master/scripts/video_subtitles.py:98-113 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":254}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c359356a29933770ee75c2dfa688ae3c84cc988246cb3a05f18ba5f5a89e029"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15\u201316 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/converter.py:1495-1510 | skills/ppt-master/scripts/pptx_to_svg/converter.py:1511-1525 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/converter.py:1495\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1495}}}],"partialFingerprints":{"codehealthFindingId/v1":"87c019f4e55ee926ff2bc21983ab9b7ce11d09bfa910575ddb2b2fdfb7491b01"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:475-490 | skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:606-621 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:474\u0060 calls \u0060_validate_adjustments\u0060 and \u0060skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:605\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":475}}}],"partialFingerprints":{"codehealthFindingId/v1":"ba9938e3ef121e39e9ff433bd3c611e1fa32dca692783cb6d9a28012087c6c3a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:745-760 | skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py:767-782 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":745}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f94258a8ea0791d2dc90e47eadcc80213c66abaa55c1ee998963ec5bf7e4d97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:726\u0060 calls \u0060_style_attr\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py:581\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":565}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7aa79ef7ed2db7c00051bccd478016dea06dd11fa063a3095e284b7c0d79692"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 4): skills/ppt-master/scripts/project_management/cli.py:1100-1114 | skills/ppt-master/scripts/project_management/cli.py:1129-1143 | skills/ppt-master/scripts/project_management/cli.py:1151-1165 | skills/ppt-master/scripts/project_management/cli.py:1182-1196 \u2014 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":1100}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d93d4aa97be238f251cd2a54ada921e72a86861695fb2c79f10b74bba9f395b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 3): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3968-3982 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4069-4083 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5561-5574 \u2014 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 \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:3968\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":3968}}}],"partialFingerprints":{"codehealthFindingId/v1":"3346f13eb3697171eaf00b4e337968d2cf01bc2b1a3f1ecc26054e464d2037d8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): skills/ppt-master/scripts/image_backends/backend_qwen.py:118-132 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:104-118 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_qwen.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_zhipu.py\u0060 as WHOLE FILES: this scan already matched 9 separate duplicated blocks between them, totalling at least 151 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. 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 \u2014 extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/ppt-master/scripts/image_backends/backend_qwen.py:118\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_qwen.py"},"region":{"startLine":118}}}],"partialFingerprints":{"codehealthFindingId/v1":"7369c258b9749208249f02114538a116e664e3e415a2b74b0e37ca861c94eda5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201315 lines \u00D7 2): skills/ppt-master/scripts/pptx_animations.py:2297-2309 | skills/ppt-master/scripts/pptx_animations.py:2326-2340 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":2297}}}],"partialFingerprints":{"codehealthFindingId/v1":"30a5541e464743c703f61eadc4751fc3fa041c3e3bd6647669cf86165d90049c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2611}}}],"partialFingerprints":{"codehealthFindingId/v1":"1088e2f9da8933ea02ee6ec0bf20786bf51b046e116d88bf83ce9ae134d16746"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2428-2442 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2472-2485 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":2428}}}],"partialFingerprints":{"codehealthFindingId/v1":"94e8cc23781366b9344665247057ea08875ed6a51834503b17b4f3bc3ab219f2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14\u201315 lines \u00D7 2): skills/ppt-master/scripts/source_to_md/doc_to_md.py:836-850 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:924-937 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":836}}}],"partialFingerprints":{"codehealthFindingId/v1":"4753f1e7685093a5bcd6f21f4c0c31485dd57c2492ddacecfeca8468aff998db"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:8365-8379 | skills/ppt-master/scripts/svg_quality/checker.py:8402-8416 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":8365}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1437ad626486b29862e81d08e7743ccaef14609efcfa3ff6e5565e3828a05d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1660-1674 | skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py:1893-1907 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1660}}}],"partialFingerprints":{"codehealthFindingId/v1":"fb308b6b3cbe4f79f277f1b04a936eedb4e2c438ee124e785cdd1687382ced0b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (16 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py:705-720 | skills/ppt-master/scripts/svg_to_pptx/native_objects/chartex.py:21-36 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":705}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ff8c7ea43b7affd6625614fdb2856a85b20a804a3cd59902684b788c6e93fa7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":164}}}],"partialFingerprints":{"codehealthFindingId/v1":"55b79c3cfe8f56d8818097aa4cf800904fa146486750ca54284930c1192e8d63"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1485-1499 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:1531-1545 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":1485}}}],"partialFingerprints":{"codehealthFindingId/v1":"9a84692f2a7c2cc01aef5f0e6807f721f0c29ff7f51bef0a98430ce58d098271"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (15 lines \u00D7 2): skills/ppt-master/scripts/tts_backends/backend_common.py:178-192 | skills/ppt-master/scripts/tts_backends/backend_edge.py:510-524 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_common.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"654dec186db6485d65faa3f1726264aa93019027fdf9a49b44e88000a45b8d2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 7): skills/ppt-master/scripts/image_backends/backend_fal.py:109-123 | skills/ppt-master/scripts/image_backends/backend_minimax.py:176-192 | skills/ppt-master/scripts/image_backends/backend_modelscope.py:115-129 | skills/ppt-master/scripts/image_backends/backend_qwen.py:150-174 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:110-123 | skills/ppt-master/scripts/image_backends/backend_stability.py:100-113 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:135-149 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_fal.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_minimax.py\u0060 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 \u2014 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 \u0060model\u0060 to \u0060str = DEFAULT_MODEL\u0060 in one and \u0060str = None\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/image_backends/backend_qwen.py:148\u0060 calls \u0060note_aspect_ratio\u0060, \u0060replace\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_siliconflow.py:108\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":109}}}],"partialFingerprints":{"codehealthFindingId/v1":"aa40a50f82b337b88b24ac48290d7748456917b02b299ceebd6c963b46a6df75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 5): skills/ppt-master/scripts/image_backends/backend_fal.py:129-142 | skills/ppt-master/scripts/image_backends/backend_ideogram.py:134-147 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:129-142 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:197-210 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:155-168 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_fal.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_ideogram.py\u0060 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 \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"b3003cdbe23bfe150cf996221142dce500446d2050e7b0800585fc4c6e464cce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201314 lines \u00D7 2): skills/ppt-master/scripts/prompt_audit.py:1519-1532 | skills/ppt-master/scripts/prompt_audit.py:1535-1546 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/prompt_audit.py:1519\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1519}}}],"partialFingerprints":{"codehealthFindingId/v1":"c7df85c76a7bfad7be547e8e4a312bf4400f26001fadd147e36a4c66569cd0e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/ppt-master/scripts/register_template.py:830-843 | skills/ppt-master/scripts/register_template.py:957-970 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":830}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e14398b3ac9d1fce59ed84c7718de550e9c9b90b219235140a6d2e7470a4139"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1346-1359 | skills/ppt-master/scripts/source_to_md/pdf_to_md.py:1363-1376 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1346}}}],"partialFingerprints":{"codehealthFindingId/v1":"37b85d1537379de6f6df2c993dad4dff0a8d26f0313e4b3d0ecc906d9bec3e2c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:3700-3713 | skills/ppt-master/scripts/svg_quality/checker.py:3772-3784 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_quality/checker.py:3700\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3700}}}],"partialFingerprints":{"codehealthFindingId/v1":"b8ab41256cae9f268922a4e05af3b4bb47db2fe3479474ddfd7a5ee1c05e27f1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13\u201314 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3057-3070 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4708-4720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060slide_num\u0060 to \u0060layout_shape) promoted_roles \u002B= 1 for\u0060 in one and \u0060master_shape) promoted_roles \u002B= 1 for\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3057}}}],"partialFingerprints":{"codehealthFindingId/v1":"23854f2be3c26b035eb1771e7df5befd7b755664531606315323696b8db2a34c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 3): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1374-1386 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1621-1633 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5194-5206 \u2014 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 \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1374\u0060 it runs out through the closing brace of the declaration holding it and carries on into the declaration that follows \u2014 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\u0027 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 \u2014 a one-line delegation has no helper inside it to lift \u2014 so generate the run from the set it enumerates, or accept it and keep each member\u0027s 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1374}}}],"partialFingerprints":{"codehealthFindingId/v1":"53e6cb9420495d14438c29e5ad1d96ddd791ad8acdc5600c9e9061b3f3d5377f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201313 lines \u00D7 2): skills/ppt-master/scripts/confirm_ui/server.py:2362-2372 | skills/ppt-master/scripts/svg_editor/server.py:690-702 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2362}}}],"partialFingerprints":{"codehealthFindingId/v1":"b149511c43a42716a2f33f2e25b4f63e6bf2072da4a1a2bcdd624a514c1b3065"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/ppt-master/scripts/pptx_animations.py:1392-1404 | skills/ppt-master/scripts/pptx_animations.py:1416-1428 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"a99bf3a46720005afc823d93031450a8d7ba5c087c6fbfd6f8f63b5d2e4b4203"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:996\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":996}}}],"partialFingerprints":{"codehealthFindingId/v1":"007e947cdcca2a3aa5f6eac6be20ccf3c7bb853c94c47393551cca3db81e0109"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12\u201313 lines \u00D7 2): skills/ppt-master/scripts/source_to_md.py:567-578 | skills/ppt-master/scripts/source_to_md/_batch.py:165-177 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md.py"},"region":{"startLine":567}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f5ca4e8371d4a8cb8992eaed0f2a001363444d185e3b08bed59c626cff57dd2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201313 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"31d5ae68066991ec77c168af159ff34c90c88a1b8d0a5901984042bd964e5c7d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (13 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2929-2941 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4551-4563 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":2929}}}],"partialFingerprints":{"codehealthFindingId/v1":"693cedabfced4df1afb8fc9c8665397a0455cf59ca6b6d1ef926eabc8c3a7b1d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 3): skills/ppt-master/scripts/image_backends/backend_minimax.py:124-135 | skills/ppt-master/scripts/image_backends/backend_qwen.py:115-126 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:101-112 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_minimax.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_qwen.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/image_backends/backend_qwen.py:109\u0060 calls \u0060endswith\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_zhipu.py:96\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_minimax.py"},"region":{"startLine":124}}}],"partialFingerprints":{"codehealthFindingId/v1":"8cb547971e8156b9d51e2962f66899cfc70edb71edd9de871d9f632f6c49a399"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/ppt-master/scripts/image_backends/backend_fal.py:68-79 | skills/ppt-master/scripts/image_backends/backend_replicate.py:69-80 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_fal.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_replicate.py\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":68}}}],"partialFingerprints":{"codehealthFindingId/v1":"5cdd491c8aa787181dd4fc3ccffeda9d96585ff200fc8b84a337743d95adb6ee"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/ppt-master/scripts/image_gen.py:1376-1387 | skills/ppt-master/scripts/image_gen.py:1394-1405 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":1376}}}],"partialFingerprints":{"codehealthFindingId/v1":"040e48596133eb35a87986075288cead8a5f20ab608d7e2eca5e1b0ba34d3b16"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/ppt-master/scripts/image_search.py:1426-1437 | skills/ppt-master/scripts/pptx_intake.py:58-69 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060skills/ppt-master/scripts/image_search.py:1426\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u0060payload\u0060 to \u0060dict\u0060 in one and \u0060dict[str, Any]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":1426}}}],"partialFingerprints":{"codehealthFindingId/v1":"f9c09d5aeb4147c29ab821a00217b57639d05cb9eb2dbc01571cb8cd6f637683"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"f23ad7e539d216266cd230d9ead27188f7ebefa764a936602589f4813b1f1622"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/converter.py:1638-1649 | skills/ppt-master/scripts/pptx_to_svg/converter.py:1650-1661 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1638}}}],"partialFingerprints":{"codehealthFindingId/v1":"cca180d82e911fdba28d6fa76afd77af9f8b868387a7bd93569828e577ab75e2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11\u201312 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:285-296 | skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:469-479 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:285\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:468\u0060 calls \u0060_parse_frame\u0060, \u0060get\u0060 and \u0060skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:285\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"7cc4002e8fc418c2eb5db341cf2dec35ae96fb5156f431d7c5390c3bc7165751"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/ppt-master/scripts/project_management/cli.py:691-702 | skills/ppt-master/scripts/project_management/cli.py:709-720 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ffcaf3497549dc73e860cbdc736f14240b39a27dfbe8e511f48788755fd26b4"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1317-1328 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1590-1601 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1317}}}],"partialFingerprints":{"codehealthFindingId/v1":"2748766ce807d1411454e154d16122ee2b74a77f9b95928fac466fd2f16191ca"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201312 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3483-3492 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4501-4512 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3481\u0060 calls \u0060write_text\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4500\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3483}}}],"partialFingerprints":{"codehealthFindingId/v1":"9393751d4536f1761ed744d5ff1f2b128311184d2b454e1420d6956d263d6a21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (12 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:892-903 | skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:925-936 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":892}}}],"partialFingerprints":{"codehealthFindingId/v1":"93fa788b352221a397c00161d2e474e7c1632664bc3afdbd3cbadd9398e5b548"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 4): skills/ppt-master/scripts/image_backends/backend_gemini.py:206-216 | skills/ppt-master/scripts/image_backends/backend_openai.py:675-685 | skills/ppt-master/scripts/image_backends/backend_openai.py:786-796 | skills/ppt-master/scripts/image_backends/backend_openrouter.py:130-140 \u2014 there are 4 copies across 3 file(s) \u2014 more copies than files, so at least one file holds the block twice. Extract it once into a single shared function every call site can reach and call it from all 4 sites; resolving a subset leaves the remainder to drift apart."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":206}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a34413542e21ac178bd9f424974463420b1de73953b04a1d6e0fe83f768416d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 3): 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 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from all 3 call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at \u0060skills/ppt-master/scripts/image_sources/provider_openverse.py:80\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_openverse.py"},"region":{"startLine":80}}}],"partialFingerprints":{"codehealthFindingId/v1":"47824754e83986ebed7dd60983360e8770991ba70dd7126bba1d291b833a3681"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/beautify_identity.py:289-299 | skills/ppt-master/scripts/beautify_inventory.py:441-451 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/beautify_identity.py"},"region":{"startLine":289}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a7e35701f800d4a58b20a554ed757e52eeaf1c1bc7ed6018e4f0ea5b5dd85b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/confirm_ui/server.py:2345-2355 | skills/ppt-master/scripts/svg_editor/server.py:668-680 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2345}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ba50640470afb6ac2871a33e5f934e81a35834cc69886cb39f8f78b9ece6325"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201311 lines \u00D7 2): skills/ppt-master/scripts/pptx_animations.py:707-715 | skills/ppt-master/scripts/pptx_transitions.py:1149-1159 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":707}}}],"partialFingerprints":{"codehealthFindingId/v1":"8ba235d69d09f324c7f7e07aa2a1c37a3d0e4819a27e127ea9267aa3163ac493"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:210-220 | skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:361-371 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py:210\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_authoring.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d428126d538019a7a4d829d615ef2b6cf05ff299a72f667380dcf73a279b1cc"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:449-459 | skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:483-493 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:460\u0060 calls \u0060parse_xfrm\u0060 and \u0060skills/ppt-master/scripts/pptx_to_svg/shape_walker.py:494\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":449}}}],"partialFingerprints":{"codehealthFindingId/v1":"692e3d8d841cca598d24bc827227048003ec860627696f93930b3a88791bb49c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/project_utils.py:279-291 | skills/ppt-master/scripts/project_utils.py:325-335 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d217eebaa37642f73ae2a8fbf7bfcb0329701ca128d3c4edd1a65bcd8105b15"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:562-572 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1643-1653 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf8d22b5e62f88779fc18fd036a6e73f7a33973c9151bd87e7ea0afba280aa75"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:3401-3410 | skills/ppt-master/scripts/svg_quality/checker.py:4542-4552 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3401}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f34cdbd985f07aa571aed6d18091505290e967e9e2839069dbb79bfe1e015f0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:930-940 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:1131-1141 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":930}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ec67a93dec4d62b71bbfb75ee36f68bc12c24e3e141967f2711625c36ddc4a8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2349-2359 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:2386-2396 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":2349}}}],"partialFingerprints":{"codehealthFindingId/v1":"fe3873f8240c502a5f8241a8b690791f405ee9856394d4b406aaf201adc9abe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:497-507 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:532-542 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":497}}}],"partialFingerprints":{"codehealthFindingId/v1":"d494b8a97beea2f13ae7f900e8ce97dd3d08957f988309fc46262f6bf0010e99"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10\u201311 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2955-2965 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:4565-4574 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:2955\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":2955}}}],"partialFingerprints":{"codehealthFindingId/v1":"23802795e624b31fad103006007a704421a25a8a6b18548b0c0599dff542e649"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1104\u0060 calls \u0060set\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:910\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":912}}}],"partialFingerprints":{"codehealthFindingId/v1":"d92afd7d552090524326fe7f7fae0723639f925fd00d65a70cd30af91dd517ff"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (11 lines \u00D7 2): skills/ppt-master/scripts/tts_backends/backend_edge.py:299-309 | skills/ppt-master/scripts/video_subtitles.py:186-196 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060skills/ppt-master/scripts/tts_backends/backend_edge.py:299\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_edge.py"},"region":{"startLine":299}}}],"partialFingerprints":{"codehealthFindingId/v1":"fc67bdf3d933731e99f32f60c2f53754ddcceace359d7bf59483e9bfb1b589e1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/color_resolver.py"},"region":{"startLine":593}}}],"partialFingerprints":{"codehealthFindingId/v1":"52aa999bcfbf4bbeedee5f0a9e08445d36e74e084f2cd12e39148c0779d1e105"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 3): 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 \u2014 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":445}}}],"partialFingerprints":{"codehealthFindingId/v1":"1b7dd2046cdd444924a63c4f7057c651509ee0f7889d25b06a91b4234b8614e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 3): 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 \u2014 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 \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:910\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:919\u0060 calls \u0060TemplateStructureError\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py:1065\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":910}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0bddd481b56e0faa4d845bf130f55a99e29063fc1e4701f95617306f78edbd1"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/ppt-master/scripts/mirror_template_materialize.py:3244-3253 | skills/ppt-master/scripts/mirror_template_materialize.py:3254-3263 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":3244}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb17bfadd5189f7e40cce53df7a91b2590f3127cdea1555de8d648d41f1b4df9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9\u201310 lines \u00D7 2): skills/ppt-master/scripts/pptx_animations.py:1604-1613 | skills/ppt-master/scripts/pptx_animations.py:1643-1651 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_animations.py:1604\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1604}}}],"partialFingerprints":{"codehealthFindingId/v1":"389ff7606961b8c4cdc4060ab43ab78500aa9137f022a8db76ea508f4937bd2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/ppt-master/scripts/pptx_intake.py:243-252 | skills/ppt-master/scripts/spec_review/store.py:67-76 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_intake.py"},"region":{"startLine":243}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bd0a89d77405c651bad87fe1c180ebf7ed21a9ccf41a2565e98f604b6a9db24"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8\u201310 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py:2839\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2760}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb3851fc11ab1ec490fe90281d100013513e854027b14552c928a85e2fd53ed9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): skills/ppt-master/scripts/source_to_md/doc_to_md.py:1272-1281 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:1491-1500 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1272}}}],"partialFingerprints":{"codehealthFindingId/v1":"64e78afe344e7f2e8fa6e7cf8a640c315a5c6eff0c9797d0b73c5185068bd218"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u201310 lines \u00D7 3): 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 \u2014 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 \u2014 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 \u0060skills/ppt-master/scripts/svg_quality/svg_contracts.py:384\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":384}}}],"partialFingerprints":{"codehealthFindingId/v1":"c53e4626230c081390b36e57ed93c1faf629269c074a328751abc2999d74ec97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (14 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:436-449 | skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py:450-463 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7e6d0f9f4d9ad94f585fbe589e119bdfafbffca8944d37488482b43e12e6e11"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":870}}}],"partialFingerprints":{"codehealthFindingId/v1":"03bece90b4bead5139ef9932aa0b52bf125a277289f76a28053d2602e1237a83"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (10 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1835}}}],"partialFingerprints":{"codehealthFindingId/v1":"95ef7ea438ddfb1f85f4e5b65397a31d5a76ff1bb636589283ac5a8e7cf0b47b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 7): skills/ppt-master/scripts/image_backends/backend_fal.py:127-135 | skills/ppt-master/scripts/image_backends/backend_minimax.py:196-204 | skills/ppt-master/scripts/image_backends/backend_qwen.py:178-186 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:127-135 | skills/ppt-master/scripts/image_backends/backend_tencent.py:176-184 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:195-203 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:153-161 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_fal.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_minimax.py\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"9295ae7ac16602e5fe18ec2f962bf5424c12daa75c1f434d4b0b0f8c0be91564"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/authoring_roundtrip.py:1403-1411 | skills/ppt-master/scripts/svg_authoring_view.py:1129-1137 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1403}}}],"partialFingerprints":{"codehealthFindingId/v1":"af1d92668c33caa05f966b2077c48f5eae7f04e77420bf572791260e97014de0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/narration_sync.py:205-213 | skills/ppt-master/scripts/video_subtitles.py:57-65 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":205}}}],"partialFingerprints":{"codehealthFindingId/v1":"68e562da78fc6fd34b0da61b56b1f7371a2a41d690611f869c9ed1d09361dea7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/converter.py:846-854 | skills/ppt-master/scripts/pptx_to_svg/converter.py:860-868 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":846}}}],"partialFingerprints":{"codehealthFindingId/v1":"7b444db68f3f694e8b7c8f80e4f3d39351644d2754e18518d12b01f92f79ac7c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2416-2424 | skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py:2460-2468 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":2416}}}],"partialFingerprints":{"codehealthFindingId/v1":"f1d11fee6af8b43d5ff1a48c7b3b427e085de784c2764f0f9b66542976045eb5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:403-411 | skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py:457-465 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":403}}}],"partialFingerprints":{"codehealthFindingId/v1":"f3f8d3c5c4960833264b28712a7f4cca08f5da0fb333d94b8c468409a683a0b9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/source_to_md/ppt_to_md.py:211-219 | skills/ppt-master/scripts/source_to_md/ppt_to_md.py:242-250 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/source_to_md/ppt_to_md.py:211\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":211}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d0e8299369c172e3f93299c38b016bb860b8a2ca70fe0d25bc22a9922d5aeaa"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/svg_position_calculator.py:421-429 | skills/ppt-master/scripts/svg_position_calculator.py:558-566 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_position_calculator.py:421\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"91ab8235235f087ac60a31d690d41b2363069edec43b4d2cbd15a6f40304b033"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/svg_position_calculator.py:668-676 | skills/ppt-master/scripts/svg_position_calculator.py:758-766 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":668}}}],"partialFingerprints":{"codehealthFindingId/v1":"c22d186426929533f08f451708a1be4931fef40f13075942d7044f15d797d004"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:9902-9910 | skills/ppt-master/scripts/svg_quality/checker.py:9958-9966 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":9902}}}],"partialFingerprints":{"codehealthFindingId/v1":"40769ed562d6e77a14d538554d44cbaa958bdaa46d23302d2bd6502918825acd"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1434-1442 | skills/ppt-master/scripts/svg_to_pptx/animation_config.py:1511-1519 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1434}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ca5340abe8b399ae328b710cb3eb82f19602a1610a10ab2cd9067f78e42d348"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6\u20139 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:687-692 | skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:935-943 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py:935\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":687}}}],"partialFingerprints":{"codehealthFindingId/v1":"773ce2bb125768e92e940a72c863378e299167cf7857a21013096e596bdae0df"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): 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 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":421}}}],"partialFingerprints":{"codehealthFindingId/v1":"252dcbdad9e07a0cf105efc517f690dfbead2d38a2d250ca9d448f417be79d5c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1282}}}],"partialFingerprints":{"codehealthFindingId/v1":"3724558e9c891cea42a78f82f29c0b419d60f1a17c236228ab0c418fd8ed9a86"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":2244}}}],"partialFingerprints":{"codehealthFindingId/v1":"00c43fc07f9b2700c71b72da44f5503242adfc270f43b3d9dd84ead205176e0a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 17): 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 \u2014 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2b0f1b55f7387bb90ad53dd29b195b315393375fd08cfb200b454bc6020df97"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 6): skills/ppt-master/scripts/image_backends/backend_fal.py:129-136 | skills/ppt-master/scripts/image_backends/backend_ideogram.py:134-141 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:129-136 | skills/ppt-master/scripts/image_backends/backend_tencent.py:178-185 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:197-204 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:155-162 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_fal.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_ideogram.py\u0060 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 \u2014 extracting one helper per block leaves the fork in place."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":129}}}],"partialFingerprints":{"codehealthFindingId/v1":"fd65e063a4ba0437392dc57d050d19c708e48f3549cadf81e372be1394288e8e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/ppt-master/scripts/extract_svg_assets.py:817-824 | skills/ppt-master/scripts/extract_svg_assets.py:854-861 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":817}}}],"partialFingerprints":{"codehealthFindingId/v1":"d8a0a083bda3d14e2d1ae09ce77147cfbae0881a584f5bb7e935296e0c540b71"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/ppt-master/scripts/finalize_svg.py:454-461 | skills/ppt-master/scripts/svg_finalize/align_embed_images.py:633-640 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/finalize_svg.py"},"region":{"startLine":454}}}],"partialFingerprints":{"codehealthFindingId/v1":"15ab7e572faa6fccf0b0555d889a6a436caf54900f1822c4d2e9db60dfe05fce"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/ppt-master/scripts/prompt_audit.py:1135-1142 | skills/ppt-master/scripts/prompt_audit.py:1247-1255 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/prompt_audit.py:1135\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1135}}}],"partialFingerprints":{"codehealthFindingId/v1":"55d796ab3d3f658316e1684a92c619ee05e8a926ff32e911ad9cea642b2ae12d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/svg_contracts.py:761-769 | skills/ppt-master/scripts/svg_quality/svg_contracts.py:982-990 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_quality/svg_contracts.py:761\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":761}}}],"partialFingerprints":{"codehealthFindingId/v1":"cae50c6205030eabdc807f6c3ef0416ae1af451fdc621537a2ba0198c9bfbf22"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1306-1313 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5146-5153 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:5154\u0060 calls \u0060ctx_x\u0060, \u0060ctx_y\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1314\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1306}}}],"partialFingerprints":{"codehealthFindingId/v1":"0fc6eea70f60a4f9484f5fe4cb00b491b81b402c9ac5e6eb262f3759c544429c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): 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 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_colors.py"},"region":{"startLine":131}}}],"partialFingerprints":{"codehealthFindingId/v1":"43ee6d691cb27e55951db46091dcf66212d5639295e63fa3ff04b580c0c56428"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":993}}}],"partialFingerprints":{"codehealthFindingId/v1":"2be5ce2a9485617309821ba4a0270f42cc035fcb8b92c126cd2b9c0827aa477b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1826-1833 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:1847-1854 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1826}}}],"partialFingerprints":{"codehealthFindingId/v1":"36c64ea01a39354565736b8ce354ade8ef3015bf265635e508d9ad20173e49e9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 3): 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 \u2014 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 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":809}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb12dc225888ecafa726282addabb4e2c40e07aa54ae65dc5994c09d4eeb9653"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/image_backends/backend_bfl.py:142-148 | skills/ppt-master/scripts/image_backends/backend_replicate.py:126-132 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_bfl.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"3b45d334b87a2ad9049ef1bf67563ddbfe764b724e0f5065e8bb35ad4ca1d56f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/pptx_intake.py:56-62 | skills/ppt-master/scripts/project_management/cli.py:202-208 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060skills/ppt-master/scripts/pptx_intake.py:56\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 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 \u0060payload\u0060 to \u0060dict[str, Any]\u0060 in one and \u0060object\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/ppt-master/scripts/project_management/cli.py:210\u0060 calls \u0060chmod\u0060 and \u0060skills/ppt-master/scripts/pptx_intake.py:63\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_intake.py"},"region":{"startLine":56}}}],"partialFingerprints":{"codehealthFindingId/v1":"790bfa106b46ea1e96eeb5e10123a686348b3b20462daed3cd6dfebdd6e1be40"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/pptx_ooxml/clone.py:535-541 | skills/ppt-master/scripts/pptx_ooxml/package.py:231-237 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":535}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f873f374ad29a43367e6c1c1e73deef4ff4353fc926e51c38af5cceaba56d6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:658-664 | skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:869-875 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":658}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e688fefd2b010cc01bc79579ec6e638d6534128cf6652a663ceaf2a57819f89"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/source_to_md/pdf_to_md.py:645-651 | skills/ppt-master/scripts/source_to_md/pdf_to_md.py:808-814 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":645}}}],"partialFingerprints":{"codehealthFindingId/v1":"af2fe8f93749847417bcc415ba85d5470161b7736f30a4e59a88e1822c337471"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/svg_authoring_view.py:1315-1321 | skills/ppt-master/scripts/svg_authoring_view.py:1426-1432 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/svg_authoring_view.py:1315\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"343cf66cce14700d96057dc7a79b88e95a9ee49f49fe39fded5874d6bddbc793"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/svg_quality/checker.py:5835-5843 | skills/ppt-master/scripts/svg_quality/checker.py:5924-5930 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5835}}}],"partialFingerprints":{"codehealthFindingId/v1":"a39be34131318eaa667b737de0d59700b77e809805dfd952e0a93ad51d57cc8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":657}}}],"partialFingerprints":{"codehealthFindingId/v1":"9af065b4e59853a6abbf6b2a26315087c474c8aaae7d96fdb2fc5289e4f36e2e"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py"},"region":{"startLine":470}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc704bf8ed2b21e86ec47ef1293b39b3a9ea6849df9f22b0c8c7bfb58178c5fe"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 8): skills/ppt-master/scripts/image_backends/backend_fal.py:125-130 | skills/ppt-master/scripts/image_backends/backend_minimax.py:194-199 | skills/ppt-master/scripts/image_backends/backend_qwen.py:176-181 | skills/ppt-master/scripts/image_backends/backend_replicate.py:130-135 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:125-130 | skills/ppt-master/scripts/image_backends/backend_tencent.py:174-179 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:193-198 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:151-156 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_fal.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_minimax.py\u0060 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 \u2014 extracting one helper per block leaves the fork in place. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/image_backends/backend_tencent.py:171\u0060 calls \u0060normalize_image_size\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_fal.py:122\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":125}}}],"partialFingerprints":{"codehealthFindingId/v1":"33aaeb62399f4ea765a92d71dc017a5bb7632ba82c10a29751b2b5b150e49e8b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): 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 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":818}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad2d79105e1efb5b84a5dbf9fe8969f9e26892340cdb65e6df6ff0d227bd8697"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 3): skills/ppt-master/scripts/source_to_md/doc_to_md.py:511-516 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:843-848 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:930-935 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":511}}}],"partialFingerprints":{"codehealthFindingId/v1":"8e308061d24d14dbfaabbc9ccaea1d15e0578317995d9488cd7d3a976678442c"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/attribution_guard.py:138-143 | skills/ppt-master/scripts/attribution_guard.py:172-177 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/attribution_guard.py"},"region":{"startLine":138}}}],"partialFingerprints":{"codehealthFindingId/v1":"a034bc3f3e04310e7b049b33d901103db2f02de8aa1887c8b9f0fee811fcb6b7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/image_gen.py:662-667 | skills/ppt-master/scripts/image_search.py:1921-1926 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":662}}}],"partialFingerprints":{"codehealthFindingId/v1":"79a8fb8ef5024b5b00ab214c27326b48862072a2d5e13ebdd93786cffd016b95"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/image_sources/provider_openverse.py:90-96 | skills/ppt-master/scripts/image_sources/provider_wikimedia.py:126-131 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060skills/ppt-master/scripts/image_sources/provider_openverse.py:90\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_openverse.py"},"region":{"startLine":90}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9533acb1860cc06c4b89c372f5c865ff00eb822a95df0ae95688b9a361294b3"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/pptx_animations.py:1636-1641 | skills/ppt-master/scripts/pptx_animations.py:1668-1673 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":1636}}}],"partialFingerprints":{"codehealthFindingId/v1":"83503b9e90372d9610c9b7e33bb08101840ef725da48ee32296ab67a540d8b21"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:953-958 | skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:1040-1045 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":953}}}],"partialFingerprints":{"codehealthFindingId/v1":"e490e0078922cf7ae82bb3a6d0e335e2bfff01821dca7cd1b14bf666357c2c2f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/source_to_md/doc_to_md.py:381-386 | skills/ppt-master/scripts/source_to_md/doc_to_md.py:404-409 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":381}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0bbf1ae5ff6a27a8e5f5218ca1639295a6b09cbd0dac8a031dbd14f2c2b155b"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":768}}}],"partialFingerprints":{"codehealthFindingId/v1":"71c3cc553a82acb853e2706094839014c0b4ca818b9cc4a85868a70ded94ee06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): 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 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":1175}}}],"partialFingerprints":{"codehealthFindingId/v1":"06a281390e648e3e9649c68ae95ffd47c9de90435e9c935187df9f9758006f96"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/total_md_split.py:178-183 | skills/ppt-master/scripts/total_md_split.py:194-199 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/total_md_split.py"},"region":{"startLine":178}}}],"partialFingerprints":{"codehealthFindingId/v1":"e7d83b1ea647bf98b6209a920a249d781db810c2ab9eb2f09609aea4a6b0c870"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2748}}}],"partialFingerprints":{"codehealthFindingId/v1":"bf542cd9c3f8a0d809b4db7e9a430997de940aec894496b1f209e6407e261fdf"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): 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 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 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 \u0060skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py:142\u0060 it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand \u2014 widen the region to the smallest complete statement or declaration that contains it, and extract that."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"82b3d5ca73ceb5051884751127a055c537fa96894784053c1377f03f2999ebe5"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/ppt-master/scripts/pptx_workspace.py:920-924 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:430-439 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py:430\u0060 it does not close everything it opens, so those exact lines cannot be lifted as they stand \u2014 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 \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":920}}}],"partialFingerprints":{"codehealthFindingId/v1":"af715d7473a235bcbbb14daec99f531dcf38d7a7678bd1d5b77918442cbf8445"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/source_to_md/web_to_md.py:1280-1285 | skills/ppt-master/scripts/source_to_md/web_to_md.py:1348-1353 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":1280}}}],"partialFingerprints":{"codehealthFindingId/v1":"96ad151a49f964a924ad0f651aee1362b4fff51a0d99bde8b2ee870e68a48aea"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (8 lines \u00D7 2): skills/ppt-master/scripts/svg_finalize/align_embed_images.py:222-229 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4563-4570 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fe31ef796ff58b1bc7272b34b68064de51d8bf3b84c2dd4b00abfd37db6226f"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/ppt-master/scripts/svg_position_calculator.py:222-228 | skills/ppt-master/scripts/svg_position_calculator.py:265-269 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":222}}}],"partialFingerprints":{"codehealthFindingId/v1":"ca26c7a421c5b8efd11d9da75c3b98beb80a25381de25986803e2c5cc25563b2"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (3\u20135 lines \u00D7 3): skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1900-1904 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1977-1981 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4336-4338 \u2014 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 \u2014 resolving only two of them leaves the rest to drift apart the first time one is edited. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names \u2014 the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1907\u0060 calls \u0060PathCommand\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:1985\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":1900}}}],"partialFingerprints":{"codehealthFindingId/v1":"a491c83c08703eedae5fce0d9ba942a8570480b309f5cdbf4fd5591ce78d7899"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3720-3725 | skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3792-3797 \u2014 both copies are in the same file, so extract the block into one function there and call it from each site \u2014 the copies drift apart the first time only one of them is edited. \u2605 These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3719\u0060 calls \u0060Element\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py:3791\u0060 does not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3720}}}],"partialFingerprints":{"codehealthFindingId/v1":"3e8b6aab5b9a1494914c40d1ae7c2ad9495bbde38370f8982a26c7deb1db6d88"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/ppt-master/scripts/authoring_roundtrip.py:257-261 | skills/ppt-master/scripts/mirror_template_materialize.py:616-620 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":257}}}],"partialFingerprints":{"codehealthFindingId/v1":"a7620ea454d1fe80b032adb9a9f52f7cabfa07a3cb6132959addf3555d811487"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 5): skills/ppt-master/scripts/image_backends/backend_minimax.py:98-104 | skills/ppt-master/scripts/image_backends/backend_qwen.py:95-101 | skills/ppt-master/scripts/image_backends/backend_siliconflow.py:65-71 | skills/ppt-master/scripts/image_backends/backend_volcengine.py:92-98 | skills/ppt-master/scripts/image_backends/backend_zhipu.py:83-89 \u2014 before extracting anything, compare \u0060skills/ppt-master/scripts/image_backends/backend_minimax.py\u0060 and \u0060skills/ppt-master/scripts/image_backends/backend_qwen.py\u0060 as WHOLE FILES: this scan already matched 7 separate duplicated blocks between them, totalling at least 111 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 \u2014 extracting one helper per block leaves the fork in place. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_minimax.py"},"region":{"startLine":98}}}],"partialFingerprints":{"codehealthFindingId/v1":"f0767cd4182f5ea2d656dbd0488daad6eb2266a644e74c17b8bcac59c50702c7"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (24 lines \u00D7 2): skills/ppt-master/scripts/pptx_gradients.py:73-96 | skills/ppt-master/scripts/pptx_shapes/semantic_hash.py:56-81 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made twice. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_gradients.py"},"region":{"startLine":73}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dab1ce30f439072c4868175c408d9c6f4b49fff9e7b7bb3cc75f0356cef8bd6"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 7): 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:150-154 | 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 \u2014 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 \u2014 a location they all depend on today, or a new shared one if there is none \u2014 and call it from each site; until then, every change has to be made 7 times."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1564}}}],"partialFingerprints":{"codehealthFindingId/v1":"b5e076de27c163880e70894da9c02b7919901ba5096eb3b98638e94e5d436be0"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): 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 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/preset_svg_markup.py"},"region":{"startLine":192}}}],"partialFingerprints":{"codehealthFindingId/v1":"c239a4b38145fa03a92a78415edbde6eb949c00751af6d24c50e620c7788b855"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/ppt-master/scripts/source_to_md/doc_to_md.py:115-119 | skills/ppt-master/scripts/source_to_md/excel_to_md.py:49-53 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"93534a0d0b98629b059dc3095bc52917e81e6f5c520d2be04fdd33df57dc94e8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/ppt-master/scripts/svg_finalize/align_embed_images.py:177-181 | skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py:4549-4553 \u2014 the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach \u2014 a location they all depend on today, or a new shared one if there is none \u2014 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 \u0060img\u0060 to \u0060\u0027PILImage\u0027\u0060 in one and \u0060Any\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"148994c2c3ff893ce5f8d69f213522a974174010eaa127720bd3a9d04d89df06"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): 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 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"32941b5542352d59fb6bb3497d1015f9492158df782c9654c97317e63ae50358"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py:365-371 | skills/ppt-master/scripts/svg_to_pptx/text_outline.py:363-369 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/shape_boolean.py"},"region":{"startLine":365}}}],"partialFingerprints":{"codehealthFindingId/v1":"99cfeceb6bd48814ddfa04dd3548fa8ecf236296ae905edc793798ca89b1575d"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (5 lines \u00D7 2): skills/ppt-master/scripts/tts_backends/backend_common.py:22-26 | skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py:43-47 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_common.py"},"region":{"startLine":22}}}],"partialFingerprints":{"codehealthFindingId/v1":"cdc3df0e5e0831b87465b3749208971d460f48537c495eaf833c61b6a000f95a"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (9 lines \u00D7 2): skills/ppt-master/scripts/authoring_roundtrip.py:245-253 | skills/ppt-master/scripts/mirror_template_materialize.py:604-612 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once. The \u0060return\u0060 at the foot of the matched lines is the enclosing body\u0027s own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that \u0060return\u0060 occupied \u2014 no decision has to be handed back and re-acted on."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":245}}}],"partialFingerprints":{"codehealthFindingId/v1":"55f0e11cffb5c31fb8bdab045abdc73f64c125b2dbfa9168026419c8999309a9"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (7 lines \u00D7 2): skills/ppt-master/scripts/image_gen.py:1169-1175 | skills/ppt-master/scripts/image_search.py:1991-1997 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 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 \u0060cli_value\u0060 to \u0060int | None\u0060 in one and \u0060Optional[int]\u0060 in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH \u2014 their common supertype where they have one, or a new abstraction over them where they do not \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":1169}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed93559638a8187dd2ee7b4137786fefa042010aab3eaff0f25c2426224cfe8"}},{"ruleId":"D4","level":"warning","message":{"text":"Duplicated block (6 lines \u00D7 2): skills/ppt-master/scripts/authoring_roundtrip.py:1354-1359 | skills/ppt-master/scripts/svg_authoring_view.py:1093-1098 \u2014 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 \u2014 a file they already depend on, or a new one alongside them \u2014 and call it from both call sites, so a change lands once."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1354}}}],"partialFingerprints":{"codehealthFindingId/v1":"29a3028dc37a28849cef01d2213e3e3261f024791eee01c88f344e688b1cc437"}},{"ruleId":"D14","level":"error","message":{"text":"Banned license: edge-tts: \u0060edge-tts\u0060 7.3.1 is published on PyPI under \u0060LGPL-3.0\u0060, which this policy bans, and it is in the SHIPPED closure of this repository \u2014 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. \u2605 The licence that makes this row is LGPL-3.0, and unmodified use is often permitted: the LGPL lets your code use an UNMODIFIED copy of the library that stays a separately installed package (its own entry in node_modules, site-packages or the gem path, which a user can replace) without your code coming under the LGPL. What it then asks is that you pass on its licence and notices and let users swap in their own build of it (LGPL-3.0 section 4). Modifying it, copying its code into yours, or merging it into one bundled or statically linked artifact is where the obligations grow, and this policy cannot see which you do \u2014 that is why it denies LGPL-3.0 by default. If you use it unmodified and separately installed, allow it in your repository\u0027s licence policy rather than replacing it: add \u0060LGPL-3.0-only\u0060 / \u0060LGPL-3.0-or-later\u0060 to the allow-list of the licence check your CI runs (\u0060license-checker --onlyAllow\u0060, the \u0060allow-licenses\u0060 input of GitHub\u0027s dependency-review-action, \u0060[licenses] allow\u0060 in cargo-deny\u0027s deny.toml), record why in the same change, and hide this row on the findings page with that reason. This scan\u0027s banned set is not read from that file, so the row stays until it is hidden."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"d4f9135c55178a6c753dc156b596528445d628d38081a72f2381f4c99c590538"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py: skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py changed 32 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 350 in builder.create_pptx_with_native_svg at line 6791. 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":6791}}}],"partialFingerprints":{"codehealthFindingId/v1":"52ea53a867600431ec2b7cf0c057260d6e7dcbdc313eab899169a183a35002f2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py: skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py changed 28 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 311 in cli.main at line 1984. 16 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1984}}}],"partialFingerprints":{"codehealthFindingId/v1":"5321a2299c80b188d1eed8394114e68fcd6bddf9827141efbe2a231977957acd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py: skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py changed 25 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 107 in elements.convert_text at line 3189. 20 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":3189}}}],"partialFingerprints":{"codehealthFindingId/v1":"b16f5a9b82f7fa3fc0dedeb4fbb4e073eb882f306f070b78758d33b1421a48dd"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/project_management/cli.py: skills/ppt-master/scripts/project_management/cli.py changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 90 in ProjectManager.import_sources at line 848. 15 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/project_management/cli.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/cli.py"},"region":{"startLine":848}}}],"partialFingerprints":{"codehealthFindingId/v1":"f2b8b7d22b6da94ce1be4bda7801d7010dc9b7eb19b77262ba3a05079f351d3c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py: skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py changed 21 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 2032. 13 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":2032}}}],"partialFingerprints":{"codehealthFindingId/v1":"93ea13c10e1764b663bbccda57b4c0221ab34c248151d599119322518753144b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/image_gen.py: skills/ppt-master/scripts/image_gen.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 69 in image_gen.load_manifest at line 586. 13 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_gen.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":586}}}],"partialFingerprints":{"codehealthFindingId/v1":"18d2e85556b4ed0d5748917bacdb32236ea4da456fa63bf9d7a6eb66e8779e22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/slice_images.py: skills/ppt-master/scripts/slice_images.py changed 22 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 60 in slice_images.slice_sheet at line 949. 19 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/slice_images.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/slice_images.py"},"region":{"startLine":949}}}],"partialFingerprints":{"codehealthFindingId/v1":"b34e4f50403bf7a5d38a29d69e8f0e9fc8687499347ea346d3f3568fdaed1c26"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/confirm_ui/static/app.js: skills/ppt-master/scripts/confirm_ui/static/app.js changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 87 in app.enumField at line 1418. 8 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/confirm_ui/static/app.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":1418}}}],"partialFingerprints":{"codehealthFindingId/v1":"95e548d4b5623a078156a26e7f4b5004e46d0f4e835e5f5548ff54cecbf534c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/source_to_md/pdf_to_md.py: skills/ppt-master/scripts/source_to_md/pdf_to_md.py changed 14 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 1508. 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/source_to_md/pdf_to_md.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1508}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ec7815fa0664485f7c5a9b907330fb924b48f1eb7d9e430c1e3536536bf6918"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py: skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py changed 16 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 \u2014 a file this often edited pays the complexity back every time. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":1782}}}],"partialFingerprints":{"codehealthFindingId/v1":"25cf3a5a43975ccf80d4f971f59c443380609df146b46891b430ae374f178e67"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_quality/cli.py: skills/ppt-master/scripts/svg_quality/cli.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in cli.main at line 168. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_quality/cli.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/cli.py"},"region":{"startLine":168}}}],"partialFingerprints":{"codehealthFindingId/v1":"acfafe71ae0c2d65801a8ba7eb00896054c854b0dcded323c7e00b3dabcb3f22"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/authoring_roundtrip.py: skills/ppt-master/scripts/authoring_roundtrip.py changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in authoring_roundtrip._load_documents at line 326. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/authoring_roundtrip.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":326}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cc13e208abbf138b73d5f3b6dd2aab29d513db1afcd14c375b1f8a4a5a84d4f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py: skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 50 in slide_to_svg._convert_shape at line 540. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py"},"region":{"startLine":540}}}],"partialFingerprints":{"codehealthFindingId/v1":"03fb35851ad81f4732a5e23f71c2b9ac0e5403598e7204beaac0a885c8b1fb20"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/source_to_md/web_to_md.py: skills/ppt-master/scripts/source_to_md/web_to_md.py changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in web_to_md.find_main_content at line 881. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/source_to_md/web_to_md.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":881}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7b59dd8406db2be13d14ed0d4d18975cbb4370587044ea5106dc0605b3fc1ed"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/mirror_template_materialize.py: skills/ppt-master/scripts/mirror_template_materialize.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 56 in mirror_template_materialize.materialize_mirror_template at line 3148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/mirror_template_materialize.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":3148}}}],"partialFingerprints":{"codehealthFindingId/v1":"5bb5a57fd439fdf1124466c175bfb4861c067ab8e728d58e121b7bb1ee8c53a8"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/text_measure.py: 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/text_measure.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/text_measure.py"},"region":{"startLine":905}}}],"partialFingerprints":{"codehealthFindingId/v1":"8336be3172d67950066d50aa09aec76bde75d4c4f3b716491f5cb1edfebaa6e2"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/source_to_md/ppt_to_md.py: skills/ppt-master/scripts/source_to_md/ppt_to_md.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in ppt_to_md.convert_presentation_to_markdown at line 1329. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/source_to_md/ppt_to_md.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":1329}}}],"partialFingerprints":{"codehealthFindingId/v1":"b4dd0e3887f599a074b77bf94bb3cd419dac9a9d62491f535ccae37a28f2bc49"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py: skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py changed 17 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in utils.is_stroked_zero_axis_shape at line 1515. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1515}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7bff53839b0d7db8dc23646f8f9f8ea5a883a83a61a250eb0511466552dbd9f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/notes_to_audio.py: skills/ppt-master/scripts/notes_to_audio.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 68 in notes_to_audio.main at line 448. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/notes_to_audio.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/notes_to_audio.py"},"region":{"startLine":448}}}],"partialFingerprints":{"codehealthFindingId/v1":"131b3f4edff6a4403e54cebb0056cfc7dcc7fbf0a9915930ea18797807d67a14"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_editor/server.py: skills/ppt-master/scripts/svg_editor/server.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in server.main at line 1503. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_editor/server.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/server.py"},"region":{"startLine":1503}}}],"partialFingerprints":{"codehealthFindingId/v1":"e1a8aaf60ea2b846c78883dbf2370f8063ae6179fbeb8d75df91a5fe1bd2718c"}},{"ruleId":"D15","level":"warning","message":{"text":"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 changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 54 in template_structure.load_native_structure_contract at line 1183. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py"},"region":{"startLine":1183}}}],"partialFingerprints":{"codehealthFindingId/v1":"56400693174f6d1d948b95f1aea0c91e3a026e298434893582d07828d1c783da"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_authoring_view.py: skills/ppt-master/scripts/svg_authoring_view.py changed 16 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in svg_authoring_view.adopt_authoring_object at line 2283. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_authoring_view.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":2283}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e134774767b52882be961b13d02fcaf73ade42aa70e05138f48748daa8aa229"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py: skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py changed 15 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":555}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c3848a5e314c3b2bb39638db068ce36c56f8047ed142e9ac50ade4b5456458b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/animation_config.py: skills/ppt-master/scripts/svg_to_pptx/animation_config.py changed 8 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-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/animation_config.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1570}}}],"partialFingerprints":{"codehealthFindingId/v1":"c833d04ef35d2185c16d176b1ce4928b5ae279705965629da36146d656bad3f4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py: skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in txbody_to_svg._convert_east_asian_vertical at line 390. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"46086d3e7678fc60d2bdaed4a2ab515aa43857fc54b1204d9dd53c8eb051c4a9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py: skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in chart_style._chart_companion_shapes at line 1578. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":1578}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e53518ccb69f9c579c41ed7080bbbf917081400738cf5226d7274b8210ff34f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/source_to_md/doc_to_md.py: skills/ppt-master/scripts/source_to_md/doc_to_md.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in doc_to_md._convert_docx at line 965. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/source_to_md/doc_to_md.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":965}}}],"partialFingerprints":{"codehealthFindingId/v1":"eb5f384c556b707fb42886358452a78130f9770f74680376e88d82a50b60a8e5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/source_to_md.py: skills/ppt-master/scripts/source_to_md.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in source_to_md.dispatch_many at line 481. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/source_to_md.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md.py"},"region":{"startLine":481}}}],"partialFingerprints":{"codehealthFindingId/v1":"321fe6920c273868ac76814b1dbfe0d2f5d4ec0c4243286aa602eb3f6ac5c8a4"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_editor/static/app.js: skills/ppt-master/scripts/svg_editor/static/app.js changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in app.selectSlide at line 723. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_editor/static/app.js\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"af60b461c816c2a10df11bf7c29b8b19e2c2db5febae228e9fd2b85e22004f5d"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/converter.py: skills/ppt-master/scripts/pptx_to_svg/converter.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in converter.convert_pptx_to_svg at line 482. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/converter.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":482}}}],"partialFingerprints":{"codehealthFindingId/v1":"185a5ef8363ec4be813c0d18a447cbed593d29e408142db8fdceaedaf3a44623"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/image_backends/backend_common.py: skills/ppt-master/scripts/image_backends/backend_common.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in backend_common.fit_size at line 410. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_common.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_common.py"},"region":{"startLine":410}}}],"partialFingerprints":{"codehealthFindingId/v1":"d2dfe5322b375ed7b2fa7812ce22ea493c6b5a46d740be4d1570a82b1a1e9939"}},{"ruleId":"D15","level":"warning","message":{"text":"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 changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in chart_data._combo_chart_data at line 1212. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py"},"region":{"startLine":1212}}}],"partialFingerprints":{"codehealthFindingId/v1":"50436876d90f59c60debf4af40797c9e2122e4c12d656bdf53c2061c15a8e533"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/template_import/manifest.py: skills/ppt-master/scripts/template_import/manifest.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 65 in manifest.build_manifest at line 502. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/template_import/manifest.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/manifest.py"},"region":{"startLine":502}}}],"partialFingerprints":{"codehealthFindingId/v1":"b312f1723808104f046beaab18deba690b60ea93f1335221e4c9940545f150bb"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/image_backends/backend_openai.py: skills/ppt-master/scripts/image_backends/backend_openai.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in backend_openai._edit_image at line 714. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_openai.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openai.py"},"region":{"startLine":714}}}],"partialFingerprints":{"codehealthFindingId/v1":"49c9af4241a6227759bdeb1d1272f0eb7167091822313ba91bbe60de21cdbb73"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_finalize/flatten_tspan.py: skills/ppt-master/scripts/svg_finalize/flatten_tspan.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in flatten_tspan.flatten_text_with_tspans at line 569. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_finalize/flatten_tspan.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":569}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5b4d676a5925a79dfa38401cc21bde90ebf6ae2f9a255058b1e0364976cf866"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/image_search.py: skills/ppt-master/scripts/image_search.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 34 in image_search.run_search_manifest at line 2148. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_search.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":2148}}}],"partialFingerprints":{"codehealthFindingId/v1":"49da306a1afe7c54ab0c7a3c647773b5838d7a789af071193133ab7b0b27e445"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py: skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in chart_to_svg._validate_chart_semantics at line 1864. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":1864}}}],"partialFingerprints":{"codehealthFindingId/v1":"d64c0b5c046b7b7fe35e6fb559d9dc23f539e769e2384a5fc53597fdba97d0f1"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/project_utils.py: skills/ppt-master/scripts/project_utils.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in project_utils.validate_project_structure at line 602. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/project_utils.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":602}}}],"partialFingerprints":{"codehealthFindingId/v1":"e30c4c46fcfb56354553c3033a9bbd71ad17a4e426c4522c5d856861ebb223d3"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/preset_shape_svg.py: skills/ppt-master/scripts/preset_shape_svg.py changed 11 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in preset_shape_svg.main at line 236. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/preset_shape_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/preset_shape_svg.py"},"region":{"startLine":236}}}],"partialFingerprints":{"codehealthFindingId/v1":"0af8a61b3886566fd64f396f0fb71c1c8aac0aa5f21a056f89bb73a38375701c"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py: skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 49 in tbl_to_svg.convert_tbl at line 279. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":279}}}],"partialFingerprints":{"codehealthFindingId/v1":"0ecf3bcb7d95a9be45b7a18018b78b206fa6b4ff3311245ac81fedd23a1c4037"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/image_treat.py: skills/ppt-master/scripts/image_treat.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in image_treat._apply_treatments at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_treat.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_treat.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"6fc625861d7aa32e798b7dccfe9c4e61a8ec4ca6f31c540e8c8254505547f551"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_delivery_check.py: skills/ppt-master/scripts/pptx_delivery_check.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 57 in pptx_delivery_check.audit_pptx_delivery at line 727. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_delivery_check.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_delivery_check.py"},"region":{"startLine":727}}}],"partialFingerprints":{"codehealthFindingId/v1":"d4937b59491320512b0792725fbc6f9deb39d50eb3c9fd16b6e4f1e5045f8374"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_position_calculator.py: skills/ppt-master/scripts/svg_position_calculator.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 39 in svg_position_calculator.main at line 1378. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_position_calculator.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_position_calculator.py"},"region":{"startLine":1378}}}],"partialFingerprints":{"codehealthFindingId/v1":"d16febc76744fc2a54a39f86af922995217b4e4f0de27cc32ca06095300e3b1e"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/compact_svg_styles.py: skills/ppt-master/scripts/compact_svg_styles.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in compact_svg_styles._promote_common_group_defaults at line 350. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/compact_svg_styles.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_styles.py"},"region":{"startLine":350}}}],"partialFingerprints":{"codehealthFindingId/v1":"3161de84608ca2475238c210e592bbd2592e0c4d1318fdf5fec20b372915546b"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/template_preview_pptx.py: skills/ppt-master/scripts/template_preview_pptx.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in template_preview_pptx.main at line 334. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/template_preview_pptx.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_preview_pptx.py"},"region":{"startLine":334}}}],"partialFingerprints":{"codehealthFindingId/v1":"a172ed5732cb774416bf3205df2ad28cd0966e05921995f5d159bb1bc74333e9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/extract_svg_assets.py: skills/ppt-master/scripts/extract_svg_assets.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in extract_svg_assets.extract_file at line 791. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/extract_svg_assets.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":791}}}],"partialFingerprints":{"codehealthFindingId/v1":"c491b30122746dc377b44dff4d86769e52baaee23bc9a662316c54dd09e80e25"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/image_backends/backend_gemini.py: skills/ppt-master/scripts/image_backends/backend_gemini.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in backend_gemini._generate_image at line 154. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_gemini.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"4ba9bf0a648fb65968c3ce7cf34fb921fab4f0121e693078f9de7025e0e3b00a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py: skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 62 in ln_to_svg.resolve_stroke at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/ln_to_svg.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"67b05f58f811c71a076494f8b217509424292bea7bd5975d5f94de005b971336"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_ooxml/clone.py: skills/ppt-master/scripts/pptx_ooxml/clone.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in clone._remap_slide_jump_relationships at line 266. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_ooxml/clone.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":266}}}],"partialFingerprints":{"codehealthFindingId/v1":"fa3d6d751d0fcb0bf28a857be0c34e41ec9416050026613861b5cb29f683767f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py: skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in theme_fonts.load_theme_font_spec_from_pages at line 210. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/theme_fonts.py"},"region":{"startLine":210}}}],"partialFingerprints":{"codehealthFindingId/v1":"cf638d7c2aef4efde9f3910a539dfe01560e2aa0cbaf00017f5d69ffba75d1be"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py: skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in chart_xml._axis_pair_xml at line 931. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae6d7914cc67eddfcf390c34d99e63241320cfef694059d9b12da72e86612153"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py: skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in normalized_chart_svg._render_lines_or_areas at line 604. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":604}}}],"partialFingerprints":{"codehealthFindingId/v1":"1c2f1b3907590b6d1dc22c45e804a017d3d2c54cde403db4807f909f43777b64"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py: skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in marker_common._fallback_text_records at line 694. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/marker_common.py"},"region":{"startLine":694}}}],"partialFingerprints":{"codehealthFindingId/v1":"2d00d8dd881830ba5f823a15f05cd1da0badaaf89e1b7e086cdeb9382a78f400"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/register_template.py: skills/ppt-master/scripts/register_template.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in register_template._extract_entry at line 1155. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/register_template.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/register_template.py"},"region":{"startLine":1155}}}],"partialFingerprints":{"codehealthFindingId/v1":"a31c1842073dbcf60bce141a2acc0cbf6a8bf22a4dd24fda642c3b7ab92878a7"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py: skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py changed 4 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in styles.build_gradient_fill at line 44. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/styles.py"},"region":{"startLine":44}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d24dd4b20e2a330a38008d9566ebdd1c5478be00e4199ce9936617c6550baca"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py: skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in pic_to_svg.convert_blip_fill at line 88. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/pic_to_svg.py"},"region":{"startLine":88}}}],"partialFingerprints":{"codehealthFindingId/v1":"744c45ff8ebf910422a238daf6091f76e0fedd2ee8f20ba5a021ae374677eda9"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_template_import.py: skills/ppt-master/scripts/pptx_template_import.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 25 in pptx_template_import.main at line 194. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_template_import.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_template_import.py"},"region":{"startLine":194}}}],"partialFingerprints":{"codehealthFindingId/v1":"0a3be3ca703bc0f6ec26f4a63ee149df99441f2d2ce94108de1cfca3bde1eb5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_quality/svg_contracts.py: skills/ppt-master/scripts/svg_quality/svg_contracts.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in svg_contracts.check_forbidden_elements at line 197. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_quality/svg_contracts.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/svg_contracts.py"},"region":{"startLine":197}}}],"partialFingerprints":{"codehealthFindingId/v1":"30f65820303ab8b6d956b451ff3f960da3001f7a885c7b5e2ee37340997ede07"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/spec_review/server.py: skills/ppt-master/scripts/spec_review/server.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 33 in server.main at line 244. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/spec_review/server.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/spec_review/server.py"},"region":{"startLine":244}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2ad5f2ecd8d9f80f386cf3c03884a453133614092a7ac2a9370fc16053291ad"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/prompt_audit.py: skills/ppt-master/scripts/prompt_audit.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 31 in prompt_audit._registry_ids at line 1115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/prompt_audit.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1115}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac13efd38e3e93e3bacc3661e14bc6c8f88c3c91af41d5b68b2dd277a7f8855a"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg.py: skills/ppt-master/scripts/pptx_to_svg.py changed 3 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in pptx_to_svg.main at line 151. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg.py"},"region":{"startLine":151}}}],"partialFingerprints":{"codehealthFindingId/v1":"844e61668f50d5b19febcd3fe8475bc0e298cffbe8263942a091fb7801d04d5f"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py: skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 21 in fill_to_svg._resolve_grad_fill at line 183. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py"},"region":{"startLine":183}}}],"partialFingerprints":{"codehealthFindingId/v1":"f43cf0c679d7fc017dd7df2043773b48db491adebbf718ab4bebe763d11989e0"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/source_to_md/_batch.py: skills/ppt-master/scripts/source_to_md/_batch.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in _batch.run_path_batch at line 115. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/source_to_md/_batch.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/_batch.py"},"region":{"startLine":115}}}],"partialFingerprints":{"codehealthFindingId/v1":"c0fdf9f8f287d17ff6bae26c01301ab9435cdfb80cb540654a70c8dbafa7ef55"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/image_sources/provider_common.py: skills/ppt-master/scripts/image_sources/provider_common.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 20 in provider_common.score_candidate at line 467. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_sources/provider_common.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_sources/provider_common.py"},"region":{"startLine":467}}}],"partialFingerprints":{"codehealthFindingId/v1":"26d2ce6ad2303719c176099d56f2e28f6b3601986fae4ee7bf8a60e0fbbc07f5"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/template_import/native_structure.py: skills/ppt-master/scripts/template_import/native_structure.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in native_structure.build_native_structure at line 75. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/template_import/native_structure.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_import/native_structure.py"},"region":{"startLine":75}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4bd950b0cfc205ab47778f986422564891738be59bd2b7938ce0e3636fde522"}},{"ruleId":"D15","level":"warning","message":{"text":"Hotspot: skills/ppt-master/scripts/svg_to_pptx/pptx_package/discovery.py: skills/ppt-master/scripts/svg_to_pptx/pptx_package/discovery.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in discovery.find_notes_files at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_to_pptx/pptx_package/discovery.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/discovery.py"},"region":{"startLine":61}}}],"partialFingerprints":{"codehealthFindingId/v1":"53f4ba23b47cac6d24ba5488d5e1f54a5839e9d0a9e82d9619eea8d6ec373831"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/svg_finalize/embed_icons.py: skills/ppt-master/scripts/svg_finalize/embed_icons.py changed 7 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is embed_icons.process_svg_file at line 559), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(icons): give each embedded icon instance its own internal IDs\u201D; \u201Cfix(finalize,svg-editor): keep identity, visibility and references through rewrites\u201D; \u201Cfix(embed-icons): detect single-quoted stroke icons as stroke icons\u201D; \u201Cfix(embed-icons): recognize a single-quoted preserve-color marker\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/svg_finalize/embed_icons.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_icons.py"},"region":{"startLine":559}}}],"partialFingerprints":{"codehealthFindingId/v1":"01a6db75b37b8013682e5920f5a8f70f865c7e0e0bdc296393a8bd4cee8af909"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_volcengine.py: skills/ppt-master/scripts/image_backends/backend_volcengine.py changed 6 times in last 90 days and 5 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is backend_volcengine.generate at line 213), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): support Seedream 5.0 on Volcengine and default to Ark\u201D; \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-backends): correct Qwen 2K ratios, Ark base URL, Replicate 21:9\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_volcengine.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_volcengine.py"},"region":{"startLine":213}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d42c6bc3782f97d1ed07047c5b4b8f4b7e83b74f51cf76758d4ad0904c1ab1d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_stability.py: skills/ppt-master/scripts/image_backends/backend_stability.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is backend_stability.generate at line 140), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image-gen): write each image once in its filename\u0027s format\u201D; \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_stability.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_stability.py"},"region":{"startLine":140}}}],"partialFingerprints":{"codehealthFindingId/v1":"e9876383ab51b4e9869697fcf1538270e08d6c927fd8d8a854b7d5a8efaa03c2"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_minimax.py: skills/ppt-master/scripts/image_backends/backend_minimax.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is backend_minimax._generate_image at line 166), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D; \u201Cfix(image-gen): handle documented image_urls response shape in MiniMax backend\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_minimax.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_minimax.py"},"region":{"startLine":166}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e3d2c83f5390757b4171e5a3c3675202f58a4e6b91c297ddd1a6a9367d8857f"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_qwen.py: skills/ppt-master/scripts/image_backends/backend_qwen.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is backend_qwen._generate_image at line 141), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-backends): correct Qwen 2K ratios, Ark base URL, Replicate 21:9\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_qwen.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_qwen.py"},"region":{"startLine":141}}}],"partialFingerprints":{"codehealthFindingId/v1":"900acd2ca9002b796213f08bd73cff132b91c8f56eafe67a58d28c56b8f7524e"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_replicate.py: skills/ppt-master/scripts/image_backends/backend_replicate.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is backend_replicate._generate_image at line 105), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-backends): correct Qwen 2K ratios, Ark base URL, Replicate 21:9\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_replicate.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_replicate.py"},"region":{"startLine":105}}}],"partialFingerprints":{"codehealthFindingId/v1":"29400af5c102565f37f8dd331f19d84e02cccab287b8a4494b6ad53e3a0d2747"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/pptx_ooxml/analyzer.py: skills/ppt-master/scripts/pptx_ooxml/analyzer.py changed 5 times in last 90 days and 4 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 10 (its worst body is analyzer._slot_role at line 143), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(pptx): exclude and report author-hidden content across intake paths\u201D; \u201Cfix(pptx_intake): report grouped shapes in slide space by applying every enclosing grpSp transform\u201D; \u201Cfix: PPTX read-back keeps soft line breaks; page types match whole words; beautify keeps run emphasis\u201D; \u201Cfix: preset atoms keep their paint through style compaction; beautify intake ranks sizes by text carried\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/pptx_ooxml/analyzer.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/analyzer.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a525382c69985633fb1e989f5de0040c9e89019b88507f04cc55d6424765df1"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_fal.py: skills/ppt-master/scripts/image_backends/backend_fal.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is backend_fal.generate at line 145), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_fal.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_fal.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"433ac4a7f124ca7c398c0b9ef0c8b2840eaa46c28a0f649ecbcb131a6a32d65d"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_openrouter.py: skills/ppt-master/scripts/image_backends/backend_openrouter.py changed 5 times in last 90 days and 3 of those changes were fix/bug commits, so repair is the majority of this file\u0027s churn. Its max cyclomatic complexity is 14 (its worst body is backend_openrouter.generate at line 169), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_openrouter.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_openrouter.py"},"region":{"startLine":169}}}],"partialFingerprints":{"codehealthFindingId/v1":"10fa555f475cdb54c9cba185c6b65a2208cb6ca91053b3d25f6201b32fa12be5"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_bfl.py: skills/ppt-master/scripts/image_backends/backend_bfl.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\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is backend_bfl.generate at line 180), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_bfl.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_bfl.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"05e1484e2275a36796ab9428b57468be2dca43bbfca0a4e942277fee5111ef1b"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_ideogram.py: skills/ppt-master/scripts/image_backends/backend_ideogram.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\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is backend_ideogram.generate at line 150), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_ideogram.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_ideogram.py"},"region":{"startLine":150}}}],"partialFingerprints":{"codehealthFindingId/v1":"8b3c5c97febc505bab45637fe0570905a6510a463ec49c008cbc64f7ea4b4c71"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_modelscope.py: skills/ppt-master/scripts/image_backends/backend_modelscope.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\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is backend_modelscope.generate at line 152), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_modelscope.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_modelscope.py"},"region":{"startLine":152}}}],"partialFingerprints":{"codehealthFindingId/v1":"7a0cde743926a04b2204312ebf0ae0adb40abda356754aee53462ce5d6049516"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_siliconflow.py: skills/ppt-master/scripts/image_backends/backend_siliconflow.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\u0027s churn. Its max cyclomatic complexity is 9 (its worst body is backend_siliconflow.generate at line 145), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_siliconflow.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_siliconflow.py"},"region":{"startLine":145}}}],"partialFingerprints":{"codehealthFindingId/v1":"5b4d52eb0424f28f892ecf525bd95af730153b24cde60868e993845e89f26bc6"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_tencent.py: skills/ppt-master/scripts/image_backends/backend_tencent.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\u0027s churn. Its max cyclomatic complexity is 15 (its worst body is backend_tencent._generate_image at line 136), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image): keep fitted sizes inside ratio limits for any W:H\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_tencent.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_tencent.py"},"region":{"startLine":136}}}],"partialFingerprints":{"codehealthFindingId/v1":"f14e6cf415aa4cbb812c42788b1aa9a02f79bc56d97e2430e653b5b8bd224257"}},{"ruleId":"D15","level":"warning","message":{"text":"Repeated repair: skills/ppt-master/scripts/image_backends/backend_zhipu.py: skills/ppt-master/scripts/image_backends/backend_zhipu.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\u0027s churn. Its max cyclomatic complexity is 8 (its worst body is backend_zhipu.generate at line 171), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn \u00D7 complexity hotspot \u2014 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: \u201Cfix(image): bound Retry-After waits and honor them in every backend\u201D; \u201Cfix(image): honor Retry-After when the manifest requeues rate-limited items\u201D; \u201Cfix(image-generation): stop retrying permanent backend failures\u201D. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-15..2026-11-13, the 90 days ending at the analysed commit. Reproduce with \u0060git log --since=\u00272026-08-15 10:54:44 \u002B00:00\u0027 --until=\u00272026-11-13 10:54:44 \u002B00:00\u0027 --full-history --no-merges -- skills/ppt-master/scripts/image_backends/backend_zhipu.py\u0060: 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 \u2014 a difference of several commits on a file whose history was re-landed or reverted inside the window."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_zhipu.py"},"region":{"startLine":171}}}],"partialFingerprints":{"codehealthFindingId/v1":"344e8addf940f6b4a5c2e259a05a0932f1316308779670541d80103abba22205"}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"6998c2838dd1aad75e71985df4139bad07fc14a8dbb7f96a4d9d40f736a4fa25"},"properties":{"dependency":{"package":"pillow","version":"9.0.0","advisory":"[GHSA redacted]","aliases":["A-299477569","ASB-A-299477569","BIT-pillow-2022-22817","BIT-pillow-2022-24303","BIT-pillow-2022-45198","BIT-pillow-2022-45199","BIT-pillow-2023-44271","BIT-pillow-2023-50447","BIT-pillow-2024-28219","BIT-pillow-2026-112390","BIT-pillow-2026-112391","BIT-pillow-2026-112392","BIT-pillow-2026-112393","BIT-pillow-2026-112394","BIT-pillow-2026-112395","BIT-pillow-2026-112397","BIT-pillow-2026-112398","BIT-pillow-2026-112399","BIT-pillow-2026-112401","BIT-pillow-2026-112402","BIT-pillow-2026-112403","BIT-pillow-2026-112404","BIT-pillow-2026-112406","BIT-pillow-2026-112892","BIT-pillow-2026-112894","BIT-pillow-2026-112895","BIT-pillow-2026-112896","BIT-pillow-2026-112897","BIT-pillow-2026-112900","BIT-pillow-2026-112901","BIT-pillow-2026-42308","BIT-pillow-2026-42310","BIT-pillow-2026-54058","BIT-pillow-2026-54059","BIT-pillow-2026-54060","BIT-pillow-2026-55379","BIT-pillow-2026-55380","BIT-pillow-2026-55798","BIT-pillow-2026-59197","BIT-pillow-2026-59198","BIT-pillow-2026-59199","BIT-pillow-2026-59200","BIT-pillow-2026-59204","BIT-pillow-2026-59205","BIT-pillow-2026-96636","BIT-pillow-2026-96637","BIT-pillow-2026-96640","BIT-pillow-2026-96641","BIT-pillow-2026-96642","BIT-pillow-2026-96644","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2022-10","PYSEC-2022-168","PYSEC-2022-42979","PYSEC-2022-42980","PYSEC-2023-175","PYSEC-2023-227","PYSEC-2026-165","PYSEC-2026-1793","PYSEC-2026-1794","PYSEC-2026-2253","PYSEC-2026-2254","PYSEC-2026-2255","PYSEC-2026-2256","PYSEC-2026-2257","PYSEC-2026-2874","PYSEC-2026-3451","PYSEC-2026-3453","PYSEC-2026-3454","PYSEC-2026-3493","PYSEC-2026-3494","PYSEC-2026-3495","PYSEC-2026-3496","PYSEC-2026-4326","PYSEC-2026-4327","PYSEC-2026-4329","PYSEC-2026-4330","PYSEC-2026-4331","PYSEC-2026-4332","PYSEC-2026-4334","PYSEC-2026-4335","PYSEC-2026-4337","PYSEC-2026-4338","PYSEC-2026-4340","PYSEC-2026-4341","PYSEC-2026-4343","PYSEC-2026-4363","PYSEC-2026-457","RUSTSEC-2023-0060","RUSTSEC-2023-0061"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/analyze_images.py","line":31}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"8aa2b4fea35e38687be51668a4fad048b1a1ab524197b2d5b0adadd7f7e365e5"},"properties":{"dependency":{"package":"nbconvert","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-1691","PYSEC-2026-2229","PYSEC-2026-2230"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/source_to_md/doc_to_md.py","line":1510}}}},{"ruleId":"D30","level":"error","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"18704b77d50d76fcbf6da4972ea7184232b8e3709af6e945c3eecae394e4806b"},"properties":{"dependency":{"package":"curl-cffi","version":"0.7.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-2431"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/source_to_md/_dispatcher.py","line":96}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"ba06fb2a4ba368e7257aeccf178f4a2b6710abdd7e3f113449aa51e8a80ad30e"},"properties":{"dependency":{"package":"numpy","version":"1.20.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[GHSA redacted]","PYSEC-2021-854","PYSEC-2021-855"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/gemini_watermark_remover.py","line":36}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"cfb7c1a96aa428f6c9ee0e0590134c37e83237985a1bb92dbba832fbdf765eef"},"properties":{"dependency":{"package":"requests","version":"2.31.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","[CVE redacted]","[CVE redacted]","[GHSA redacted]","[GHSA redacted]","PYSEC-2026-1872","PYSEC-2026-1873","PYSEC-2026-2275"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/image_backends/backend_bfl.py","line":30}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"68133e6b1b89aff605e93a78743915300522c648e4d1a515d3a999614fb9e3f3"},"properties":{"dependency":{"package":"mammoth","version":"1.6.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]","PYSEC-2026-1603"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/source_to_md/doc_to_md.py","line":969}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"5d8bd4e5702f7e3f35cab2ef36694cfa9d7c0bb56ce212f56d62f7cbea0ab48b"},"properties":{"dependency":{"package":"markdownify","version":"0.11.6","advisory":"PYSEC-2026-1604","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/source_to_md/doc_to_md.py","line":1225}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"78834919ac9df11fc4c1e0e581d8dae587ec8e752d479cd9c80e4a3c464c34ff"},"properties":{"dependency":{"package":"flask","version":"3.0.0","advisory":"PYSEC-2026-2151","aliases":["[CVE redacted]","[GHSA redacted]"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/confirm_ui/server.py","line":50}}}},{"ruleId":"D30","level":"warning","message":{"text":"A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."},"partialFingerprints":{"codehealthFindingId/v1":"e0a27c058175c8b76580974a1a398dfe8cca41df2dd029acc322420b1d3db916"},"properties":{"dependency":{"package":"nbconvert","version":"7.0.0","advisory":"[GHSA redacted]","aliases":["[CVE redacted]"],"reachability":{"kind":"production","file":"skills/ppt-master/scripts/source_to_md/doc_to_md.py","line":1510}}}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: error_helper.py \u2194 svg_quality_checker.py: \u0060skills/ppt-master/scripts/error_helper.py\u0060 and \u0060skills/ppt-master/scripts/svg_quality_checker.py\u0060 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 \u2014 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 \u2014 a sibling reference still needs an import \u2014 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 \u0060a41ff009\u0060 docs(svg-authoring): allow static local use references; \u0060835ea017\u0060 docs(svg-authoring): allow CSS alpha colors; \u0060813505aa\u0060 docs(svg-authoring): allow approximate group opacity \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/error_helper.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4bf30e8d773276218440f37c20e3fb95bcdea42f4120382918603d2ccb7d90a8"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: flatten_tspan.py \u2194 elements.py: \u0060skills/ppt-master/scripts/svg_finalize/flatten_tspan.py\u0060 and \u0060skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py\u0060 change together 54% of the time (13 of the 24 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well \u2014 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 \u2014 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 \u2014 the registration is the link, and it is meant not to be an import \u2014 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 \u00603d1b7dc6\u0060 fix(svg-to-pptx): preserve text baselines across SVG and PPTX conversion; \u0060397c5d92\u0060 fix(scripts): keep single-child group rotation, carry inline tspan dx\u2026; \u00605a46c0cf\u0060 feat(svg-to-pptx): add native superscript and subscript runs \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/flatten_tspan.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"1d776c9fab370ca128a46be488cd2bd9b449ad6b0670baf3b966954bf18f85de"}},{"ruleId":"D35","level":"warning","message":{"text":"Change coupling: config.py \u2194 error_helper.py: \u0060skills/ppt-master/scripts/config.py\u0060 and \u0060skills/ppt-master/scripts/error_helper.py\u0060 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 \u2014 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 \u2014 a sibling reference still needs an import \u2014 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 \u0060a41ff009\u0060 docs(svg-authoring): allow static local use references; \u0060835ea017\u0060 docs(svg-authoring): allow CSS alpha colors; \u0060813505aa\u0060 docs(svg-authoring): allow approximate group opacity \u2014 run \u0060git show\u0060 on any of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/config.py"},"region":{"startLine":1}}}],"partialFingerprints":{"codehealthFindingId/v1":"4036f1342ffbdf0f1d825f9e1ea916ffead88472c417c7ee8b95f6f78d50e775"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2121}}}],"partialFingerprints":{"codehealthFindingId/v1":"d184268d3ac833cf283b60c04e486e9f17ad3b4fd37708997dc23b5c9a0cb1d9"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2122}}}],"partialFingerprints":{"codehealthFindingId/v1":"8f54dcc76bf1f283a8ef6449e176ed17d91cdd806ceb4c6a1c8b6434ea3e830b"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2125}}}],"partialFingerprints":{"codehealthFindingId/v1":"b555d68fd44cab1f805cffb3cad77ee65bd4fb2544eb83258056214db1958ccf"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2126}}}],"partialFingerprints":{"codehealthFindingId/v1":"12a900643ba5ca8afeeb6446ecbb53bd46595733c21f22834ede4ca46ef5cf92"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2143}}}],"partialFingerprints":{"codehealthFindingId/v1":"4b05a508d5c187c9ed6d431f59a3402b197ec7a4345e721b7b9275c580e716ed"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2253}}}],"partialFingerprints":{"codehealthFindingId/v1":"f566a923a2bbfcc4d0b1c83904170cfcbf77a7ef10070f951d413fcd2db9e126"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2256}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bdd49adcf41d2c9ab11314fca7f50f0a37d9f4c151a10b25bb15abf9072bc47"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2262}}}],"partialFingerprints":{"codehealthFindingId/v1":"736975eda3d8e554b52db602caead647f8473916eefeae254305d99554d8a54c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2278}}}],"partialFingerprints":{"codehealthFindingId/v1":"de20168fdf06d041a0ffb3ed5e9da79e613cf1db748c32b5f33e96442ca08204"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2294}}}],"partialFingerprints":{"codehealthFindingId/v1":"32dbc86ffed09f834382924669019dba93319d6a4940b26facbfbbebda24de5d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2296}}}],"partialFingerprints":{"codehealthFindingId/v1":"900b250ccde9e24d8d255eaf2ce9ed9de8fed57daaaae2f7cb40032591fbf52c"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Ctextarea\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2300}}}],"partialFingerprints":{"codehealthFindingId/v1":"a4430fb36156212a464a69c732113fc2f1489f01bf0df605ff7ed4ec82ea5b0d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2303}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c38210f0cc20d90f3c540d2d106c54a7d51af57547e1f691146016ebee68dbb"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2937}}}],"partialFingerprints":{"codehealthFindingId/v1":"988763bc6806ee6bfa0532b591b31f95cb7e39e951185f1c33e70d57946a26c7"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2939}}}],"partialFingerprints":{"codehealthFindingId/v1":"1e1cb1bf2df782c2598c532e6a654df4218833eff2f1995b07a67ce65ae740af"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":3012}}}],"partialFingerprints":{"codehealthFindingId/v1":"647aaaf31941ca19f4c457a210476e658864bf5927a24f73c86d4e2e6d5e0bd8"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":3014}}}],"partialFingerprints":{"codehealthFindingId/v1":"850a0062fce635dc06b712eb8b5400bc690f4f25bb2949fcec7fa79361337f1d"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":3019}}}],"partialFingerprints":{"codehealthFindingId/v1":"20c9aeaff6f4d1e4aeafcda8b9ff1365194fdb3eadfa8f0b842a89023fd7ac06"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cselect\u003E without a programmatic label: This control has no associated label. Add a \u003Clabel for\u003E / wrapping \u003Clabel\u003E / aria-label / aria-labelledby so assistive tech can name it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":3026}}}],"partialFingerprints":{"codehealthFindingId/v1":"1518977d8adeb3ea72bdd6955293269a68b82b1b2b60ecc932eeb8587b6310c4"}},{"ruleId":"AC2","level":"error","message":{"text":"\u003Cinput\u003E without a programmatic label: This control has only a placeholder \u2014 a placeholder is not a label (it vanishes on input and many AT ignore it). Add a \u003Clabel for\u003E, a wrapping \u003Clabel\u003E, or aria-label."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":3036}}}],"partialFingerprints":{"codehealthFindingId/v1":"df2c7ceb4c7c96899c046a45df5fe8f3a7e8ea48db330714da6a9c50ddb85ffe"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2108}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ecb6abf22feb485795370520946157ed9669ece3e01a663785073afbe03bdd1"}},{"ruleId":"AC3","level":"warning","message":{"text":"Data table has no header cells: A \u003Ctable\u003E with data cells but no \u003Cth\u003E gives assistive technology no way to associate cells with their headers. Mark the header row/column cells as \u003Cth\u003E (with a scope)."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"7f3f41744a6f0efd102403a99adc033bddb08309d2f40662f2491b456008350f"}},{"ruleId":"AC3","level":"warning","message":{"text":"Page without a main landmark: No \u003Cmain\u003E (or role=\u0022main\u0022) means no \u0022skip to content\u0022 target and a weaker landmark map. Wrap the primary content in \u003Cmain\u003E."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/index.html"},"region":{"startLine":2}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5fb1c7257c9ee07871eb43a0e16926ddc172b6c5e26d305ffd52faeb6298dc5"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (4.2:1): \u0060.pending-status.empty\u0060 sets color: #7a7a9a on background-color: #18182a \u2014 4.2:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/style.css"},"region":{"startLine":343}}}],"partialFingerprints":{"codehealthFindingId/v1":"0c08a3f5c6783a1f556c47ee9cb77b9c888abe486533d1c22a03a4f101a580d1"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (2.8:1): \u0060#btn-add-annotation\u0060 sets color: #fff on background-color: #4a9eff \u2014 2.8:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/style.css"},"region":{"startLine":415}}}],"partialFingerprints":{"codehealthFindingId/v1":"a9b5646ff9ba326abcc4468e3ac64241a0a9d87b217bc337ec4eb60458e29540"}},{"ruleId":"AC6","level":"warning","message":{"text":"Low contrast colour pair in CSS (1.1:1): \u0060body\u0060 sets color: #1d2430 on background-color: #1a1a2e \u2014 1.1:1, below the 4.5:1 WCAG AA minimum for normal text. Darken or lighten one of them."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/style.css"},"region":{"startLine":35}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d67c3dd6122e0ce29c8f6aed824820941a2dbe2962ed24658f6e1d4f4be5840"}},{"ruleId":"M2","level":"note","message":{"text":"No ADRs: No Architecture Decision Records found \u2014 no conventional ADR directory, no numbered \u0060NNNN-title\u0060 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."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"670b3d6e36a756d63097d0dfbf90afd5fc761308800b9354894a07c3f4e4aa14"}},{"ruleId":"P1","level":"warning","message":{"text":"No CI pipeline: No CI workflow found (.github/workflows, azure-pipelines.yml, .gitlab-ci.yml, \u2026) \u2014 changes aren\u0027t gated by an automated build/test."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"44f01af96e50474fba2df84d95ddf4f7e1d34c29c307830b9efc9057daa6b670"}},{"ruleId":"P3","level":"note","message":{"text":"No SAST: No static application security testing detected. For this repository\u0027s stack, add bandit, \u0060semgrep --config=p/python\u0060, or CodeQL\u0027s python pack \u2014 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\u0027s web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen \u2014 if that is your case the row is wrong, and saying so is more useful than adding a second scanner."},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"6e54424179c892f03ef2fd003130ac4bd43f39bbf3b1ca0a0143e25acb80ec87"}},{"ruleId":"P6","level":"note","message":{"text":"No changelog: No CHANGELOG/HISTORY/RELEASES file \u2014 what shipped when isn\u0027t easy to reconstruct for support or audit. (Versioning/tagging makes releases traceable, but a changelog records the what.)"},"locations":[],"partialFingerprints":{"codehealthFindingId/v1":"dda5aa5aed8cbb292c3ef2b733bc138f614293ae6426c85e98bf31ef330d9415"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060(e.key === \u0022ArrowDown\u0022 || e.key === \u0022ArrowUp\u0022) \u0026\u0026 langMenu.hidden\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/static/app.js, skills/ppt-master/scripts/svg_editor/static/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4563}}}],"partialFingerprints":{"codehealthFindingId/v1":"603d4153d512fa9c13bef71711a1167dd083a6d6bccb631ed76d6b8b8062b6b3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060/\\bhant\\b/.test(nav) || /\\b(tw|hk|mo)\\b/.test(nav)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/static/app.js, skills/ppt-master/scripts/svg_editor/static/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":726}}}],"partialFingerprints":{"codehealthFindingId/v1":"07f949e800df3724edbad694545102d4d7abad5d31f5ca11b8c2412e14c8322d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060LANG === \u0022zh\u0022 || LANG === \u0022zh-TW\u0022 || LANG === \u0022ja\u0022\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/static/app.js, skills/ppt-master/scripts/svg_editor/static/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":740}}}],"partialFingerprints":{"codehealthFindingId/v1":"3d47324974beac1f4f834f26e688f4c7f53ea6006b9a8376dcc54df727e4b4f1"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060e.key === \u0022ArrowLeft\u0022 || e.key === \u0022ArrowRight\u0022\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/static/app.js, skills/ppt-master/scripts/svg_editor/static/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4594}}}],"partialFingerprints":{"codehealthFindingId/v1":"97c31c1c90b72842918a8b8220be48d8533b14c47b70a6ebbc297f3e4d679989"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060items[idx - 1] || items[items.length - 1]\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/static/app.js, skills/ppt-master/scripts/svg_editor/static/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4587}}}],"partialFingerprints":{"codehealthFindingId/v1":"4e60503c292733fe886dea23ab5e81f5157ca35df9a98f43d5063bf6cb3fb7b5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060langMenu.querySelector(\u0022li.selected\u0022) || langMenu.querySelector(\u0022li[data-lang]\u0022)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/static/app.js, skills/ppt-master/scripts/svg_editor/static/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4537}}}],"partialFingerprints":{"codehealthFindingId/v1":"9e228d82327b2e752aee5df0b158a0bc57ea520b4d6723b125df67a015243309"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060navigator.language || navigator.userLanguage || \u0022en\u0022\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/static/app.js, skills/ppt-master/scripts/svg_editor/static/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":723}}}],"partialFingerprints":{"codehealthFindingId/v1":"f7a9a80eb8302aeaed95c102446d50178fde43b13d43279fb7f7107b7f33ea49"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060stored === \u0022zh\u0022 || stored === \u0022en\u0022 || stored === \u0022ja\u0022 || stored === \u0022zh-TW\u0022\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/static/app.js, skills/ppt-master/scripts/svg_editor/static/app.js. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":720}}}],"partialFingerprints":{"codehealthFindingId/v1":"95bd39c9d5eef19926126f3d37b39316c6d8f62a388dcc1759533c5e4b9e3649"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ASPECT_RATIO_SIZE_MAP.get(normalized_size) or ASPECT_RATIO_SIZE_MAP[\u00221K\u0022]\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/image_backends/backend_modelscope.py, skills/ppt-master/scripts/image_backends/backend_siliconflow.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_modelscope.py"},"region":{"startLine":160}}}],"partialFingerprints":{"codehealthFindingId/v1":"00498f3a88582fdb20276c68fb43d4c3bc97151775eaa130719bfbe5a6d7f12a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_expand_local_use_references is not None and _UseExpansionError is not None\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":4576}}}],"partialFingerprints":{"codehealthFindingId/v1":"ed114b0ce7e3091f2c7199f458b060c39e61374f8b276fa601a65be505ac3235"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_local(attr_name) == \u0022href\u0022 and value.startswith(\u0022#\u0022) and len(value) \u003E 1\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/extract_svg_assets.py, skills/ppt-master/scripts/extract_svg_pictures.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/extract_svg_assets.py"},"region":{"startLine":193}}}],"partialFingerprints":{"codehealthFindingId/v1":"cd11a52849661a2974c03d1e0b7dfda1e7eb812c19571b1a58ce96722922c47d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_local_name(child.tag) == \u0022style\u0022 or not child.get(\u0022id\u0022)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/svg_authoring_view.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1388}}}],"partialFingerprints":{"codehealthFindingId/v1":"375af062e7bfb02e0b3d112968b1e7e8e905c5417982e3361fd433d2fc5fd53e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060_local_name(name) == \u0022href\u0022 and value.startswith(\u0022#\u0022)\u0060 appears character-identically in 3 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"02110e1113726154fc24908b3d9d39db46723c6ee436eec3ea5eaa9291c8119d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060attempt \u003C max_retries and is_rate_limit_error(e)\u0060 appears character-identically in 3 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_gemini.py"},"region":{"startLine":337}}}],"partialFingerprints":{"codehealthFindingId/v1":"84a158d6d88d7924a7bdb1054e253769e4dfa96b9a51552ce58b319940368343"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060body_pr is None or body_pr.attrib or list(body_pr)\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2543}}}],"partialFingerprints":{"codehealthFindingId/v1":"3f5a14fbc93489655ee28bfff1b5074244efadef4b313c752e410ddb77b166f6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060boundaries and start \u003C boundaries[-1][\u0022offset\u0022]\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_cosyvoice.py"},"region":{"startLine":196}}}],"partialFingerprints":{"codehealthFindingId/v1":"a404ede2d42aac64fb5e2242a2b88e78733ba418959044a1bcaef95fd0927554"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060candidate.discovery_query or request.query\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/image_search.py, skills/ppt-master/scripts/image_sources/provider_common.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":967}}}],"partialFingerprints":{"codehealthFindingId/v1":"f71e91fccfa0b4f78b83861e13f0d4d7e8539e0c529b4c2aae06f41759b15586"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060ea is not None and ea.attrib.get(\u0022typeface\u0022)\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":180}}}],"partialFingerprints":{"codehealthFindingId/v1":"50642b67cc48ab6cc21b2f9994c5b3618e572f28ae582575dbca9f1fce5e820c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060elem.get(\u0022display\u0022) == \u0022none\u0022 or elem.get(\u0022visibility\u0022) == \u0022hidden\u0022\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_style.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ed458175b7bc27f3c5e54225e7566a5ea5c3305c8de90c0ddc993306ae7feb0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060elem.get(\u0027id\u0027) or elem.get(\u0027data-name\u0027) or \u0027\u003Cunnamed\u003E\u0027\u0060 appears character-identically in 3 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":6040}}}],"partialFingerprints":{"codehealthFindingId/v1":"9afeb3987db786608e219374fc3889ebbecf13b59daf7e00092e165fe88b9318"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060existing and _process_alive(_lock_pid(existing))\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/server.py, skills/ppt-master/scripts/svg_editor/server.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2905}}}],"partialFingerprints":{"codehealthFindingId/v1":"23ed1ebe2589915fd23ab2b864690f90f65f20b3bc354e9e21fe1a1ce7671f69"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected is None or expected != expected.strip() or _SHA256_RE.fullmatch(expected) is None\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/mirror_template_materialize.py, skills/ppt-master/scripts/svg_authoring_view.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1381}}}],"partialFingerprints":{"codehealthFindingId/v1":"16cc5c2fba3a6e72375ea39915bb3e3d62ae54f6e738553f96e9bbd40ed87bcc"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060expected_format and expected_format in CANVAS_FORMATS\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/project_utils.py, skills/ppt-master/scripts/svg_quality/checker.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_utils.py"},"region":{"startLine":719}}}],"partialFingerprints":{"codehealthFindingId/v1":"a41d99c24a6266848c9ae52e968962532281c6167ad099fa5de3042a764717a6"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060fm.get(KIND_CONFIG[kind][\u0022id_key\u0022]) or \u0022\u0022\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/apply_template.py, skills/ppt-master/scripts/register_template.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":142}}}],"partialFingerprints":{"codehealthFindingId/v1":"c3b3d5aefe24110de86ca7d572a1017a31bfe2b4e0885dc044864d42a68ce385"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060host.startswith(\u0027[\u0027) or host.count(\u0027:\u0027) == 1\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/confirm_ui/server.py, skills/ppt-master/scripts/svg_editor/server.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":2331}}}],"partialFingerprints":{"codehealthFindingId/v1":"b7a7466e4153de286d0416340662ffc35e98ce608857f82cf9b72c749af7a82d"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060href is not None and xlink_href is not None\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/hyperlink_contract.py"},"region":{"startLine":154}}}],"partialFingerprints":{"codehealthFindingId/v1":"9d905829e048b4ccee8aaa1f5d29fe272175b4393e2bed16ed82f0296bd9d9c3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060image.get(\u0027href\u0027) or image.get(f\u0027{{{XLINK_NS}}}href\u0027)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_finalize/align_embed_images.py, skills/ppt-master/scripts/svg_quality/checker.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":323}}}],"partialFingerprints":{"codehealthFindingId/v1":"0bc7d455b691896dc672d50a9d2266d509528f5e90a2ba52cbac7017cf539a93"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(item, dict) and isinstance(item.get(\u0022index\u0022), int)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/mirror_template_materialize.py, skills/ppt-master/scripts/pptx_to_svg/converter.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/mirror_template_materialize.py"},"region":{"startLine":1094}}}],"partialFingerprints":{"codehealthFindingId/v1":"6c697b62bd1cbf6354909c4fb9978ba4ef14b88e6a8fd22faec0b4b79035a439"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(name, str) and name.startswith(f\u0022{{{NS[\u0027r\u0027]}}}\u0022)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py, skills/ppt-master/scripts/pptx_to_svg/slide_to_svg.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2789}}}],"partialFingerprints":{"codehealthFindingId/v1":"bb16f1f729804f0b4793b7083f438e4922147e565934267e0bccfa8538218e00"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(name, str) and name.startswith(f\u0022{{{_RELATIONSHIPS_NAMESPACE}}}\u0022)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_effects.py, skills/ppt-master/scripts/pptx_gradients.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_effects.py"},"region":{"startLine":148}}}],"partialFingerprints":{"codehealthFindingId/v1":"30672ef47907d1a0fdbc69de4ad5cf3aff457d2874b6de79c915a94346e8cc68"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(name, str) and name.startswith(f\u0022{{{rel_ns}}}\u0022)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py, skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":267}}}],"partialFingerprints":{"codehealthFindingId/v1":"665547155f14d9c16203c73e7671791e0bd2cd7cb3ee5e04cd2ee4043787e79e"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(order, bool) or not isinstance(order, int) or order \u003C= 0\u0060 appears character-identically in 3 files \u2014 skills/ppt-master/scripts/narration_sync.py, skills/ppt-master/scripts/svg_to_pptx/animation_config.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":964}}}],"partialFingerprints":{"codehealthFindingId/v1":"6ade2561e349e16c596373f865ec943998e2726bfd2c2b5f0b219f258db8e90a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, (int, float)) and not isinstance(value, bool)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/source_to_md/excel_to_md.py, skills/ppt-master/scripts/svg_to_pptx/native_objects/workbook.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/excel_to_md.py"},"region":{"startLine":135}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f07c89fb33278c7976ba7b0a07df01509e6aef96a1fbe9e9640bbb46f033df8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, (int, float))\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_animations.py, skills/ppt-master/scripts/video_motion_plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":510}}}],"partialFingerprints":{"codehealthFindingId/v1":"84bd93ae9efc323b2c88bff0321e70a13899db39b2a5c6e5f676b8b405d9e2ec"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, int) or value \u003C 0\u0060 appears character-identically in 3 files \u2014 skills/ppt-master/scripts/svg_quality/checker.py, skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py, skills/ppt-master/scripts/video_motion_plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":10280}}}],"partialFingerprints":{"codehealthFindingId/v1":"a56ec9a1e2819e981ddcf20f3c95bd3add87fdc371bba3484b2d3802f0a716e9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, bool) or not isinstance(value, int) or value \u003C= 0\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py, skills/ppt-master/scripts/video_motion_plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":432}}}],"partialFingerprints":{"codehealthFindingId/v1":"60fdab5830d3e5c1d395dfee6a6c31dc2f276ff2b585f9242f1b8c9bb07c2640"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060isinstance(value, str) and value.strip()\u0060 appears character-identically in 3 files \u2014 skills/ppt-master/scripts/svg_quality/checker.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2070}}}],"partialFingerprints":{"codehealthFindingId/v1":"b495d29c78ccb59f14689243ff015ae649e2bc3d0098ada0f33a1996786bb041"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060item.layer == \u0022slide\u0022 and item.is_background\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":3568}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b53fe14bef1a4842cff96536c476253270c8d08ede0eab8cd85c8021d7b89ed"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060latin is not None and latin.attrib.get(\u0022typeface\u0022)\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":177}}}],"partialFingerprints":{"codehealthFindingId/v1":"fcb4cf1da4f5056e29fa517ae86a3ac677322c64cfb9ef0e93549ee273d44996"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(children) != 1 or children[0].tag != f\u0027{{{SVG_NS}}}image\u0027\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py, skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":5321}}}],"partialFingerprints":{"codehealthFindingId/v1":"c73f6d5c5f4e80789ac9ae066aa94eccbaa135597c87384723147bbf3ca2730c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060len(operations) != 1 or operations[0][0] != \u0027rotate\u0027\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py, skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":581}}}],"partialFingerprints":{"codehealthFindingId/v1":"b0a16cdb7470f686c68e52d0b1d9abce3a3ded64fe70ac018f8c383b33a054f3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060max_dimension and max(target_w, target_h) \u003E max_dimension\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_finalize/align_embed_images.py, skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":225}}}],"partialFingerprints":{"codehealthFindingId/v1":"672d6edec131eb7db09c11878042d8cf1734ee135cb37bd2c9dfefcf1410f3f8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name in explicit_options and explicit_options[name] != alias_value\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_animations.py, skills/ppt-master/scripts/pptx_transitions.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":677}}}],"partialFingerprints":{"codehealthFindingId/v1":"1ce658630130be6ce11351b65696b2cace77b6017915cf1a25035fbde3eade36"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060name.rsplit(\u0027}\u0027, 1)[-1] == \u0027href\u0027 and value.startswith(\u0027#\u0027)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_editor/annotations.py, skills/ppt-master/scripts/svg_finalize/embed_icons.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/annotations.py"},"region":{"startLine":40}}}],"partialFingerprints":{"codehealthFindingId/v1":"784b091aa92849802676d68ca239300c0aabd470338f37c786660baee9073c25"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060node.subscript is not None or node.superscript is not None\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py, skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_omml.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/formula_ast.py"},"region":{"startLine":389}}}],"partialFingerprints":{"codehealthFindingId/v1":"3288495f067836062955abc11dbe6a2ab97f785a14b68847f6554369e8df21cb"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not _path_lexists(backup_dir) and _path_lexists(output_dir)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/finalize_svg.py, skills/ppt-master/scripts/pptx_to_svg/converter.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/finalize_svg.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"49090f9fa4aa1d00dfa51a6e7c1ec735d230eb283e0f2e77e8634d68d1a5c768"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not asset_path.is_file() or asset_path.suffix.lower() != \u0022.svg\u0022\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/mirror_template_materialize.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":850}}}],"partialFingerprints":{"codehealthFindingId/v1":"144e14ab3b517584f0b92fdf2944110aa19a65953e444af3a401afe8f8398d80"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not element.get(\u0022id\u0022) or not element.get(\u0022data-pptx-object\u0022)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/svg_authoring_view.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1284}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb7a1d289eb843cf91ce40a579574c497d33e8d6872122d946a3fc499be41e03"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(encoded, str) or not isinstance(expected_sha, str)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py, skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_xml.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/__init__.py"},"region":{"startLine":126}}}],"partialFingerprints":{"codehealthFindingId/v1":"52c59c1b7d18dd9e51cfde66f6e8a5cb700b8bb08a2410a2c6dbe7bd1ffaad65"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(group_id, str) or not group_id.strip()\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/narration_sync.py, skills/ppt-master/scripts/video_motion_plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/narration_sync.py"},"region":{"startLine":436}}}],"partialFingerprints":{"codehealthFindingId/v1":"0dded0e29760e845d0b1966e64b1f89ddb6449788d56ae8ecdab91953316b78a"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(item[field], str) or not item[field].strip()\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/image_gen.py, skills/ppt-master/scripts/image_search.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":664}}}],"partialFingerprints":{"codehealthFindingId/v1":"b6637ff3101a6217045bc2c4b84c9293c0e4c52786029c4ad04cc110e155af64"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(items, list) or not items\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/image_gen.py, skills/ppt-master/scripts/image_search.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_gen.py"},"region":{"startLine":650}}}],"partialFingerprints":{"codehealthFindingId/v1":"bceecbde8bfd71209a23821049ac09881951e164bc68bd5c7b187c28c8ff0d71"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(name, str) or not name.strip()\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_animations.py, skills/ppt-master/scripts/pptx_transitions.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":843}}}],"partialFingerprints":{"codehealthFindingId/v1":"3a006b4bb2bd639b5d87ae8c3e34778677b8f24fd818f2d0b0976429eb689ae3"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(node.tag, str) or not node.tag.startswith( f\u0022{{{_DML_NAMESPACE}}}\u0022 )\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_effects.py, skills/ppt-master/scripts/pptx_gradients.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_effects.py"},"region":{"startLine":143}}}],"partialFingerprints":{"codehealthFindingId/v1":"27cfe8f1e7164f698f9cceca7633f1db8bf2fed7fdcf90963bcbb35e281e9707"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(raw, str) or not raw.strip()\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py, skills/ppt-master/scripts/video_motion_plan.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/native_objects/table.py"},"region":{"startLine":386}}}],"partialFingerprints":{"codehealthFindingId/v1":"b858beab93cd1f2d61bc2b5730d01a0654ab3bf87907a453f85a7953240d2036"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(raw_slides, list) or not raw_slides\u0060 appears character-identically in 4 files \u2014 skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_structure.py, skills/ppt-master/scripts/video_motion_plan.py, skills/ppt-master/scripts/video_sound_mix.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":285}}}],"partialFingerprints":{"codehealthFindingId/v1":"faa1e790f8c1c464be5ac2699b07a52201af230f1e6693f1c1ba3a6eff413270"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(raw_sound, str) or not raw_sound.strip()\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/animation_config.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1476}}}],"partialFingerprints":{"codehealthFindingId/v1":"933c2183f82f1ec928a7d1df2579e6602144f2237ad6d77c686cd8c312146096"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(source_ref, str) or not isinstance(ref_raw, dict)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/mirror_template_materialize.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":507}}}],"partialFingerprints":{"codehealthFindingId/v1":"2a568007f473413bd6a4bba2441a94af1c003a2eaed79bfba3c678c10c7b541f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(trigger_shape, str) or not trigger_shape.strip()\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/animation_config.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1259}}}],"partialFingerprints":{"codehealthFindingId/v1":"3ea4158c7c5df8cde0a864a2ae0bc1f9aefffd6a215ba35bb406a3370ba7b9c5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not isinstance(value, str) or not value.strip()\u0060 appears character-identically in 9 files \u2014 skills/ppt-master/scripts/confirm_ui/server.py, skills/ppt-master/scripts/image_search.py, skills/ppt-master/scripts/language_tags.py, skills/ppt-master/scripts/mirror_template_materialize.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1340}}}],"partialFingerprints":{"codehealthFindingId/v1":"a1d2e45d79ee266944a7bc7e95d255b997755c8dc079f8de9f737d241e7dc270"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not math.isfinite(raw_milliseconds) or raw_milliseconds \u003E MAX_OOXML_MILLISECONDS\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_animations.py, skills/ppt-master/scripts/pptx_transitions.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_animations.py"},"region":{"startLine":710}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ee7adca8ac9badff6c7d9912b006c803e0d606f983b7b1686988d04657d4736"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not rel_id or not rel_type or not target\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_workspace.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":814}}}],"partialFingerprints":{"codehealthFindingId/v1":"5205d7f84be5299437b77da253fe449cc39739c4728505bb23bcb505228120b4"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060not x_values or len(x_values) != len(y_values)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py, skills/ppt-master/scripts/svg_to_pptx/native_objects/chart_data.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2935}}}],"partialFingerprints":{"codehealthFindingId/v1":"d726a849725678bdc16562b19f86735393c5ce0dd10d5d80a6c9e0c6392c54c9"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060number_format is not None and number_format.get(\u0022formatCode\u0022)\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py, skills/ppt-master/scripts/source_to_md/ppt_to_md.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chart_to_svg.py"},"region":{"startLine":2383}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee8e8922d56f13737c2a44890248fb68a7b91b4c2dd0bb46b09479ee35ab24af"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060output_dir.exists() and not output_dir.is_dir()\u0060 appears character-identically in 3 files \u2014 skills/ppt-master/scripts/source_to_md.py, skills/ppt-master/scripts/source_to_md/_batch.py, skills/ppt-master/scripts/svg_authoring_view.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md.py"},"region":{"startLine":495}}}],"partialFingerprints":{"codehealthFindingId/v1":"9f799e4350b7c824aab9d73489f423a3c705f78aefeb0b46da9270571b859501"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060owner is None or id(owner) in selected_owners\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/svg_authoring_view.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1409}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2ce23aeb8f2d5db98189b034cf30c2074eccb90cbb8d9cee3afbe3b43918c47"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parent is not None and parent is not root\u0060 appears character-identically in 3 files \u2014 skills/ppt-master/scripts/stamp_native_fallbacks.py, skills/ppt-master/scripts/svg_quality/checker.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/stamp_native_fallbacks.py"},"region":{"startLine":85}}}],"partialFingerprints":{"codehealthFindingId/v1":"497a7143bd82919ffe73afd88c4ae5a029794a3a9e7dd72b4e92d2c8c7c78e0f"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.scheme or parsed.netloc or not parsed.path\u0060 appears character-identically in 7 files \u2014 skills/ppt-master/scripts/authoring_roundtrip.py, skills/ppt-master/scripts/extract_svg_assets.py, skills/ppt-master/scripts/extract_svg_pictures.py, skills/ppt-master/scripts/mirror_template_materialize.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/authoring_roundtrip.py"},"region":{"startLine":1051}}}],"partialFingerprints":{"codehealthFindingId/v1":"18a2f5961908ae434030b9d447de72320c985ced373ee6c1608f19ec36446cc5"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060parsed.scheme or parsed.netloc or parsed.query or parsed.fragment\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/resource_paths.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/template_validation.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/resource_paths.py"},"region":{"startLine":255}}}],"partialFingerprints":{"codehealthFindingId/v1":"c81cb27d549490b65d24e5ce25e7108ae85867ff028e9f1c3c363bd20ac64053"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060re.sub(r\u0022[^A-Za-z0-9_-]\u002B\u0022, \u0022_\u0022, stem).strip(\u0022_\u0022) or role\u0060 appears character-identically in 2 files \u2014 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\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":903}}}],"partialFingerprints":{"codehealthFindingId/v1":"639e0bf5a41b307b56f35df19a4da733fe7ab5d71b8ae2e8e1272a4032f6ceaa"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060role is not None or placeholder is not None\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/animation_config.py, skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":291}}}],"partialFingerprints":{"codehealthFindingId/v1":"31f7d5da073b1057bdf0c71108f3a44a30738716e478451691f8b1737cb0c83c"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060semantic_role is not None or placeholder is not None\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1244}}}],"partialFingerprints":{"codehealthFindingId/v1":"4f1a86c17eb3cb694fc1d48467b0e0e433bc959c97f3fe6dc3243de374e8dfc0"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sizes is None and normalized not in TIER_PIXELS\u0060 appears character-identically in 3 files \u2014 skills/ppt-master/scripts/image_backends/backend_minimax.py, skills/ppt-master/scripts/image_backends/backend_qwen.py, skills/ppt-master/scripts/image_backends/backend_zhipu.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_minimax.py"},"region":{"startLine":127}}}],"partialFingerprints":{"codehealthFindingId/v1":"13720b7394ed312fadda74889c15cb4e11480fc5806ceea3767571657115ddc8"}},{"ruleId":"X10","level":"note","message":{"text":"Duplicated predicate: \u0060sound_path.is_absolute() or PureWindowsPath(raw_sound).drive\u0060 appears character-identically in 2 files \u2014 skills/ppt-master/scripts/svg_to_pptx/animation_config.py, skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py. It is one line, so the duplication detector\u0027s token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/animation_config.py"},"region":{"startLine":1541}}}],"partialFingerprints":{"codehealthFindingId/v1":"84f3ab72234346b7364c371d5fc7f7d1f9fcb4794d74c3e82ed47df63767a686"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060compact_svg_style_tree\u0060 is public, takes a document from its caller (line 486) and hands it to \u0060_effective_value\u0060, which calls itself at line 250 (\u0060_effective_value\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060_effective_value\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_effective_value\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_styles.py"},"region":{"startLine":250}}}],"partialFingerprints":{"codehealthFindingId/v1":"05c44a059e8ca83b79d3dc1f58dc6baf91ab4a4e45cd8d065c1c11328b8bfdc0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060compact_svg_style_tree\u0060 is public, takes a document from its caller (line 486) and hands it to \u0060_promote_common_group_defaults\u0060, which calls itself at line 361 (\u0060_promote_common_group_defaults\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060_promote_common_group_defaults\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_promote_common_group_defaults\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_styles.py"},"region":{"startLine":361}}}],"partialFingerprints":{"codehealthFindingId/v1":"1230d07cc388a123841d9984519266cf8c1aeddd8d4714f821bc108d82a728c2"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060compact_svg_style_tree\u0060 is public, takes a document from its caller (line 486) and hands it to \u0060_remove_redundant_inherited_styles\u0060, which calls itself at line 483 (\u0060_remove_redundant_inherited_styles\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060_remove_redundant_inherited_styles\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_remove_redundant_inherited_styles\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/compact_svg_styles.py"},"region":{"startLine":483}}}],"partialFingerprints":{"codehealthFindingId/v1":"cad7022002c8c0c9d4345535a0900043affb81a49e0fb6b4c0cee202687fd9b0"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060semantic_subtree_sha256\u0060 is public, takes a document from its caller (line 279) and hands it to \u0060visit\u0060, which calls itself at line 302 (\u0060visit\u0060) with a piece of \u0060item\u0060 \u2014 and nowhere in \u0060visit\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":302}}}],"partialFingerprints":{"codehealthFindingId/v1":"abeb4fb7af888120b2d9f9925b539be679337b9b89917e831274b41b302f5757"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060analyze_template_text_slots\u0060 is public, takes a document from its caller (line 111) and hands it to \u0060visit\u0060, which calls itself at line 83 (\u0060visit\u0060) with a piece of \u0060node\u0060 \u2014 and nowhere in \u0060visit\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/template_text_slots.py"},"region":{"startLine":83}}}],"partialFingerprints":{"codehealthFindingId/v1":"91b31b2c75a1aabe0951fa77f2c0181cfd88f229fa99059fcc9e75a1cb281499"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collect_hidden_visuals\u0060 is public, takes a document from its caller (line 1854) and hands it to \u0060visit\u0060, which calls itself at line 1868 (\u0060visit\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060visit\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1868}}}],"partialFingerprints":{"codehealthFindingId/v1":"ad43d9eaac45979ec759e6d60b8e5827c2409d5a7bfa4585b6c80ebcc3052e63"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060collect_unsupported_visuals\u0060 is public, takes a document from its caller (line 1985) and hands it to \u0060walk\u0060, which calls itself at line 2020 (\u0060walk\u0060) with a piece of \u0060elem\u0060 \u2014 and nowhere in \u0060walk\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":2020}}}],"partialFingerprints":{"codehealthFindingId/v1":"9141f9e824654b2efda3220fe092e14c51a3a24bcaf64dc29455bcc26f9cb2c8"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060convert_text\u0060 is public, takes a document from its caller (line 3189) and hands it to \u0060_collect_inline_runs\u0060, which calls itself at line 2820 (\u0060_collect_inline_runs\u0060) with a piece of \u0060container\u0060 \u2014 and nowhere in \u0060_collect_inline_runs\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_collect_inline_runs\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":2820}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ae8660531798b1c6da263a1f5520cf31411433deb741aeb35e2cfc706b34ff3"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resolve_project_font_sizes\u0060 is public, takes a document from its caller (line 528) and hands it to \u0060walk\u0060, which calls itself at line 522 (\u0060walk\u0060) with a piece of \u0060elem\u0060 \u2014 and nowhere in \u0060walk\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":522}}}],"partialFingerprints":{"codehealthFindingId/v1":"851387797d64473fe55303188b5b602cde83ec25bcf105be87e0ff104bfe42ff"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060resolve_project_letter_spacings\u0060 is public, takes a document from its caller (line 536) and hands it to \u0060walk\u0060, which calls itself at line 562 (\u0060walk\u0060) with a piece of \u0060elem\u0060 \u2014 and nowhere in \u0060walk\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060walk\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/text_properties.py"},"region":{"startLine":562}}}],"partialFingerprints":{"codehealthFindingId/v1":"3c397db4213090d93967a274b5abd97c2ea44183c4f8e4f5916a573a26b2124c"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060project_transform_errors\u0060 is public, takes a document from its caller (line 1250) and hands it to \u0060_iter_visual_transform_tree\u0060, which calls itself at line 931 (\u0060_iter_visual_transform_tree\u0060) with a piece of \u0060elem\u0060 \u2014 and nowhere in \u0060_iter_visual_transform_tree\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_iter_visual_transform_tree\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":931}}}],"partialFingerprints":{"codehealthFindingId/v1":"7ea95ef3a79c860e47b7b347eb3aa829a44d75db1079ac74f76872f65d8bbc2a"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060supports_full_project_transform\u0060 is public and takes \u0060elem: ET.Element\u0060 from its caller, and it calls itself at line 1003 (\u0060supports_full_project_transform\u0060) with a piece of \u0060elem\u0060 \u2014 and nowhere in \u0060supports_full_project_transform\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060supports_full_project_transform\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1003}}}],"partialFingerprints":{"codehealthFindingId/v1":"f4766d66ccca96f905caf52370ab2bd393c256ec5ed1d0fbf5ea859ae971d2a5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060project_stroke_style_errors\u0060 is public, takes a document from its caller (line 1098) and hands it to \u0060visit\u0060, which calls itself at line 1067 (\u0060visit\u0060) with a piece of \u0060elem\u0060 \u2014 and nowhere in \u0060visit\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1067}}}],"partialFingerprints":{"codehealthFindingId/v1":"88abf4d154ccca235e61cd92f5139fc32e5f111af1492832a1d10c69a14e6693"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060project_transform_errors\u0060 is public, takes a document from its caller (line 1250) and hands it to \u0060validate_branch\u0060, which calls itself at line 1315 (\u0060validate_branch\u0060) with a piece of \u0060elem\u0060 \u2014 and nowhere in \u0060validate_branch\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060validate_branch\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/utils.py"},"region":{"startLine":1315}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f7fc32067d995b07ed5a284d3489a2a84651953705fa204da382d2a19c796b5"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060iter_leaf_shapes\u0060 is public and takes \u0060shapes: object\u0060 from its caller, and it calls itself at line 258 (\u0060iter_leaf_shapes\u0060) with a piece of \u0060shapes\u0060 \u2014 and nowhere in \u0060iter_leaf_shapes\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060iter_leaf_shapes\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":258}}}],"partialFingerprints":{"codehealthFindingId/v1":"28a2276d26855c622c0c9d8608197972a907fcf914e730f731d7ddaac54f9e85"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060walk_sp_tree\u0060 is public, takes a document from its caller (line 551) and hands it to \u0060_walk_container\u0060, which calls itself at line 345 (\u0060_walk_container\u0060) with a piece of \u0060container\u0060 \u2014 and nowhere in \u0060_walk_container\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_walk_container\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/shape_walker.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0f67107321e120469ac40d1b90ec22dd1bd19b70ce62d476643e2a7485a19af9"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060svg_preset_preview_fingerprint\u0060 is public, takes a document from its caller (line 84) and hands it to \u0060_preview_subtree\u0060, which calls itself at line 223 (\u0060_preview_subtree\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060_preview_subtree\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_preview_subtree\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantic_hash.py"},"region":{"startLine":223}}}],"partialFingerprints":{"codehealthFindingId/v1":"ee6a6f631bbcbd9c462da8064b557e66a3acf794ee748ce05774da10865b5641"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060svg_native_fallback_fingerprint\u0060 is public, takes a document from its caller (line 96) and hands it to \u0060_native_fallback_subtree\u0060, which calls itself at line 271 (\u0060_native_fallback_subtree\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060_native_fallback_subtree\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_native_fallback_subtree\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantic_hash.py"},"region":{"startLine":271}}}],"partialFingerprints":{"codehealthFindingId/v1":"817a904dfdf933c96c3c86ad70b0928063c386a15129594894e4e0113d885541"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060svg_native_fallback_fingerprint\u0060 is public, takes a document from its caller (line 96) and hands it to \u0060visit\u0060, which calls itself at line 313 (\u0060visit\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060visit\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantic_hash.py"},"region":{"startLine":313}}}],"partialFingerprints":{"codehealthFindingId/v1":"27d3c190ad43abd097e97888f35ff4cd49247858f09b802c7a700f52c1ddb447"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060svg_native_fallback_fingerprint\u0060 is public, takes a document from its caller (line 96) and hands it to \u0060visit\u0060, which calls itself at line 388 (\u0060visit\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060visit\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060visit\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantic_hash.py"},"region":{"startLine":388}}}],"partialFingerprints":{"codehealthFindingId/v1":"8d2940cbe4f35da7b91b7a82f091f3d64f984e6836442e86a9a11114a90d0512"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060svg_text_fingerprint\u0060 is public, takes a document from its caller (line 55) and hands it to \u0060_element_payload\u0060, which calls itself at line 446 (\u0060_element_payload\u0060) with a piece of \u0060element\u0060 \u2014 and nowhere in \u0060_element_payload\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_element_payload\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_shapes/semantic_hash.py"},"region":{"startLine":446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2472a639d9fe4a7248f01a63788c9706d5141bb60fc3d5b429d9a197f515cbba"}},{"ruleId":"X17","level":"warning","message":{"text":"Recursive walk over a caller-supplied document has no depth cap: \u0060deep_clone_slide_private_parts\u0060 is public, takes a document from its caller (line 205) and hands it to \u0060_clone_part_private_deps\u0060, which calls itself at line 191 (\u0060_clone_part_private_deps\u0060) with a piece of \u0060rels_root\u0060 \u2014 and nowhere in \u0060_clone_part_private_deps\u0060 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\u0027s document \u2014 not this code \u2014 decides how deep the stack goes. Python\u0027s parsers accept far more nesting than its stack allows: \u0060json.loads\u0060 turns 3,000 bytes of brackets into 1,500 levels and \u0060xml.etree.ElementTree\u0060 parses tens of thousands, while a walk like this one raises \u0060RecursionError\u0060 once it passes the interpreter\u0027s default limit of 1,000 frames. Wherever that exception lands, the work fails: a request errors, and outside any \u0060try\u0060 the worker or the program exits with it. Raising \u0060sys.setrecursionlimit\u0060 only moves the number the document has to beat. Thread a depth argument through \u0060_clone_part_private_deps\u0060 and reject the value past a fixed maximum, or rewrite the descent with an explicit stack."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/clone.py"},"region":{"startLine":191}}}],"partialFingerprints":{"codehealthFindingId/v1":"2ed2e6374e93f928ff37677235c35d2beab4ae29272830d9bfc54dca1ab4fa87"}},{"ruleId":"X24","level":"warning","message":{"text":"Document value reaches a markup attribute unescaped: \u0060elem_id\u0060 carries text this program read out of a document \u2014 an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again \u2014 and it is written straight into the \u0060id\u0060 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 \u2014 a crafted document becomes markup in what this code renders. Escape \u0060elem_id\u0060 at this site, or validate it against the shape the position accepts before interpolating it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/elements.py"},"region":{"startLine":5502}}}],"partialFingerprints":{"codehealthFindingId/v1":"c12d75ec685d7a7456f37ef5e0430f99a32c292a995b5e3b3373d750f28fb375"}},{"ruleId":"X24","level":"warning","message":{"text":"Document value reaches a markup attribute unescaped: \u0060elem_id\u0060 carries text this program read out of a document \u2014 an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again \u2014 and it is written straight into the \u0060id\u0060 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 \u2014 a crafted document becomes markup in what this code renders. Escape \u0060elem_id\u0060 at this site, or validate it against the shape the position accepts before interpolating it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5586}}}],"partialFingerprints":{"codehealthFindingId/v1":"345e4575e5bc88bfd4ca74a18a086b0fe526cb75d1ad7f6577c5087a437dfa7f"}},{"ruleId":"X24","level":"warning","message":{"text":"Document value reaches a markup attribute unescaped: \u0060elem_id\u0060 carries text this program read out of a document \u2014 an attribute or a text node, which the DOM hands back already decoded, so an entity its author wrote is a live character again \u2014 and it is written straight into the \u0060id\u0060 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 \u2014 a crafted document becomes markup in what this code renders. Escape \u0060elem_id\u0060 at this site, or validate it against the shape the position accepts before interpolating it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":5596}}}],"partialFingerprints":{"codehealthFindingId/v1":"d7727836752438abc6716dcc9fcc3f25da03e4065192c292583ba1e986b7b062"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060label\u0060 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\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":968}}}],"partialFingerprints":{"codehealthFindingId/v1":"72151a1f50c7454e127dd1eb7e285e1ba4e10e130f11e8d124e9f17b5267fd68"}},{"ruleId":"X24","level":"warning","message":{"text":"Untrusted text written into markup unescaped: \u0060icons[idx]\u0060 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\u0027s escaping output, or sanitise it if it must stay markup."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":3546}}}],"partialFingerprints":{"codehealthFindingId/v1":"a2bc213db1a04136584b3ad43d65160e350f94575fcad38c017f8cb8e4ad1dbb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except BaseException\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_search.py"},"region":{"startLine":2403}}}],"partialFingerprints":{"codehealthFindingId/v1":"ddfb4747d666892fd21cd501f1e2b4753dbc7038075a8d35499bdc15a258f07f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/rotate_images.py"},"region":{"startLine":491}}}],"partialFingerprints":{"codehealthFindingId/v1":"e092570e78c2ea97b06ed09a5f1dd638118b0198c4002682b90d1c4407ec387c"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_common.py"},"region":{"startLine":24}}}],"partialFingerprints":{"codehealthFindingId/v1":"15dce45786fd730a1a0fc6ae055ab1bfc483eed4fddcbc2716a71b3c69286b8e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/tts_backends/backend_elevenlabs.py"},"region":{"startLine":45}}}],"partialFingerprints":{"codehealthFindingId/v1":"1f44d1f42abdb95202fc82b01b732872b122cdf846b1794ed9aca8c3a0276670"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":2688}}}],"partialFingerprints":{"codehealthFindingId/v1":"174c46638b3fc58c12392e0a566ae4be187f19a836854e0b42a66021a519cb5a"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/narration.py"},"region":{"startLine":276}}}],"partialFingerprints":{"codehealthFindingId/v1":"5efa7f134a611705181f97c985f2974153a742cc6ce122d28b51166ea6a014e1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_images.py"},"region":{"startLine":97}}}],"partialFingerprints":{"codehealthFindingId/v1":"034b70d2db56c3e712d0a2efd00a958fb0f30208e5a1cf3354d1b0d25f910abb"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":333}}}],"partialFingerprints":{"codehealthFindingId/v1":"816a4fd56d1751fb67c87c33ad5676b067ea9cde7dd8a43edf9ca00b7de3a3c5"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":390}}}],"partialFingerprints":{"codehealthFindingId/v1":"ccea5a7da9184b0f01049ccfacae612f17157c42116dbc3c66878d56beeda89f"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":1543}}}],"partialFingerprints":{"codehealthFindingId/v1":"16e97bb43f35c3ad14d5649402c32ccc11653955f33d5892532ddc08dc0f4493"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2128}}}],"partialFingerprints":{"codehealthFindingId/v1":"783f1606c9db05e561f6379ca8714631cede6239bc9f235bb0d11f4e37bb5861"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2790}}}],"partialFingerprints":{"codehealthFindingId/v1":"1bcfbfe9e01ee67c06f636a99b81688edaeccd85f4dd04f16192026fbf816e78"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":2942}}}],"partialFingerprints":{"codehealthFindingId/v1":"63c4cd06bc58ded1816230ab9055c486d3a589e8e6f599c093297d7cc3ac7021"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060catch (e)\u0060 takes every exception and records none of it \u2014 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, or keep only the failure you expect and rethrow the rest (\u0060catch (e) { if (!(e instanceof SyntaxError)) throw e; \u2026 }\u0060, or test \u0060e.name\u0060), because a JavaScript catch takes every exception, programming errors included."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_editor/static/app.js"},"region":{"startLine":3052}}}],"partialFingerprints":{"codehealthFindingId/v1":"e26fe3557f9985fc40035dedd80d6ba1fc252ac92ace721706612abea16aa2e0"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1142}}}],"partialFingerprints":{"codehealthFindingId/v1":"9bd16c2e13d6a112434e0992fef6401b4c5d3f82e17202acbd9d4be65317db4b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1173}}}],"partialFingerprints":{"codehealthFindingId/v1":"1912bcdf15505da0153c8ef4fc1f67c4dfe5f2101cacac9a652db4030e3133d7"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":1549}}}],"partialFingerprints":{"codehealthFindingId/v1":"d1a502a7b871c241f36c940ba0da4cd96d069135ed7f9f12d41542d6f385963d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"ac070bd90e3b2921d519914b24fe1cccdfa322f521241ab016e9798dbca1ea7e"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1145}}}],"partialFingerprints":{"codehealthFindingId/v1":"f480c983473d8b1b51eb44cc14b2f9154b895464b319d2e82002a30768dc7812"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"5a3f122e8a4ebe0ef8a731e4d0ad97d57d359eb2fb54db7ec63d7110de5d483d"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1339}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5ebf6f05985a4d580489ab0de30b30422befdf4d0548814ca682c541004c6d1"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"18cb879bbfbdb25aa4eb2e8010843401fa56bc6caac8e9d0666393fd3dc8a84b"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (caught, then discarded): \u0060except Exception\u0060 takes every exception and records none of it \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/project_management/page_context.py"},"region":{"startLine":750}}}],"partialFingerprints":{"codehealthFindingId/v1":"97fb958f93f2c1589dee86e3f522300a3dcb2f7cdcdc0a456f2872b04fc9e390"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/image_backends/backend_common.py"},"region":{"startLine":352}}}],"partialFingerprints":{"codehealthFindingId/v1":"6bbecf3c32cb9c4a768d466778456f42f498b7cfdc852f3514fbf38460299539"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":722}}}],"partialFingerprints":{"codehealthFindingId/v1":"04424203f999f65b9c478028a3361eec74125f057ddcd8f61fa4bcb41da3be47"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): \u0060.catch(function(){})\u0060 handles the rejection by doing nothing \u2014 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 (\u0060next(error)\u0060, a returned rejection), or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4439}}}],"partialFingerprints":{"codehealthFindingId/v1":"4aa0a65dddd30b7025e230d9e241c0c474ddd17e2bea61e0518dac2d15393087"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4440}}}],"partialFingerprints":{"codehealthFindingId/v1":"939c7f1df2155af933ec604e0cf7a20c84b8af9a7fa560b5898721add077ef37"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4494}}}],"partialFingerprints":{"codehealthFindingId/v1":"389c5d185005412e8763ec81d138676bf8fcc2ec64866396fa0cb28f646b37a8"}},{"ruleId":"X3","level":"warning","message":{"text":"Swallowed exception (empty catch): An empty catch block silently discards the error \u2014 failures vanish with no log and no rethrow. Log it, handle it, or don\u0027t catch it."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/static/app.js"},"region":{"startLine":4545}}}],"partialFingerprints":{"codehealthFindingId/v1":"67fefe60271f1a80b26cd1808afecab18085eccd688520285c91f150f6d6cb8a"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/prompt_audit.py"},"region":{"startLine":1724}}}],"partialFingerprints":{"codehealthFindingId/v1":"cc4535b953d6d33adab6f97c83bf6bdaf6126c4cabeb61e3c50027d292b8609d"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1336}}}],"partialFingerprints":{"codehealthFindingId/v1":"46be121eb32cb1c8e114a4cc8f1cce1b8e72a72235137e7ae1874fe3e26c072e"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1358}}}],"partialFingerprints":{"codehealthFindingId/v1":"c35bdac35668c39a7770a8fd016401a19999022024b400409d845d1d7b49136e"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1399}}}],"partialFingerprints":{"codehealthFindingId/v1":"0cb8da02a4f4e7e91be680eff689ec52051b123e324b0fc16a55fe2ed0347608"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1446}}}],"partialFingerprints":{"codehealthFindingId/v1":"2c10d9c193d481bf111babace7f59e6ec5c4ae4bec67356f1a67666630e1a44d"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1796}}}],"partialFingerprints":{"codehealthFindingId/v1":"30d38be9842b874edc44dc3de69dc82f1a18fa202418eaa4cce8e8d6ad2a9140"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":1958}}}],"partialFingerprints":{"codehealthFindingId/v1":"b2c7595e45bdd09807fee5560541bc0e92ee8d0d32f4eb50e953195adc18d52c"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/drawingml/converter.py"},"region":{"startLine":2508}}}],"partialFingerprints":{"codehealthFindingId/v1":"0b2f7f95c55bc582963e90b980b0ac8234c60fe5d8178d9782d410cba272e29e"}},{"ruleId":"X6","level":"note","message":{"text":"Hand-rolled JSON/XML parsing via regex: A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand \u2014 malformed or differently-typed content (e.g. \u0060\u0022amount\u0022: \u00225\u0022\u0060 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/embed_icons.py"},"region":{"startLine":176}}}],"partialFingerprints":{"codehealthFindingId/v1":"dc31a1e64295c0a9ed4a5951de3282414cd5e58e0a2e4f257a550f2861c96eec"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_source_label\u0060 returns \u0060\u0027explicit\u0027\u0060 when \u0060(OSError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/apply_template.py"},"region":{"startLine":185}}}],"partialFingerprints":{"codehealthFindingId/v1":"5c04a7593e60de834850b18cbf1343746fe6b21a4605d78750d412b9bdb6799d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_expected_result_stage\u0060 returns \u0060\u0027final\u0027\u0060 when \u0060(OSError, json.JSONDecodeError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1780}}}],"partialFingerprints":{"codehealthFindingId/v1":"4c78068b942ede64d65a3be29e891ec2d82d093f354ed9ef625d42c8dff9a411"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_read_session\u0060 returns \u0060{}\u0060 when \u0060(OSError, json.JSONDecodeError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/confirm_ui/server.py"},"region":{"startLine":1803}}}],"partialFingerprints":{"codehealthFindingId/v1":"e5a4a7664a22599e8bc9d0cf5fbd787e4b612dde57e25901f1d6bdb6c27551d8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_positive_span\u0060 returns \u00601\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_ooxml/edit_safety.py"},"region":{"startLine":227}}}],"partialFingerprints":{"codehealthFindingId/v1":"f5a9824596700209dd7b8d116ceda08da11e2c376c10bf42319bf9a110ce61d8"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_managed_resource_paths\u0060 returns \u0060set()\u0060 when \u0060(OSError, UnicodeError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_template_import.py"},"region":{"startLine":158}}}],"partialFingerprints":{"codehealthFindingId/v1":"89b778a56562022b6ab18ff3211de366b1403b793bafb5a8c2f572a2ef820595"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_resolved_chart_colors\u0060 returns \u0060[]\u0060 when \u0060(AttributeError, OverflowError, RuntimeError, TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/chartex_to_svg.py"},"region":{"startLine":375}}}],"partialFingerprints":{"codehealthFindingId/v1":"539ffa6c7205cc49dbbb69e4940b7657fa857c7dcdb5e9ed84153d3e58357f26"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_managed_report_artifact_paths\u0060 returns \u0060set()\u0060 when \u0060(OSError, UnicodeError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/converter.py"},"region":{"startLine":1028}}}],"partialFingerprints":{"codehealthFindingId/v1":"38723a047eb320d07a030e6db58db828abf76d54239d1512968903b520f3f05f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_hex_distance\u0060 returns \u0060255.0\u0060 when \u0060(ValueError, IndexError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/fill_to_svg.py"},"region":{"startLine":838}}}],"partialFingerprints":{"codehealthFindingId/v1":"68261d6909368fb3ef2c7847072ca33e49c0d7ce6a4bb749159ff639978ff53b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_contrast_color\u0060 returns \u0060\u0027#FFFFFF\u0027\u0060 when \u0060(ValueError, TypeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/normalized_chart_svg.py"},"region":{"startLine":1445}}}],"partialFingerprints":{"codehealthFindingId/v1":"762c6ae936425e9b212acb0a56bd6c8301d5cbe4e11edf330d213974d63cd6b1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_canonical_native_merge_status\u0060 returns \u0060\u0027unsupported-merge-topology\u0027\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/tbl_to_svg.py"},"region":{"startLine":686}}}],"partialFingerprints":{"codehealthFindingId/v1":"f74867b29ff763b1c14a38f94aaf0dadd46a8dba849ea81f0613b72c89e457d1"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_spacing_points_px\u0060 returns \u00600.0\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_to_svg/txbody_to_svg.py"},"region":{"startLine":1069}}}],"partialFingerprints":{"codehealthFindingId/v1":"95c9bd0ac647a122b05919a8c73dfd30c769818e0935000c7446f3aea9d651dc"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_transition_relationship_ids\u0060 returns \u0060set()\u0060 when \u0060(KeyError, ET.ParseError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/pptx_workspace.py"},"region":{"startLine":494}}}],"partialFingerprints":{"codehealthFindingId/v1":"0066871afd5ff750deb29d74a4f8fe81b7dfd85b2678afdddd3c20ccb261e004"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_docx_image_occurrences\u0060 returns \u0060[]\u0060 when \u0060(KeyError, ET.ParseError, zipfile.BadZipFile, OSError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":345}}}],"partialFingerprints":{"codehealthFindingId/v1":"0e2ae7bb5693ab27176fbd97e1cba8ecb15ed85b5784a401c0b73303655d2712"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_docx_note_texts\u0060 returns \u0060{}\u0060 when \u0060(KeyError, ET.ParseError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/doc_to_md.py"},"region":{"startLine":696}}}],"partialFingerprints":{"codehealthFindingId/v1":"e2c24b16c150847357b5a35e367d4f9cb54d96ed29c8edcd10a1c4ab87f27be5"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_table_to_markdown\u0060 swallows every exception into \u0060return \u0027\u0027\u0060 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1015}}}],"partialFingerprints":{"codehealthFindingId/v1":"a16c19b46d58e6da90120e8467ba59210fb9d8717fb0176a890fb296fa26a560"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_find_tables_in_clip\u0060 swallows every exception into \u0060return []\u0060 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/pdf_to_md.py"},"region":{"startLine":1304}}}],"partialFingerprints":{"codehealthFindingId/v1":"62b3d56f0f97332de644149f7bff2dca1d79439f97dbd001ac9fcea383db8a49"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default in catch: \u0060_safe_position\u0060 swallows every exception into \u0060return 0\u0060 \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/ppt_to_md.py"},"region":{"startLine":190}}}],"partialFingerprints":{"codehealthFindingId/v1":"80530c5fde816058b9cfc2ce73197a313412a942ccdd0246ccefe7adf29764ff"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060span\u0060 (in \u0060simple_html_to_markdown_traversal\u0060) returns \u00601\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/source_to_md/web_to_md.py"},"region":{"startLine":1060}}}],"partialFingerprints":{"codehealthFindingId/v1":"4d6faa4874738b5638de6f60b10508182fb7664cf4983af610008516912f5316"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_semantic_text_font_size\u0060 returns \u006016.0\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_authoring_view.py"},"region":{"startLine":691}}}],"partialFingerprints":{"codehealthFindingId/v1":"6e03025c8a9ce05d57a53fa526ec5e360e01d57ce8a2320ae6f3e3e457829e93"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060count_office_vector_refs_in_svg\u0060 returns \u00600\u0060 when \u0060ET.ParseError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_finalize/align_embed_images.py"},"region":{"startLine":536}}}],"partialFingerprints":{"codehealthFindingId/v1":"7e9397d3d731904f33153d48ec5b4eddb97be77e3622a18e808c2a917f847a4b"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_roundtrip_source_slot_overflow\u0060 returns \u0060{}\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":2408}}}],"partialFingerprints":{"codehealthFindingId/v1":"cb2c43bb8dbb076a6ef8ba217f9671bc7ea3bafe84f191f0199825194e964a3d"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060collect\u0060 (in \u0060_inline_text_segments\u0060) returns \u0060False\u0060 when \u0060ValueError\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_quality/checker.py"},"region":{"startLine":3207}}}],"partialFingerprints":{"codehealthFindingId/v1":"04d38e2b6a17ff1017d4ef87fb6e5ee6d4666d64b5754438e7869224ed8a9eea"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_first_slide_number\u0060 returns \u00601\u0060 when \u0060(OSError, ET.ParseError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/builder.py"},"region":{"startLine":4775}}}],"partialFingerprints":{"codehealthFindingId/v1":"04e8e3609fd2013c2bffac53c8b98fec6ea1c808e545e33c1508f6a476ecb24f"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_conversion_trace_dangerous_normalization_count\u0060 returns \u00600\u0060 when \u0060(OSError, UnicodeError, json.JSONDecodeError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/svg_to_pptx/pptx_package/cli.py"},"region":{"startLine":1392}}}],"partialFingerprints":{"codehealthFindingId/v1":"6cf22833bb0b602ff9788202d4e7f327b45f2958edfcdbfa806aaddcf1686ee7"}},{"ruleId":"X7","level":"note","message":{"text":"Silent fallback default on parse failure: \u0060_stream_start_ms\u0060 returns \u00600\u0060 when \u0060(TypeError, ValueError)\u0060 is raised, with no log or raise \u2014 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."},"locations":[{"physicalLocation":{"artifactLocation":{"uri":"skills/ppt-master/scripts/video_sound_mix.py"},"region":{"startLine":232}}}],"partialFingerprints":{"codehealthFindingId/v1":"ae42ad7086840caec35b3a03b9e00c37a5490b95395df4974fd5af685a17b28f"}}],"taxonomies":[{"name":"CWE","guid":"c3a2b1d0-7f3e-4b2a-9c1d-5e6f7a8b9c0d","organization":"MITRE","informationUri":"https://cwe.mitre.org/","isComprehensive":false,"shortDescription":{"text":"The MITRE Common Weakness Enumeration (CWE)."},"taxa":[{"id":"CWE-1059","guid":"a2381a08-60f6-9554-a8b8-f3018cfaaca5","name":"Insufficient Technical Documentation","shortDescription":{"text":"Insufficient Technical Documentation"},"helpUri":"https://cwe.mitre.org/data/definitions/1059.html"},{"id":"CWE-1395","guid":"800e09e7-c11a-8654-9fa6-86f398995fed","name":"Dependency on Vulnerable Third-Party Component","shortDescription":{"text":"Dependency on Vulnerable Third-Party Component"},"helpUri":"https://cwe.mitre.org/data/definitions/1395.html"},{"id":"CWE-259","guid":"ae9ad959-fbb6-9d5e-892d-3dca66da0b69","name":"Use of Hard-coded Password","shortDescription":{"text":"Use of Hard-coded Password"},"helpUri":"https://cwe.mitre.org/data/definitions/259.html"},{"id":"CWE-506","guid":"401d6455-56e3-0552-9a39-f77461673e3f","name":"Embedded Malicious Code","shortDescription":{"text":"Embedded Malicious Code"},"helpUri":"https://cwe.mitre.org/data/definitions/506.html"},{"id":"CWE-77","guid":"332c8ade-6612-9f56-a06b-d8d90b1a8750","name":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in a Command (\u0027Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/77.html"},{"id":"CWE-78","guid":"2e31ceaf-c7ae-2e5e-9661-cfb1362789cf","name":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an OS Command (\u0027OS Command Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/78.html"},{"id":"CWE-79","guid":"fd45580b-e8c4-fc5e-8c2f-aa8fab0b4dbf","name":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)","shortDescription":{"text":"Improper Neutralization of Input During Web Page Generation (\u0027Cross-site Scripting\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/79.html"},{"id":"CWE-798","guid":"5e8f057d-fee3-995a-a0cb-9fc5b0d174d1","name":"Use of Hard-coded Credentials","shortDescription":{"text":"Use of Hard-coded Credentials"},"helpUri":"https://cwe.mitre.org/data/definitions/798.html"},{"id":"CWE-89","guid":"6d08fdad-37eb-c150-bbf0-d7d946863407","name":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)","shortDescription":{"text":"Improper Neutralization of Special Elements used in an SQL Command (\u0027SQL Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/89.html"},{"id":"CWE-937","guid":"16f316ae-415c-b354-a59b-1f7905f756e9","name":"Using Components with Known Vulnerabilities","shortDescription":{"text":"Using Components with Known Vulnerabilities"},"helpUri":"https://cwe.mitre.org/data/definitions/937.html"},{"id":"CWE-94","guid":"75e7f50c-6c2f-dd52-bf40-bf6c52b861fd","name":"Improper Control of Generation of Code (\u0027Code Injection\u0027)","shortDescription":{"text":"Improper Control of Generation of Code (\u0027Code Injection\u0027)"},"helpUri":"https://cwe.mitre.org/data/definitions/94.html"}]},{"name":"OWASP Top 10","guid":"7d1f0c2e-4b6a-4e39-9a51-0b2e8c3d5f61","version":"2025","organization":"OWASP Foundation","informationUri":"https://top10.owasp.org/2025/","isComprehensive":false,"shortDescription":{"text":"The OWASP Top 10:2025 web application security risks."},"taxa":[{"id":"A02:2025","guid":"668dee9e-41bc-6354-97d0-fdf8f40c50c1","name":"Security Misconfiguration","shortDescription":{"text":"Security Misconfiguration"},"helpUri":"https://top10.owasp.org/2025/A02_2025-Security_Misconfiguration/"},{"id":"A03:2025","guid":"168e227c-7735-2e57-bc6e-997affe644c5","name":"Software Supply Chain Failures","shortDescription":{"text":"Software Supply Chain Failures"},"helpUri":"https://top10.owasp.org/2025/A03_2025-Software_Supply_Chain_Failures/"},{"id":"A05:2025","guid":"87e86033-3231-8458-8e4a-5cb82743553a","name":"Injection","shortDescription":{"text":"Injection"},"helpUri":"https://top10.owasp.org/2025/A05_2025-Injection/"},{"id":"A07:2025","guid":"334ddd78-539d-d35c-83dd-253647eb7eaf","name":"Authentication Failures","shortDescription":{"text":"Authentication Failures"},"helpUri":"https://top10.owasp.org/2025/A07_2025-Authentication_Failures/"},{"id":"A08:2025","guid":"84b0c297-710e-9a5f-9335-936ecb260c36","name":"Software or Data Integrity Failures","shortDescription":{"text":"Software or Data Integrity Failures"},"helpUri":"https://top10.owasp.org/2025/A08_2025-Software_or_Data_Integrity_Failures/"}]}],"properties":{"codehealthPublication":{"public":true,"notice":"This is the PUBLIC form of this artifact. Findings are listed in full, but the details of SECURITY findings \u2014 which rule fired, in which file, on which line, and how to fix it \u2014 are deliberately withheld, and any secret-scanner results are excluded entirely. Where detail is absent here it was REMOVED FOR PUBLICATION; it is not missing from the analysis. The complete artifact is available from the repository owner.","securityFindingsRedacted":9,"secretScannerRunsExcluded":0}},"redactionTokens":["A security finding was recorded here. Its details are withheld on the public artifact \u2014 ask the repository owner for the full report."]}]}