Public report of ytdl-org/youtube-dl, published 23 October 2026. It has the same score, grades and number of
findings as the full report. The details of security findings (where they are in the code, which known
vulnerabilities and which passwords or keys were found) are left out, so nobody can use them against the project.
Public
Executive reportMeasured under the Code Assurance Index, an open standard for code quality, using its published scoring rules (rubric version 2026.10.5). Watchdog signed this survey and filed it in the standard's public register, where anyone can look it up by its survey ID. Check this survey →
Signed and filed in the standard's public register, 23 October 2026, 03:28 UTC · Survey ID cd_07aa3efe8bf742d78832068192a43809
ytdl-org/youtube-dl
Measured 23 October 2026, 03:23 UTC, at code version 956b8c5
No regression since the last survey
A regression is a drop of 0.5 points or more in the score, or of 2.5 or more out of 10 in a dimension, since the last survey.
CAI scoreWeak
CriticalWeakAdequateStrongExemplary
No change since the last survey
The score is built from these lenses. Each lens grades one area of the code, such as how easy it is to change or how well it is protected. The weakest lens counts most, so one weak area pulls the score down instead of being averaged away.
A large codebase: 142,113 lines of product code in 1 project, tests not counted · Estimated rebuild effort: about 0.9 person-years · Weakest lens: Security and Compliance, 30
Findings by how serious they are
103 critical667 serious677 minor
17 dimensions are left out of the score. For each one, Watchdog either couldn't measure it in this code, or found no evidence of the safeguard it looks for, such as a tested backup restore. They count neither for nor against the score, and Limitations lists each one with its reason.
This survey was produced by
Watchdog
Producer
Canine Development
Analyzer
Watchdog engine 1.0.0
Measured
23 October 2026, 03:23 UTC
A measurement, not a certificate. The Code Assurance Index records a number
together with the evidence it was worked out from, so anyone can recalculate it, but it doesn't certify or guarantee
the code. The standard was written by Canine Development, which also builds Watchdog. It is open to any tool that
implements it, and today Watchdog is the only one that does.
The score is deterministic, which means the same code always gets the same score. Watchdog works it out with tools that follow published rules, and an AI model never decides it, so anyone who applies the same rules to the same code gets the same number. How it is done is explained under Methodology ▸
47of 51 dimensions measured by tools. The other 4 are advisory notes from an AI model, which explain the code but don't count towards the score.
1431of 1447 findings point to an exact file and line, so you can open each one in the code. The other 16 concern the repository as a whole, such as missing documentation.
51dimensions across 5 lenses, read from 142,113 lines of product code in 1 project.
ytdl-org/youtube-dl scores 39 out of 100 and is rated Weak, while three of its five lenses score higher still: Architecture at 86 and Code Health at 77, both rated Adequate, and Maturity at 43, rated Weak.
The score is lower than those three because the weakest lens counts most, and here that is Security and Compliance, which scores 30 and is rated Weak. Its Secrets (history) dimension scores 0 out of 10, and until that reaches 4, Security and Compliance can't be rated higher than Adequate. The first actions are to resolve the 31 Leaked secret finding(s) in REDACTED Scanning and to resolve the 57 REDACTED finding(s) in Secrets (history), and if Security and Compliance rose to 70, the score would rise from 39 to about 47.
103 findings are critical: 58 in Secrets (history), 31 in REDACTED Scanning and 14 in Static Analysis (SAST).
Watchdog couldn't measure 16 dimensions in this code, among them Code Coverage, Dependency Hygiene and License Compliance, so they are left out of the score. The product code is 142,113 lines, which would take an estimated 0.9 person-years, around €130,000, to rebuild.
A lens is capped at Adequate while one of its dimensions scores below 4 out of 10, however well the rest of the lens does. That way a serious problem in one place always shows in the lens's rating.
How the score is built: what each lens counts forThe lenses don't count equally. The weakest lens counts most, the next weakest a little less, and so on, so a weak area pulls the score down instead of being averaged away. In the bar below, each part's width shows how much that lens counts and its colour shows its rating. Improving the widest part moves the score most, and as that lens improves, it counts for less, because another lens becomes the weakest.
Watchdog compares every finding with the previous survey's. A finding that has only moved to another line in the same file counts as the same finding, so only new findings appear here. Advisory notes from the AI model are left out, because the model words them afresh in every survey.
Fixed since the last survey: 1 finding
This critical or serious finding was in the previous survey, on 9 October 2026, and is gone from this one.
€42,000 to €210,000, for 708 to 2,247 hours of work, about 0.9 person-years for 1 to 2 engineers
Difficulty of the problem
Standard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor
×0.7 at a score of 39. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
Size
Large: 142,113 lines of product code
How the estimate is made: Watchdog prices the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.
Top priorities
The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.
1
Resolve the 31 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (4), REDACTED (3), REDACTED (2).
Raises the score by about 9 points · Medium effort · REDACTED Scanning
2
Resolve the 57 REDACTED finding(s) in Secrets (history) — start with REDACTED (10), REDACTED (4), REDACTED (2).
Raises the score by about 6 points · Medium effort · Secrets (history)
3
Resolve the 1 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED.
Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.
Where the investment is most exposed · Value at risk
This code would cost about €130,000 to build again, about 0.9 person-years of work. Its weakest lens is Security and Compliance, at 30 (Weak). Security and Compliance is about how well the product is protected, and how it handles personal data. Because the weakest lens counts most in the score, work on Security and Compliance also moves the score most.
Based on: the rebuild estimate · the Security and Compliance grade · how much each lens counts
What to do: Start with the Security and Compliance actions in Top priorities.
If you do one thing first · First action
Resolve the 31 Leaked secret finding(s) in REDACTED Scanning. Of all the actions in this report, it raises the score most for the work it takes: about 9 points for medium effort, because it clears the 31 REDACTED Scanning findings. The next survey will show the change in the score.
Based on: the ranked actions in Top priorities, by score gain and effort
What hard-to-read code costs each year · Cost
Four dimensions measure how easy the code is to work in: two measure how tangled its logic is, one how much of it is copied, and one how well each part sticks to a single job. In this codebase they average 6.0 out of 10. Code at that level is slower to change than clean code, and Watchdog estimates the extra work at 5% to 11% on every change. The history of the code shows how much it changes: about 1,557 lines over the last 90 days, which is about 6,314 lines a year. At that pace, the extra work comes to an estimated 0.8 to 4.8 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of Watchdog's own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.
Architecture: which parts of the code depend on which
The code is divided into modules, groups of code that each handle one part of the product, and a module depends on another when it uses code from it. The table lists the modules both down the side and across the top, in an order where each module should only use modules listed above it. A number in a cell means the module on that row uses the module in that column, and it counts the pairs of building blocks (types) that connect them. The one thing to look for is a mark above the diagonal line. It means two or more modules use each other in a loop (a dependency cycle), so none of them can be changed, tested or released on its own.
844 modules, with 665 dependencies between them. Every module uses only modules listed above it, so there are no loops.
The table shows the 40 modules with the most connections; 804 more are left out to keep it readable.
Which modules use which. The module on each row uses the module in each column, and the number counts the pairs of types that connect them. A cell above the diagonal is part of a loop.
downloader.http uses downloader.common, so a change to downloader.common can break downloader.http, while a change to downloader.http can't break downloader.common.
Position
Below the diagonal: downloader.http uses a module listed above it, which is the healthy direction.
extractor.adobepass uses extractor.common, so a change to extractor.common can break extractor.adobepass, while a change to extractor.adobepass can't break extractor.common.
Position
Below the diagonal: extractor.adobepass uses a module listed above it, which is the healthy direction.
extractor.amp uses extractor.common, so a change to extractor.common can break extractor.amp, while a change to extractor.amp can't break extractor.common.
Position
Below the diagonal: extractor.amp uses a module listed above it, which is the healthy direction.
extractor.anvato uses extractor.common, so a change to extractor.common can break extractor.anvato, while a change to extractor.anvato can't break extractor.common.
Position
Below the diagonal: extractor.anvato uses a module listed above it, which is the healthy direction.
extractor.ard uses extractor.common, so a change to extractor.common can break extractor.ard, while a change to extractor.ard can't break extractor.common.
Position
Below the diagonal: extractor.ard uses a module listed above it, which is the healthy direction.
extractor.arkena uses extractor.common, so a change to extractor.common can break extractor.arkena, while a change to extractor.arkena can't break extractor.common.
Position
Below the diagonal: extractor.arkena uses a module listed above it, which is the healthy direction.
extractor.aws uses extractor.common, so a change to extractor.common can break extractor.aws, while a change to extractor.aws can't break extractor.common.
Position
Below the diagonal: extractor.aws uses a module listed above it, which is the healthy direction.
extractor.bokecc uses extractor.common, so a change to extractor.common can break extractor.bokecc, while a change to extractor.bokecc can't break extractor.common.
Position
Below the diagonal: extractor.bokecc uses a module listed above it, which is the healthy direction.
extractor.cnn uses extractor.common, so a change to extractor.common can break extractor.cnn, while a change to extractor.cnn can't break extractor.common.
Position
Below the diagonal: extractor.cnn uses a module listed above it, which is the healthy direction.
extractor.cnn uses extractor.turner, so a change to extractor.turner can break extractor.cnn, while a change to extractor.cnn can't break extractor.turner.
Position
Below the diagonal: extractor.cnn uses a module listed above it, which is the healthy direction.
extractor.crunchyroll uses extractor.common, so a change to extractor.common can break extractor.crunchyroll, while a change to extractor.crunchyroll can't break extractor.common.
Position
Below the diagonal: extractor.crunchyroll uses a module listed above it, which is the healthy direction.
extractor.discoverygo uses extractor.common, so a change to extractor.common can break extractor.discoverygo, while a change to extractor.discoverygo can't break extractor.common.
Position
Below the diagonal: extractor.discoverygo uses a module listed above it, which is the healthy direction.
extractor.dplay uses extractor.common, so a change to extractor.common can break extractor.dplay, while a change to extractor.dplay can't break extractor.common.
Position
Below the diagonal: extractor.dplay uses a module listed above it, which is the healthy direction.
extractor.gigya uses extractor.common, so a change to extractor.common can break extractor.gigya, while a change to extractor.gigya can't break extractor.common.
Position
Below the diagonal: extractor.gigya uses a module listed above it, which is the healthy direction.
extractor.hbo uses extractor.common, so a change to extractor.common can break extractor.hbo, while a change to extractor.hbo can't break extractor.common.
Position
Below the diagonal: extractor.hbo uses a module listed above it, which is the healthy direction.
extractor.keezmovies uses extractor.common, so a change to extractor.common can break extractor.keezmovies, while a change to extractor.keezmovies can't break extractor.common.
Position
Below the diagonal: extractor.keezmovies uses a module listed above it, which is the healthy direction.
extractor.mtv uses extractor.common, so a change to extractor.common can break extractor.mtv, while a change to extractor.mtv can't break extractor.common.
Position
Below the diagonal: extractor.mtv uses a module listed above it, which is the healthy direction.
extractor.myvi uses extractor.common, so a change to extractor.common can break extractor.myvi, while a change to extractor.myvi can't break extractor.common.
Position
Below the diagonal: extractor.myvi uses a module listed above it, which is the healthy direction.
extractor.nuevo uses extractor.common, so a change to extractor.common can break extractor.nuevo, while a change to extractor.nuevo can't break extractor.common.
Position
Below the diagonal: extractor.nuevo uses a module listed above it, which is the healthy direction.
extractor.once uses extractor.common, so a change to extractor.common can break extractor.once, while a change to extractor.once can't break extractor.common.
Position
Below the diagonal: extractor.once uses a module listed above it, which is the healthy direction.
extractor.onet uses extractor.common, so a change to extractor.common can break extractor.onet, while a change to extractor.onet can't break extractor.common.
Position
Below the diagonal: extractor.onet uses a module listed above it, which is the healthy direction.
extractor.prosiebensat1 uses extractor.common, so a change to extractor.common can break extractor.prosiebensat1, while a change to extractor.prosiebensat1 can't break extractor.common.
Position
Below the diagonal: extractor.prosiebensat1 uses a module listed above it, which is the healthy direction.
downloader.fragment uses downloader.common, so a change to downloader.common can break downloader.fragment, while a change to downloader.fragment can't break downloader.common.
Position
Below the diagonal: downloader.fragment uses a module listed above it, which is the healthy direction.
downloader.fragment uses downloader.http, so a change to downloader.http can break downloader.fragment, while a change to downloader.fragment can't break downloader.http.
Position
Below the diagonal: downloader.fragment uses a module listed above it, which is the healthy direction.
extractor.abcnews uses extractor.common, so a change to extractor.common can break extractor.abcnews, while a change to extractor.abcnews can't break extractor.common.
Position
Below the diagonal: extractor.abcnews uses a module listed above it, which is the healthy direction.
extractor.abcnews uses extractor.amp, so a change to extractor.amp can break extractor.abcnews, while a change to extractor.abcnews can't break extractor.amp.
Position
Below the diagonal: extractor.abcnews uses a module listed above it, which is the healthy direction.
extractor.bleacherreport uses extractor.common, so a change to extractor.common can break extractor.bleacherreport, while a change to extractor.bleacherreport can't break extractor.common.
Position
Below the diagonal: extractor.bleacherreport uses a module listed above it, which is the healthy direction.
extractor.bleacherreport uses extractor.amp, so a change to extractor.amp can break extractor.bleacherreport, while a change to extractor.bleacherreport can't break extractor.amp.
Position
Below the diagonal: extractor.bleacherreport uses a module listed above it, which is the healthy direction.
extractor.brightcove uses extractor.common, so a change to extractor.common can break extractor.brightcove, while a change to extractor.brightcove can't break extractor.common.
Position
Below the diagonal: extractor.brightcove uses a module listed above it, which is the healthy direction.
extractor.brightcove uses extractor.adobepass, so a change to extractor.adobepass can break extractor.brightcove, while a change to extractor.brightcove can't break extractor.adobepass.
Position
Below the diagonal: extractor.brightcove uses a module listed above it, which is the healthy direction.
extractor.canvas uses extractor.common, so a change to extractor.common can break extractor.canvas, while a change to extractor.canvas can't break extractor.common.
Position
Below the diagonal: extractor.canvas uses a module listed above it, which is the healthy direction.
extractor.canvas uses extractor.gigya, so a change to extractor.gigya can break extractor.canvas, while a change to extractor.canvas can't break extractor.gigya.
Position
Below the diagonal: extractor.canvas uses a module listed above it, which is the healthy direction.
extractor.espn uses extractor.common, so a change to extractor.common can break extractor.espn, while a change to extractor.espn can't break extractor.common.
Position
Below the diagonal: extractor.espn uses a module listed above it, which is the healthy direction.
extractor.espn uses extractor.once, so a change to extractor.once can break extractor.espn, while a change to extractor.espn can't break extractor.once.
Position
Below the diagonal: extractor.espn uses a module listed above it, which is the healthy direction.
extractor.fox uses extractor.adobepass, so a change to extractor.adobepass can break extractor.fox, while a change to extractor.fox can't break extractor.adobepass.
Position
Below the diagonal: extractor.fox uses a module listed above it, which is the healthy direction.
extractor.foxnews uses extractor.common, so a change to extractor.common can break extractor.foxnews, while a change to extractor.foxnews can't break extractor.common.
Position
Below the diagonal: extractor.foxnews uses a module listed above it, which is the healthy direction.
extractor.foxnews uses extractor.amp, so a change to extractor.amp can break extractor.foxnews, while a change to extractor.foxnews can't break extractor.amp.
Position
Below the diagonal: extractor.foxnews uses a module listed above it, which is the healthy direction.
extractor.lcp uses extractor.common, so a change to extractor.common can break extractor.lcp, while a change to extractor.lcp can't break extractor.common.
Position
Below the diagonal: extractor.lcp uses a module listed above it, which is the healthy direction.
extractor.lcp uses extractor.arkena, so a change to extractor.arkena can break extractor.lcp, while a change to extractor.lcp can't break extractor.arkena.
Position
Below the diagonal: extractor.lcp uses a module listed above it, which is the healthy direction.
extractor.mofosex uses extractor.common, so a change to extractor.common can break extractor.mofosex, while a change to extractor.mofosex can't break extractor.common.
Position
Below the diagonal: extractor.mofosex uses a module listed above it, which is the healthy direction.
extractor.mofosex uses extractor.keezmovies, so a change to extractor.keezmovies can break extractor.mofosex, while a change to extractor.mofosex can't break extractor.keezmovies.
Position
Below the diagonal: extractor.mofosex uses a module listed above it, which is the healthy direction.
extractor.scrippsnetworks uses extractor.common, so a change to extractor.common can break extractor.scrippsnetworks, while a change to extractor.scrippsnetworks can't break extractor.common.
Position
Below the diagonal: extractor.scrippsnetworks uses a module listed above it, which is the healthy direction.
extractor.scrippsnetworks uses extractor.aws, so a change to extractor.aws can break extractor.scrippsnetworks, while a change to extractor.scrippsnetworks can't break extractor.aws.
Position
Below the diagonal: extractor.scrippsnetworks uses a module listed above it, which is the healthy direction.
extractor.theplatform uses extractor.once, so a change to extractor.once can break extractor.theplatform, while a change to extractor.theplatform can't break extractor.once.
Position
Below the diagonal: extractor.theplatform uses a module listed above it, which is the healthy direction.
extractor.cbs uses extractor.theplatform, so a change to extractor.theplatform can break extractor.cbs, while a change to extractor.cbs can't break extractor.theplatform.
Position
Below the diagonal: extractor.cbs uses a module listed above it, which is the healthy direction.
extractor.nationalgeographic uses extractor.common, so a change to extractor.common can break extractor.nationalgeographic, while a change to extractor.nationalgeographic can't break extractor.common.
Position
Below the diagonal: extractor.nationalgeographic uses a module listed above it, which is the healthy direction.
extractor.nationalgeographic uses extractor.fox, so a change to extractor.fox can break extractor.nationalgeographic, while a change to extractor.nationalgeographic can't break extractor.fox.
Position
Below the diagonal: extractor.nationalgeographic uses a module listed above it, which is the healthy direction.
extractor.nbc uses extractor.common, so a change to extractor.common can break extractor.nbc, while a change to extractor.nbc can't break extractor.common.
Position
Below the diagonal: extractor.nbc uses a module listed above it, which is the healthy direction.
extractor.nbc uses extractor.adobepass, so a change to extractor.adobepass can break extractor.nbc, while a change to extractor.nbc can't break extractor.adobepass.
Position
Below the diagonal: extractor.nbc uses a module listed above it, which is the healthy direction.
extractor.nbc uses extractor.theplatform, so a change to extractor.theplatform can break extractor.nbc, while a change to extractor.nbc can't break extractor.theplatform.
Position
Below the diagonal: extractor.nbc uses a module listed above it, which is the healthy direction.
extractor.cbsnews uses extractor.common, so a change to extractor.common can break extractor.cbsnews, while a change to extractor.cbsnews can't break extractor.common.
Position
Below the diagonal: extractor.cbsnews uses a module listed above it, which is the healthy direction.
extractor.cbsnews uses extractor.cbs, so a change to extractor.cbs can break extractor.cbsnews, while a change to extractor.cbsnews can't break extractor.cbs.
Position
Below the diagonal: extractor.cbsnews uses a module listed above it, which is the healthy direction.
At a glance — Code Health · 77% · Adequate · gated by D1, D2 ·
Findings mapped to OWASP categories; the specific CVEs/secrets are in the Security dimension cards below and findings.md (redacted only on the public version of this report).
OWASP category
Findings
Severity
A07:2025 — Authentication Failures
90
High / Critical
A05:2025 — Injection
53
High / Critical
A03:2025 — Software Supply Chain Failures
5
Medium
A01:2025 — Broken Access Control
1
Medium
Roadmap
Immediately address the 31 leaked secrets in source files like REDACTED and REDACTED, followed by resolving 57 historical secret findings in REDACTED and REDACTED. Tackle the churn and complexity hotspot in REDACTED and establish the missing architectural decision record to improve design transparency. Finally, clean up the 607 orphaned files, prioritizing generic.py and YoutubeDL.py, to restore knowledge freshness and reduce maintenance burden.
Ranked by impact ÷ effort. "Helps" is the estimated gain on the 0–100 health score.
Do this
Helps
Effort
Dimension
Resolve the 31 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (4), REDACTED (3), REDACTED (2).
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Per-file score 0–10 — a quality signature. Of 291 files carrying findings, judged against the Production bar: 7% slop · 58% mixed · 35% near-clean.
File
Score
Band
Worst signal
REDACTED
0.0
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
0.0
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
0.0
Slop
Secrets (history): REDACTED: REDACTED
REDACTED
0.0
Slop
Secrets (history): REDACTED: REDACTED
REDACTED
0.3
Slop
Static Analysis (SAST): High: REDACTED
REDACTED
0.4
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
0.6
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
0.8
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
0.8
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
1.0
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
1.1
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
1.2
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
2.1
Slop
Secrets (history): REDACTED: REDACTED
REDACTED
2.2
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
2.2
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
2.2
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
3.0
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
3.0
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
3.0
Slop
REDACTED Scanning: Leaked secret: REDACTED
REDACTED
4.0
Mixed
Static Analysis (SAST): Medium: REDACTED
How the grades work
Every finding carries one of four grades. Three say how serious it is. The fourth says this
survey could not settle it — and it is a grade, not a gap.
Critical — 103
A definite problem that already costs you something and drags the score down: a
missing authorisation check, a dependency with a known exploit, a build that does not reproduce. Failure here
tends to cause failures elsewhere.
Serious — 667
Likely wrong, but not failing yet. It degrades
the codebase over a longer horizon and can cause failures elsewhere — not urgent this week, not something to
carry for two years either.
Minor — 677
Recorded, with no effect on how the codebase functions.
Present so the survey is complete, not because it needs doing.
Could not be resolved — 17
Something this survey could not settle
from the outside, and which could be critical or serious. Either a control was required and no
positive evidence of it exists in the repository — a backup job that nothing shows was ever restored from proves
nothing about restores — or our own analysis could not run over that part of the tree. This is not a clean
result. These are excluded from the score rather than awarded a pass, so the number on the cover neither
rewards nor penalises them: if you act on this survey without resolving them, you carry that risk yourself. Each
one is named under Limitations.
Methodology & how to trust this report
Watchdog is a deep, periodic assessment — run each sprint, monthly, or quarterly, taking the time to go wider and deeper than a quick check and surfacing in one coherent report what you'd otherwise piece together from a dozen separate tools. It scores deterministically: the same commit yields the same score, every run. 47 of 51 evaluated dimensions are computed purely by tools and static analysis (confidence 1.0); 4 documentation/naming judgement(s) are LLM-assisted and labelled advisory. Overall confidence is 0.9 — the weighted average across measured dimensions; it falls as more of the score leans on LLM-assisted judgement and rises when it's fully tool-backed.
Every figure here is one of three kinds, and we label which: ✓ Measured — a deterministic fact (LoC, complexity, coverage); ~ Modeled — an estimate from a stated model (cost, effort, value-at-risk), always a range with its assumptions, never a precise fact; ◐ Advisory — an LLM prose judgement. We never present a modelled estimate as if it were measured. Perfect or absent scores carry their provenance too (ADR-0011): ✓ Tool-verified means the property itself was measured across the surface; ○ Nothing flagged means the probes came back clean — a claim bounded by what a repository can show; ⊘ Not evidenced means a working control (a tested restore, an automated rollback) showed no positive evidence — absence of evidence is not evidence of a control, so it's excluded from the score rather than awarded a spurious 10; ◐ Sampled · advisory marks an LLM verdict over a bounded sample — advisory, never a deterministic measurement.
What we checked — 51 dimensions across the health lenses
Each chip is a dimension scored from real signals across architecture, testing, dependencies, security & compliance, documentation, git-history and code quality — in one coherent pass. A surface report typically covers a handful.
How to trust any code-health report — three questions
Can you open the finding? Real findings cite a repo-relative file and line you can open at the cited line — never an absolute scratch path. Here, 1431 of 1447 do; the remainder are repo-wide signals — a dimension-level measurement, not a single line. (Every path in this report is repo-relative by construction: paths are normalized at the producer and the report is rejected if any rooted path leaks through.)
Is there a tool behind the number? Every score below names the method that produced it — Roslyn, git, a scanner, or (for a handful of documentation/naming dimensions) an LLM labelled sampled · advisory — not a narrative.
Does re-running give the same result? Run it again on the same commit and the score — and this report, byte for byte — is identical. A report whose numbers move between runs is describing the run, not the code.
This report answers yes to all three. That's the bar to hold any assessment to.
Tools & methods
The actual versions used this run (captured at analysis time) — re-run on the same commit for the identical score.
Method
Backs
Version
Evaluator
Roslyn static analysis
Complexity, cohesion, coupling, dead code, API surface, layering
What ran differently this time — a tool absent, degraded, or that fell back to an estimate. Named openly, not folded silently into the scores. A degraded run also records its exact cause in diagnostics.md.
D8 Code Coverage — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: test source is present (.py) but the built-in coverage collector has no runner for this repository's ecosystem — so this suite was never executed by it. Not scored — this is a gap in the analyzer's language coverage, not a defect in the repo. To have real coverage read, produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures. You can widen what we reach: optional: produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures — then the real number is read on the next scan.
D12 Dependency Hygiene — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. No dependency manifest this pass reads for hygiene (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems)) was found in this repository, so no package was assessed. Zero packages read is NOT a clean dependency tree, so this is NOT SCORED — a gap in the analyzer, not a verdict about this repository. This row is about dependency HYGIENE — outdated, deprecated or unmaintained direct dependencies; known CVEs in the same dependency graph are a separate question, reported under D30 wherever the manifest is OSV-readable.
D14 License Compliance — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Not scored — no dependency manifest this pass reads for licence data (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems)) was found in this repository, so it declares no third-party dependency closure to grade. A gap in the analyzer, NOT a finding that this repository's licences are compliant: a manifest in an ecosystem outside that list, or third-party code copied into the tree, is not read — so this dimension asserts nothing about this repository's licensing in either direction.
D27 Navigability — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Navigability is taken over call sites whose callee resolved. For C# that population includes calls into referenced assemblies; for this language only calls declared inside the repository count, so the abstention threshold reads the repository's use of its standard library as a resolution failure. That is a limit of this analyzer, not a build problem in this repository.
D44 Platform End-of-Life — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This dimension reads a project's own statement about the platform it runs on: a TargetFramework in a .NET project file, a .nvmrc or .python-version, a capped requires-python, a Rust toolchain file or Cargo.toml rust-version, a .go-version, .java-version, .ruby-version, .tool-versions or .sdkmanrc, a go.mod go directive, a Maven or Gradle Java level or toolchain, a Gemfile's ruby directive, a mix.exs elixir requirement, a rebar.config minimum_otp_vsn, a pubspec.yaml SDK constraint, a build.sbt scalaVersion, or a framework major pinned by a dependency constraint. This repository carries none of them, so nothing about its platform was established. That is a gap in this analyzer's coverage, NOT a finding that the platform is supported — a language whose runtime is declared elsewhere (Package.swift, a Dockerfile) is simply not read here yet.
AX6 Interface segregation — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check is computed over the public interfaces this run's compilations declare, and none was loaded, so it had nothing to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
C1 Data Protection — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
GD1 Unfinished & placeholder code — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby and Scala source only, and no C#, F#, JavaScript/TypeScript, Dart, Ruby or Scala was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
IC1 Incompleteness & stubs — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby and Scala source only, and no C#, JavaScript/TypeScript, Java, Dart, Ruby or Scala was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
P5 DR & Backup — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found. Whether there is anything here to recover could NOT be determined: persistence is detected from deployment/container manifests and from dependency manifests, and neither was readable by this pass, so a data store this code opens directly — a file, an embedded database — would not be visible to it. The blindness is this analyzer's, not a finding that the repository holds no data. You can widen what we reach: keep the deployment/container manifest or a dependency manifest in this repository — or a link to the ops repo that holds the DR evidence — so the persistence probe has something to read.
S1 Web-Security Posture — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
X16 Unfloored truncation loop — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, PHP, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X18 Disposal-pattern correctness — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala and PHP source only, and no C# was loaded and no JavaScript/TypeScript, Java, Kotlin, Dart, Ruby, Scala or PHP was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X29 Per-element action decided by a fixed element — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala and Kotlin source only, and no C# was loaded and no JavaScript/TypeScript, Java, Rust, Dart, Ruby, Scala or Kotlin was found in this repository, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X4 Structured logging — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, and JavaScript/TypeScript, Java, Kotlin, Python, PHP, Dart, Ruby, Scala and Rust source only, and no C# was loaded, and this repository's JavaScript/TypeScript, Python and PHP make no call through a named logger, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
X5 Nullable reference types — not measured this run — Watchdog could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, and Kotlin source only, and no C# was loaded, no TypeScript was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
Repo exclusion declarations (.gitattributes linguist-generated/vendored, .editorconfig generated_code): none declared — every source file was scored.
Limitations & what we did not check
Watchdog assesses the repository exactly as committed, and only the repository. By design it does not reach outside the source tree: the live cloud account, the running CI/CD pipeline, the host's branch-protection and approval rules, the production configuration, or a restore actually exercised against a backup are all out of scope. That boundary is a feature, not a gap — a repo-relative, deterministic scan re-runs identically on any commit and every finding opens at a real file and line, where a live audit can neither be reproduced nor traced. The visible consequence is that controls which leave no in-repo evidence are reported as "not evidenced" and excluded from the score rather than awarded a number a static scan cannot justify.
Per-dimension blind spots
For each dimension that was measured, what a static, repo-only scan structurally cannot see — the honest edge of the measurement, not a failure of it.
D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
D6 Cohesion (LCOM4): LCOM4 cohesion is syntactic — it infers connectivity from which methods touch which fields/methods by name, not from real runtime behaviour or intent.
D9 Test Distribution: The test-pyramid shape is inferred from project/folder naming and references, with a single test host bucketed per-file by its path tier and content signals — a suite that names tiers unconventionally and gives no per-file signal can still be mis-bucketed.
D11 Test Reliability: Flakiness is inferred from history/markers — Watchdog runs the suite once (for coverage), not the repeated runs under varied conditions that reveal nondeterminism, so a flaky test never recorded as failing is invisible here.
D13 REDACTED Scanning: REDACTED detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
D19 Documentation Quality: Documentation quality is judged by an LLM over a bounded sample of docs — it reads what is written, not whether the docs match the running system, and it is advisory, not a measurement. Its critique rows are drawn from a closed category vocabulary and each row means the same thing in every run, so two scans can be compared row by row; the SET that fires is still a sample, and does not repeat exactly. Measured on one frozen input, six scans at one engine SHA: 2-5 critique rows per scan, 8 distinct rows across the six, 3 of those 8 seen in only one scan. So a D19 row is evidence about the documentation, but a COUNT of D19 rows is not a quantity — never read a change in it as an improvement or a regression.
D20 ADR Quality: ADR quality is an LLM read of the decision records present — it cannot know about decisions made and never recorded, and its verdict is sampled and advisory.
D21 Naming Consistency: Naming quality is an LLM judgement over a bounded sample — it assesses clarity/consistency of the names it sees, not domain-correctness, and is advisory.
D22 Internal API Consistency: API-surface coherence is an LLM judgement over a sample of the public surface — consistency of intent across the whole API is approximated, not exhaustively verified.
D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
D32 Data Compliance (PII/GDPR): PII/GDPR signals are heuristic pattern matches in code — they flag likely handling concerns, not legal compliance, and cannot trace where data actually flows at runtime.
D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
M4 Documentation accuracy: Onboarding quality is an LLM read of the docs/setup present — it cannot run the onboarding or measure how long a real new joiner takes; the verdict is sampled and advisory.
P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.
The LLM boundary
LLM-set scores this run (4): D19, D21, D22, M4 (model: Local LLM). For these, a model reads a bounded sample and sets the numeric score; each names its own sample and method on its card. They are sampled and advisory by design: they vary at the margins between runs and are never a deterministic measurement. Every other score in this report is tool-computed at confidence 1.0.
What it measures: How tangled the control flow is — methods with many branches are hard to test and change.
Method: Cyclomatic complexity per method (1 + decision points), computed exhaustively across production source; test projects separated by convention. Deterministic.
+ 147 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 5 bodies over 60 down to 60 or less in Cyclomatic Complexity — start with GenericIE._real_extract (cyclomatic 227), YoutubeIE._real_extract (cyclomatic 187), youtube_dl._real_main (cyclomatic 121). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 5 together lifts Cyclomatic Complexity from 2.0 to about 5.0/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cyclomatic Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d1_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: How hard the code is for a person to follow, beyond raw branching.
Method: Cognitive complexity per method (Sonar-style nesting-penalized score), computed exhaustively over production code, excluding test projects. Deterministic.
+ 284 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Bring the 28 bodies over 60 down to 60 or less in Cognitive Complexity — start with YoutubeIE._real_extract (cognitive 382), GenericIE._real_extract (cognitive 287), JSInterpreter.interpret_statement (cognitive 226). — This score is capped by its worst body, so a finding fixed alone moves it by almost nothing — the next one down takes its place. Refactoring these 28 together lifts Cognitive Complexity from 2.0 to about 3.2/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.
Enforce Cognitive Complexity in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d2_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D3 · God Classes9.4 / 10Stronggated by 19 serious findings✓ Tool-verified
What it measures: Over-large classes that try to do too much ("god classes").
Method: God-class detection by line and method-count thresholds per logical type (partial classes unified), filtered for generated code and registration/contract false positives. Deterministic.
Resolve the 15 FileTooLong finding(s) in God Classes — start with generic.py, REDACTED, REDACTED. — One of this dimension's main actionable groups (15 warning-level).
Resolve the 4 TooManyMethods finding(s) in God Classes — start with REDACTED (2), YoutubeDL.py, REDACTED. — One of this dimension's main actionable groups (4 warning-level).
Enforce God Classes in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d3_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Copy-pasted code that should be shared instead.
Method: Code duplication via token-stream sliding windows with type-aware normalization (locals masked, type names preserved), density-scored per KLoC of production code. Deterministic.
56 duplicated block group(s) detected. One further row reports members as variants of one another; it aggregates block groups already counted above and is not itself counted.
+ 33 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 5 Duplicated block (8 lines × 2) finding(s) in Code Duplication — start with external.py, dplay.py, metacafe.py. — One of this dimension's main actionable groups (5 warning-level).
Resolve the 4 Duplicated block (11 lines × 2) finding(s) in Code Duplication — start with ard.py, byutv.py, REDACTED. — One of this dimension's main actionable groups (4 warning-level).
Resolve the 3 Duplicated block (14 lines × 2) finding(s) in Code Duplication — start with REDACTED, REDACTED, options.py. — One of this dimension's main actionable groups (3 warning-level).
Enforce Code Duplication in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Verified — provenance only; does not change the score.
Detailed fixes: d4_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether a class's methods are focused on a single responsibility.
Method: LCOM4 cohesion per production class with at least two methods: connected components of methods sharing state or calls, computed syntactically. Deterministic, not a proxy.
Coverage: Exhaustive · type-level: LCOM4 cohesion computed over every production class — the population is all types, not a name convention.
D9 · Test Distribution10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the test suite has a healthy mix of unit / integration / end-to-end tests.
Method: Test projects classified (Unit/Integration/BDD/E2E) from compiled metadata; test methods counted exhaustively across projects with placement-agnostic disk fallback. Deterministic.
346 test methods: 346 unit, 0 integration, 0 BDD, 0 e2e. The Python suite contributes 346 test function(s) across 30 file(s) declaring at least one — every `def test…` in a file pytest or unittest would collect, which is those frameworks' own definition of a case; a parametrize table counts once, so this is a floor. Its tier split is read from file names and paths only.
✓ On the Gold path — maintain.
Detailed fixes: d9_recommendation.md.
Do you agree with this assessment?
D11 · Test Reliability10.0 / 10Exemplary✓ Tool-verified
What it measures: Whether the tests pass reliably, with no flakiness.
Method: Suite re-run N times within tiered wall-clock budgets (unit to e2e); tests failing non-deterministically across runs flagged; guarded tests retried when #if guards detected.
What it measures: Whether any secrets (keys, tokens, passwords) have leaked into the code.
Method: In-process native secret scanner (entropy plus signature patterns) across all tracked files; no external tool. A clean result is a measured 10, not no-data zero. Deterministic.
Resolve the 31 Leaked secret finding(s) in REDACTED Scanning — start with REDACTED (4), REDACTED (3), REDACTED (2). — One of this dimension's main actionable groups (31 issue-level).
Enforce REDACTED Scanning in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d13_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Files that change often and are also complex — the riskiest hotspots.
Method: Per production file churn times cyclomatic complexity over a rolling window, computed from git and Roslyn/JS/Razor analysis. Exhaustive, deterministic per commit date.
Resolve the 1 Hotspot finding(s) in Churn × Complexity Hotspots — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d15_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D16 · Bus Factor9.7 / 10Exemplary✓ Tool-verified
What it measures: Whether knowledge is concentrated in too few people (the "bus factor").
Method: Living knowledge per author via time-decayed commit attribution (6-month half-life, focus weighting) across largest source files. Deterministic, avoids blame's mechanical-refactor false positives.
9 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is REDACTED. Counted over 273 of the 863 production source files in this repository: 253 are under the ~2,400-byte size floor this dimension measures over, and the remaining 337 have no attributable history left to measure.
Off-boarding risk: anonymized user #1
✓ On the Gold path — maintain.
Detailed fixes: d16_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Acknowledged debt left in the code — TODOs, dead code, suppressed warnings.
Method: Roslyn syntactic debt markers (suppressions/TODO/FIXME/HACK/empty-catch/commented-code/Obsolete) plus SymbolFinder dead-code analysis; weighted-debt-per-KLoC density deducted 2.0x per unit. Deterministic, exhaustive.
95 deducted task-comment markers across 142113 LoC (0.1/KLoC) → score 9.9. Task comments only: this repository's language is read without a compiler, so D17's suppression, dead-code and commented-out-code arms did not run and this score counts fewer marker kinds than a .NET repository's would.
TodoComment · ×78REDACTED:2247
XxxComment · ×9test/test_http.py:170
FixmeComment · ×5youtube_dl/jsinterp.py:1013
HackComment · ×3REDACTED:2503
What to do
Resolve the 78 TodoComment finding(s) in Explicit Debt — start with REDACTED (8), jsinterp.py (6), REDACTED (5). — One of this dimension's main actionable groups (78 warning-level).
Resolve the 9 XxxComment finding(s) in Explicit Debt — start with mediasite.py (5), test_http.py, test_YoutubeDL.py. — One of this dimension's main actionable groups (9 warning-level).
Resolve the 5 FixmeComment finding(s) in Explicit Debt — start with REDACTED (3), jsinterp.py, generic.py. — One of this dimension's main actionable groups (5 warning-level).
Enforce Explicit Debt in CI to reach Verified (currently Documented). — Hardens enforcement from Documented toward Prevented — provenance only; does not change the score.
Detailed fixes: d17_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether the project's documentation is clear, complete, and useful.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic doc sample (READMEs plus first 25 architecture docs), with two-pass stability filtering. Advisory, sampled.
The repository's root README (README.md) and its companion docs are well structured. The root README is a comprehensive guide for installing youtube-dl on UNIX, Windows, and via pip, plus an overview of the project, links to developer instructions, and a list of topics such as 'DESCRIPTION', 'OPTIONS', 'CONFIGURATION', 'OUTPUT TEMPLATE', and more (clipped mid-DESCRIPTION). It also references architecture/Docs markdown files. The module-guide docs describe using the youtube_dl module in Python code with extract_info examples, playlist info extraction, and an extensive supported-sites list that is clipped before the outline sections are named.
What to do
Improve Documentation Quality — currently 8.0/10. — The repository's root README (README.md) and its companion docs are well structured. The root README is a comprehensive guide for installing youtube-dl on UNIX, Windows, and via pip, plus an overview of the project, links to developer instructions, and a list of topics such as 'DESCRIPTION', 'OPTIONS', 'CONFIGURATION', 'OUTPUT TEMPLATE', and more (clipped mid-DESCRIPTION). It also references architecture/Docs markdown files. The module-guide docs describe using the youtube_dl module in Python code with extract_info examples, playlist info extraction, and an extensive supported-sites list that is clipped before the outline sections are named.
Detailed fixes: d19_recommendation.md.
Do you agree with this assessment?
D20 · ADR Quality0.0 / 10Critical✓ Tool-verified
What it measures: Whether architecture decisions are recorded well (context, decision, consequences).
Method: Per-ADR judgment by language model at low temperature with two-pass stability; confidence is share of ADRs evaluated; enforcement-field presence detected deterministically. Advisory.
What it measures: Whether names — types, methods, variables — are clear and consistent.
Method: Judged by language model at low temperature (0.0-0.1) on a deterministic random symbol sample (fixed size, not exhaustive), with disclosed confidence band. Advisory, sampled.
0 naming inconsistencies across 0 sampled symbols.
✓ On the Gold path — maintain.
Detailed fixes: d21_recommendation.md.
Do you agree with this assessment?
D22 · Internal API ConsistencyStronggated by 2 serious findings◐ Sampled · advisory
What it measures: Whether the internal API surface is consistent and coherent.
Method: Judged by language model at low temperature over a sample of the public API surface (IsPackable or .Contracts types). Sampled, advisory; confidence discounted by model uncertainty.
2 API inconsistencies across a 400-member sample of 1586 exposed types.
Inconsistent capability checking methods across extractor and downloader domains. Extractors use `suitable` to check if a URL matches, while external downloaders use `supports` or `can_download` to check if a specific media format/info is supported. This forces consumers to use different method names and argument types (URL vs InfoDict) depending on whether they are checking for URL matching or format compatibility.
Inconsistent parameter handling for cache operations. `store`, `load`, and `clear` require explicit `section`, `key`, and `dtype` parameters, while `remove` takes no arguments (likely operating on the instance's current state or a default context). This breaks the symmetry of the cache API surface.
What to do
Resolve the 1 Inconsistent capability checking methods across extractor and downloader… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 Inconsistent parameter handling for cache operations. `store`, `load`,… finding(s) in Internal API Consistency. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d22_recommendation.md · top locations in Appendix A, every location in findings.md.
1 of 1 build units (Python) flagged as possibly oversized/incoherent.
Projects may be oversized for their cohesion
What to do
Resolve the 1 Projects may be oversized for their cohesion finding(s) in Project Cohesion. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d26_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether any secrets were ever committed — scanned across the full git history, not just now.
Method: REDACTED scan via TWO gitleaks detect passes in an isolated checkout — the full git history, then a second --no-git pass over the working tree as it stands — merged and de-duplicated by (rule, file, line); each match flagged High. Both invocations are recorded in the audit trail. Exhaustive; when the tool is absent, or when its output cannot be parsed into the expected shape, the dimension is WITHHELD as an explicit measurement gap on our side — unscored and excluded from the lens, never a hedged middling score.
58 finding(s): 0 critical, 58 high, 0 medium, 0 low. Remediation for historically-committed secrets is credential rotation — they remain in history regardless of later deletion.
REDACTED
REDACTED
REDACTED
What to do
Resolve the 57 REDACTED finding(s) in Secrets (history) — start with REDACTED (10), REDACTED (4), REDACTED (2). — One of this dimension's main actionable groups (57 issue-level).
Resolve the 1 High secret finding(s) in Secrets (history) — start with REDACTED. — One of this dimension's main actionable groups (1 issue-level).
Resolve the 1 Rotate the exposed credentials finding(s) in Secrets (history). — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d28_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Real static-analysis (SAST) findings — likely security bugs in the code, any language.
Method: Polyglot static analysis via semgrep across the repo using the pinned, image-baked p/security-audit + p/owasp-top-ten rulesets (no scan-time registry fetch); severity rules (ERROR/WARNING/INFO) map to a full-band severity-weighted score. Exhaustive, deterministic; degrades on parse failure.
Coverage: semgrep pattern rules over all files — exhaustive for the rule set, blind to classes of bug without a rule (clean = no rule matched).
53 finding(s): 0 critical, 14 high, 38 medium, 1 low. 8 unpinned-GitHub-Actions row(s) are reported here but scored by D36 (supply-chain provenance), which measures that posture as `pinned_actions` — one pinning decision is charged once, not once per lens. semgrep hit a parse error in 1 file(s) — `REDACTED` — so no absence of findings in them is evidence of anything, and nothing in them was analysed. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 1 file(s) (e.g. a workflow `run:` block read as shell). Those files WERE scanned and their other rows are unaffected; only those rules' view of those snippets is missing.
REDACTED
REDACTED
REDACTED
REDACTED
REDACTED
+ 8 more group(s) — more in Appendix A; the complete list is findings.md.
What to do
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED (2). — One of this dimension's main actionable groups (2 issue-level).
Resolve the 2 REDACTED finding(s) in Static Analysis (SAST) — start with REDACTED, REDACTED. — One of this dimension's main actionable groups (2 issue-level).
No action in Static Analysis (SAST) — all 8 REDACTED finding(s) are reported here at file:line but scored by D36 (supply-chain provenance), so none is charged to this dimension. — One of this dimension's main actionable groups (8 issue-level, 0 of them charged here).
Detailed fixes: d29_recommendation.md · top locations in Appendix A, every location in findings.md.
Do you agree with this assessment?
D32 · Data Compliance (PII/GDPR)9.0 / 10Stronggated by 1 serious finding✓ Tool-verified
What it measures: Likely personal-data (PII / GDPR) handling concerns — logging or storing data without safeguards.
Method: Heuristic PII/GDPR LEAK scan via semgrep across the repo, using Watchdog's own ruleset: personal data crossing a boundary it should not — reaching a log/console sink, a URL or query string, or unprotected browser storage. Matches map to severity and a 0-10 wide normalizer. A clean sweep is unscored rather than an unearned 10, and is a statement about the leak paths checked only — this dimension does not inventory the personal data a repository holds (the personal-data map and the C1-C5 compliance cards do that), so it never reports that a repository has no personal-data surface. Reported LOUDLY as a measurement gap if the ruleset is missing from the analyzer image. Exhaustive over the leak paths, advisory-leaning; degrades on parse failure.
Resolve the 1 REDACTED finding(s) in Data Compliance (PII/GDPR) — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Detailed fixes: d32_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether anyone still has living knowledge of each file, or it has been orphaned — last understood long ago by someone now gone quiet. The sibling of the bus factor: D16 asks who owns it, D34 asks whether anyone still knows it.
Method: File orphaning as total living-knowledge decay below one focused-commit's worth within a year, computed per-file from the D16 decay model. Exhaustive, deterministic over fixed history.
610 of 610 significant source file(s) are orphaned — their living knowledge has decayed to nothing, so no one currently understands them. The largest is REDACTED. Counted over 610 of the 863 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.
Resolve the 607 Orphaned file finding(s) in Knowledge Freshness — start with generic.py, YoutubeDL.py, REDACTED. — One of this dimension's main actionable groups (607 recommendation-level).
Resolve the 3 Most significant orphaned file finding(s) in Knowledge Freshness — start with REDACTED, REDACTED, REDACTED. — One of this dimension's main actionable groups (3 recommendation-level).
Resolve the 1 Dormant codebase finding(s) in Knowledge Freshness. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d34_recommendation.md · top locations in Appendix A, every location in findings.md.
What it measures: Whether files that change together actually belong together — pairs that repeatedly co-change in git history despite having no explicit code dependency, surfacing the hidden/logical coupling (and boundaries in the wrong place) a static scan can't see.
Method: Pairwise co-occurrence over the per-commit file sets in git history (production source only — tests and generated dropped): Degree-of-Coupling = shared ÷ min individual revisions, reported above noise floors (each file ≥10 revisions, ≥5 shared commits, ≥50% strength); sweeping commits excluded. Deterministic over fixed history.
Coverage: Population: PRODUCTION source files only — test and generated files are dropped before pairing, so a class co-changing with its own test (trivially ~100%) can't drown the real production↔production coupling. Pairs ranked by Degree-of-Coupling. A non-source file is never a coupling PARTICIPANT either: documentation, schemas, config and data files are dropped with the rest, so a code↔docs pair — a command and the reference page that restates it — is not reported however strongly the two co-change; nor is coupling that runs THROUGH a build step or config file.
What it measures: Whether the build pipeline provides supply-chain integrity — generated provenance/attestation, signed artifacts (cosign/sigstore), an SBOM, and pinned build actions. Presence of the configuration, not a runtime guarantee.
Method: Supply-chain provenance/signing read deterministically from CI/build config (.github/workflows, .gitlab-ci.yml, azure-pipelines, Jenkinsfile, .circleci) + the release surface: four signals — generated provenance/attestation (SLSA/in-toto/actions-attest), artifact signing (cosign/sigstore/gitsign), an SBOM (syft/sbom-action/*.spdx.json/*.cdx.json), and SHA-pinned build actions — scored 10·present/denom. NotApplicable without a build pipeline. Detects configuration presence, not runtime enforcement.
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing — start with REDACTED. — One of this dimension's main actionable groups (1 warning-level).
Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 recommendation-level).
Detailed fixes: d36_recommendation.md · top locations in Appendix A, every location in findings.md.
Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.
Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.
Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.
What to do
The domain core is a small share of production code, but most of the rest matched no layer vocabulary at all — so this is not yet an anemic-domain finding. The namespace/path convention could not place that code, which makes the composition above a statement about the naming, not about the design. Name the layers (or check that the repository's conventions differ from the ones this check knows) before reading a thin domain into it.
Other · Architecture — Whether the project-reference graph is acyclic (cycles block independent build/deploy and signal eroding boundaries).
Method: Project reference cycles via elementary-DFS over real .csproj references, using the engine shared with D5/D7; cyclic versus acyclic. Exhaustive, deterministic.
Other · Architecture — Whether dependencies point inward (Domain ← Application ← Infrastructure/Web) — the clean-architecture dependency rule, checked across the project graph.
Method: Layer violations by name-segment inference (Domain/Core to Application to Infrastructure/Web) over the project-reference graph. Exhaustive over all projects, deterministic.
Maturity · Maturity — Whether the repo and its projects have a README, and whether it's substantive and current.
Method: Filesystem scan: README presence, word count, and headings for depth; git history for staleness. Exhaustive across root and project dirs, deterministic.
What to do
Add an 'Architecture' / 'How it works' section to the root README — the high-level shape.
Maturity · Maturity — Whether key decisions (ADRs) and the high-level shape (C4/diagrams) are written down.
Method: Filesystem scan: ADR folder/naming conventions or content, plus Mermaid/PlantUML/C4/architecture.md discovery. Exhaustive, deterministic.
No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
What to do
Record your significant design decisions. Write one short document per decision, giving its date, the situation, the decision and its consequences, and keep them together with your other design documents. A docs/adr folder with each file named by number and title is the easiest place to find them.
Add a C4 context/container diagram (Structurizr, PlantUML or Mermaid) or an architecture.md overview.
Maturity · Maturity — Whether the repo is organised deliberately — src/test separation and consistent project naming.
Method: Filesystem scan: src/test folder separation and namespace-prefix consistency (majority RootNamespace agreement). Exhaustive across projects, deterministic.
Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
What to do
Group production code under src/ (or split deliberately, e.g. backend/ + frontend/) so production and tooling code aren't mixed at the root.
Maturity · Maturity — Whether the README actually describes the code that exists (LLM-judged, advisory).
Method: Judged by language model at low temperature: README accuracy versus actual projects, within a disclosed tolerance. Advisory, not a measured number.
README.md links to `day|week|month|year`, but `day|week|month|year` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — README.md:762
What to do
Reconcile the README with reality: README.md links to `day|week|month|year`, but `day|week|month|year` does not exist.
Readiness · Readiness — Whether an automated pipeline builds and tests every change.
Method: Filesystem scan: CI workflow files (.github/workflows, .gitlab-ci.yml, etc.) for build and test stages. Exhaustive, deterministic.
Do you agree with this assessment?
P10 · Library API & versioning10.0 / 10Exemplary○ Nothing flagged
Readiness · Readiness — For a library: a deliberate (small) public API surface and explicit semantic versioning so consumers can depend on it safely.
Method: Roslyn scan: public API surface area and semantic-versioning markers (SemVer attributes, changelog entries) for libraries; off .NET, a library is the ecosystem's publication act (an npm package that is not private and names an entry point, a PyPI distribution with a build system, a Rust library crate, a Maven/Gradle module that publishes, a Go module with no package main, a gemspec, a Composer library, a SwiftPM library product, a pub.dev or Hex package), its surface is the share of types the language model records as public (Rust, Swift, Java, Kotlin, Go, Dart; not measured where the model records no type visibility or, as in TypeScript, only module-level export), and its version is read from the manifest, a semver CHANGELOG, release tooling or semver git tags. Exhaustive, deterministic.
Do you agree with this assessment?
P2 · Observability0.0 / 10Critical✓ Tool-verified
Readiness · Readiness — Whether the code is diagnosable in production — structured logging, tracing/metrics, health checks.
No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
What to do
Write a diagnostic trail the user can hand back with a bug report: a log file under the platform's per-user data directory, switchable with a `--verbose`/`--debug` flag. Start with the error paths that emit nothing — a discarded error is the failure the user cannot describe and you cannot reproduce.
Readiness · Readiness — Whether SAST, secret/dependency scanning and performance benchmarking are wired in (presence, not runtime).
Method: Filesystem scan: SAST configuration, dependency-update automation, secret scanning, and a benchmark harness or benchmark step — in this repository's own ecosystem. Exhaustive, deterministic.
No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 20833 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
What to do
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Add gitleaks/trufflehog in CI to block PRs that introduce committed secrets.
Other · Code Health — Whether the code avoids sync-over-async (deadlock-prone blocking on tasks) and async void.
Method: Roslyn syntax scan: async methods scanned for .Wait()/.GetAwaiter().GetResult() and async-void outside event handlers. Deterministic, hard fact per invocation.
Other · Code Health — Whether any branch is dead by construction — a switch arm whose label can never equal a case-normalised subject, or an `else if` whose predicate the arm above has already swallowed.
Method: Roslyn syntax + semantics: switch labels compared against the subject's own case normaliser, and if/else-if chains checked for a literal an earlier arm's containment test already swallows. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X13 · Undrained process stream10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a child process that has BOTH standard streams redirected drains both — reading one to the end while the other is never read deadlocks once the child fills the unread pipe.
Method: Roslyn syntax + semantics: ProcessStartInfo launches with both streams redirected, checked for a drain of each stream across the enclosing type. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `spawn` imported from `child_process` whose stdout and stderr are both pipes (no options, no `stdio`, or `stdio` of `'pipe'`), bound to a local that never leaves its scope, where exactly one of the two streams is read, the other never, and the child’s `close`/`exit` (or the read stream’s end) is awaited; a shell redirect in the call’s arguments or a `kill` of the child suppresses it. The same rule reads Python’s `subprocess.Popen`, Dart’s `Process.start`, Ruby’s `Open3.popen3`, and Scala’s JDK process starts (`new ProcessBuilder(…).start()` with no `redirectErrorStream`/`redirectError`/`redirectOutput`/`inheritIO`, `Runtime.getRuntime.exec`) where one of `getInputStream`/`getErrorStream` is read and the other never while `waitFor()` is called or the read stream is read to its end. Deterministic, provable per finding. Advisory.
Other · Security — Whether a hand-rolled public/private IP check can be walked past — a method that unwraps IPv4-mapped IPv6 but returns the opposite verdict for the same host written as IPv4-compatible, 6to4 or NAT64.
Method: Roslyn syntax + semantics: methods that unwrap IPv4-mapped IPv6 and hand-roll IPv4 range carve-outs, checked for whether the IPv6 branch also accounts for the IPv4-compatible, 6to4 and NAT64 embeddings. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X15 · Unvalidated length from an untrusted reader10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a length read out of the stream being parsed is bounded before it is allocated or read — an unchecked count taken from the input lets the input choose the allocation.
Method: Roslyn syntax + semantics: integer lengths read from a BinaryReader and spent on a bulk read or an array allocation, checked for any comparison or bounding call on the value anywhere in the method. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X17 · Uncapped recursion over a caller-supplied document10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether a walk that recurses through a JSON/XML tree handed in by its caller bounds how deep it will go — an uncapped walk lets the document's nesting choose the stack depth, and the resulting StackOverflowException cannot be caught.
Method: Roslyn syntax + semantics: methods that take a JSON/XML document node and call themselves with a child of it, reachable from an externally-callable member of the same type that accepts a document, checked for any depth parameter, descent counter or threaded arithmetic anywhere in the walk. On a repository with no .NET source it reads TypeScript off the engine’s own token stream (test, vendored, generated and minified paths and `.d.ts` not) with the same rule: a function or method with a parameter typed as a document value — `unknown`, `any`, `object`, `Record<string, unknown|any>`, a JSON alias (`JsonValue`, `JSONObject`, …) or a DOM node global the file does not rebind — that calls itself (bare, or through `this` for a method, or hands itself to a call over the value as in `value.map(walk)`) with something it took out of that value and never through an ancestor accessor such as `closest()` or `parentElement`, that is exported or reached from an exported function (a public method of the same exported class) taking such a value, and that names no depth, level, nesting, recursion, remaining or budget anywhere and threads no `+`/`-` arithmetic through a self-call. Plain JavaScript is not read: with no annotation nothing tells a parsed document from a tree the code built itself. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that temporarily changes state belonging to the whole process — the working directory, an environment variable — puts it back on EVERY path: a restore reached only when nothing throws leaks the change to the rest of the process.
Method: Roslyn syntax + semantics: method bodies that write the process working directory or an environment variable and write it back in the same body, checked for whether that restore sits in a `finally`/`catch` or only on the straight-line path. On a repository with no .NET source the same rule reads production JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not): `process.chdir`, `process.env.NAME =`/`["NAME"] =` and `delete process.env.NAME`, and Deno’s `Deno.chdir`/`Deno.env.set`/`Deno.env.delete`, paired per function body (a nested function or arrow is its own body, and module top-level code is none), where the last write puts back a local the body captured from the same global or deletes a variable the first write set, with at least one statement between them; a write in a `catch`/`finally` of that body silences it. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a `when` guard is free of side effects — a guard that increments a counter or assigns while deciding whether its arm matches applies that change during PATTERN MATCHING, on an arm that may not be selected, and skips it entirely when a short-circuit to its left answers first.
Method: Roslyn syntax: `when` guards on case labels and switch-expression arms, read for a mutation (`++`/`--`/assignment) sitting in a position the guard's own `&&`/`||`/`??`/`?:`/`?.` can skip. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a method that TAKES a lock or semaphore and gives it back from a flag-guarded `finally` returns the value that flag implies — reporting success while the guard hands the primitive back admits a second caller the exclusion was there to keep out, and reporting failure while the guard keeps it leaves nothing to ever give it back.
Method: Roslyn syntax: `try` statements whose `finally` releases a synchronisation primitive under a bare local-bool guard, where the method also TOOK that same primitive before the `try`, checked for a `return` of a bool literal whose value disagrees with the flag state the method's own straight-line assignments put it in. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether the work a diagnostic log line costs is paid only when that line is wanted — C# evaluates a call's arguments BEFORE the call, so a trace/debug message joined or projected out of a collection is built in full on every pass, and then discarded by a sink the shipped configuration leaves switched off.
Method: Roslyn syntax: log calls at a diagnostic level (a `Log`-prefixed method naming Trace/Debug/Verbose, or a bare `Debug`/`Trace`/`Verbose` on a receiver named for a logger), whose argument list is read for a call whose cost scales with a sequence — a LINQ operator, a materialisation, `string.Join`, a serializer — with no enclosing level check or conditional-compilation region. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `debug`/`trace`/`verbose` call on a receiver named for a logger, or a `log`-prefixed method naming the level, whose argument calls an array operator (`map`/`filter`/`reduce`/`sort`/…), `Array.from`, `Object.keys/values/entries`, `JSON.stringify`/`util.inspect` over anything but a literal, or an array `join` — outside any arrow or function passed as an argument, which the logger calls only when the level is on — with no enclosing `if`, `&&` or `?:` whose condition names a level, a level string, or the `NODE_ENV`/`__DEV__`/`DEV` build switch. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X24 · Document value interpolated into markup unescaped10.0 / 10Exemplary○ Nothing flagged
Other · Security — Whether text read out of the document being converted is escaped before it is written into generated markup — a value the document's author chose, interpolated into an attribute the surrounding literal delimits, can close that attribute and open another.
Method: Roslyn semantic model over the whole compilation: a string-typed `Value`/`InnerText`/`InnerXml`/`Text` member declared inside `DocumentFormat.OpenXml` or `System.Xml` is a taint SOURCE, propagated through assignments, returns, arguments, tuple elements and string composition to its transitive closure, then read at interpolated-string holes that sit in a markup position the surrounding literal itself delimits. Escaper/encoder calls and enclosing validator conditions cut the flow. Flow- and container-insensitive by construction. A second arm needs no provenance at all and reports a type that CONTRADICTS ITSELF — the same expression escaped at one delimited markup hole and interpolated raw at another hole in the same markup position of the same type, which the type's own escaping proves is a defect without knowing where the value came from. On a repository with no .NET source it reads JavaScript/TypeScript off the token stream with the same rule: a DOM read of raw document text (`getAttribute`, `textContent`, `innerText`, `nodeValue`) is the source, propagated through local bindings and string composition, and judged at template-literal and concatenation holes in the same two delimited markup positions; escapers and validating conditions cut it, and documentation-site, test, vendored and minified scripts are not read. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value the caller is invited to supply is the value the type actually uses — a constructor parameter stored in a private field that nothing ever reads while the default it was given is spelled out a second time at the site that should have read it, a keyed lookup that falls back to a different setting than the one its key names while the same type falls back to the matching one for that same key, or a culture-sensitive parse given no format provider by a type that feeds its own settable culture to the same kind of parse elsewhere, or a number an entry point writes to standard output under the host's culture while the same entry point formats with the invariant culture elsewhere. Either way, every caller who supplies a value silently gets something else.
Method: Roslyn syntax: private instance fields of a non-partial type assigned in a constructor from one of its own parameters with a `??` fallback, checked for whether anything in the type body reads the field and whether that same fallback expression is spelled out again outside the constructor; and `??` fallbacks onto a member access from a lookup call carrying exactly one string literal, grouped by that key across the type and checked for a fallback member whose folded name disagrees with the key while a sibling site for the same key agrees with it. On a repository with no .NET source the first two arms read JavaScript/TypeScript off the engine’s own token stream (tests included, bundles and vendored paths not): a `#x`, `private` or `private` parameter-property instance field filled in the constructor from a parameter (or one member of one) through `??`/`||` or a parameter default, never read anywhere in the file by name, whose constructed default is spelled again in the class body; and `lookup("key") ?? s.member` grouped by key per class, or per module outside every class. The culture arm has no JavaScript counterpart: its parses take no locale. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether a value handed from a callback to the body that waits on it crosses on something built to be crossed — a `Queue<T>`/`List<T>`/`Dictionary<K,V>` written inside an event handler and read back outside it is mutated by two flows at once, and the semaphore or completion source beside it orders how MANY items exist while leaving the collection's own head, tail and backing array unprotected.
Method: Roslyn syntax: method, accessor, local-function and lambda bodies that declare BOTH a non-thread-safe generic collection (`Queue`/`Stack`/`List`/`Dictionary`/`HashSet`/`Sorted*`/`LinkedList`) and a synchronisation primitive (`SemaphoreSlim`/`TaskCompletionSource`/`ManualResetEvent(Slim)`/`AutoResetEvent`/`CountdownEvent`) as locals, then read for a `+=`-registered lambda that raises that primitive while the body outside every lambda waits on it — and, in that scope, a mutating call on the collection inside the lambda paired with a mention of it outside. Any `lock` in the scope abstains it. On a repository with no .NET source the same handoff is read in Java off the engine’s own token stream (test source sets, vendored and demonstration paths not): an `ArrayList`/`LinkedList`/`ArrayDeque`/`PriorityQueue`/`Hash*`/`LinkedHash*`/`Tree*` local and a `CountDownLatch`/`Semaphore`/`CompletableFuture` local, a lambda or anonymous class that raises the primitive and mutates the collection, and a wait outside it; any `synchronized` or `lock()` abstains the body. Because each of those primitives orders what the callback wrote before raising it, only a touch that provably overlaps the callback is convicted: one after the registration and before the next wait, or one in a loop registered-before, waiting on every pass and not declaring the collection. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X27 · Collection changed while being enumerated10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a `for` loop leaves the `dict`, `set` or `deque` it is walking alone — CPython's iterators over those check that the collection has not changed size since the loop began, so a body that removes from (or empties) the very collection the loop is walking makes the next step raise `RuntimeError: dictionary changed size during iteration` and the remaining items are never seen.
Method: Roslyn syntax + semantics: `foreach` statements whose body calls a structural mutator (`Add`/`Remove`/`Clear`/`Insert`/…) on the very expression the loop is enumerating. Two arms. ARM A — the source is a concrete fragile BCL collection, or a live `Keys`/`Values` view over one, and the mutator resolves to that same collection's own member; concurrent and immutable collections and arrays are outside the population by construction, since their enumerators survive a structural change. ARM B — the source is an argument-less accessor CALL on a receiver whose body is in source: the accessor must return a stored field VERBATIM and a sibling member must structurally change that same field, both read off the implementations rather than from the members' names. A mutation the loop provably exits immediately after (`break`/`return`/`throw`/`goto`), or one written inside a nested loop or a lambda, is counted and never reported. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
X28 · Index access outside its own emptiness guard10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a condition that tests a value for emptiness indexes that same value only where the test holds — an `||` written one parenthesis too far to the left leaves an index access outside the guard beside it, so the empty case the guard exists to anticipate reaches the index and throws.
Method: Roslyn syntax only, no semantic model: the OUTERMOST `&&`/`||` of every boolean condition, read for a symbol the condition tests for emptiness (`string.IsNullOrEmpty`/`IsNullOrWhiteSpace`, a `Length`/`Count` comparison against a literal, `Any()`, a `Length`/`Count` pattern, or a comparison against `""`) and ALSO indexes. Each `symbol[...]` access is placed by a boolean-reachability walk from the access up to the outermost connective: an access is COVERED when some enclosing step has it in the right operand and the left operand, under the truth value that step forces, proves the symbol non-empty — a recursion over `&&`/`||` whose true- and false-directions are asymmetric. A finding needs BOTH an uncovered access and a covered one on the same symbol in the same condition, which is the agreeing twin that separates a misplaced parenthesis from an unrelated length test. Bare index accesses with no emptiness test in the condition are neither counted nor reported; a non-identifier receiver and a lambda nested inside the condition are outside the population. Deterministic, provable per finding. Advisory.
Other · Code Health — Whether exceptions are handled rather than silently swallowed or rethrown with lost stack traces.
Method: Roslyn syntax scan: every catch clause counted; empty catches and bare rethrows flagged. Population is all catch clauses, not estimated. Deterministic, hard fact.
An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it. (×5) — devscripts/make_lazy_extractors.py:130, REDACTED:283, youtube_dl/YoutubeDL.py:2534, …
`except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×4) — REDACTED:1805, youtube_dl/jsinterp.py:1444, youtube_dl/downloader/fragment.py:81, …
An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `__del__()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch. — REDACTED:3740
What to do
Swallowed exception (empty catch)
Do you agree with this assessment?
X30 · Support guard that admits what it rejects10.0 / 10Exemplary○ Nothing flagged
Other · Code Health — Whether a guard written as a NEGATED `||` says what its author meant — `!(a || b || x != k)` is `!a && !b && x == k` by De Morgan, so a bail-out that mixes capabilities the code needs with a fault it refuses turns inside out: it fires only where the capabilities are ABSENT, and lets every value the fault term names walk straight into the body that cannot handle it.
Method: Roslyn syntax only, no semantic model: every logical-not whose operand is a parenthesised `||` chain of two or more disjuncts, flattened (a left-nested `a || b || c` read once would see `(a || b)` as one disjunct). A site enters the population on that shape alone. A finding additionally needs the disjuncts to DISAGREE in polarity: at least one bare boolean read — an identifier or member access, never an invocation, which is a predicate rather than a capability flag — and at least one `x != <constant>`, the only form that negates into an exact-value pin (`== null` negates into a looser requirement and is outside the fault set). Consistently-polarised disjunctions, all-fault or all-capability, are counted and never reported; a negated `&&` is outside the population entirely. No same-receiver gate: it was measured to cost a real defect and remove no false positive. Deterministic, provable per finding. Advisory.
Do you agree with this assessment?
Reference — by lens
The score is the rank-weighted fold of these lenses (worst-heaviest), each including its meta-dimensions; a lens with a Critical contributor is capped at Fair (its band reads "gated by …") and is never the strongest area however high its average.
Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Unscored — 3 check(s) recorded observations but carry no score
These checks ran and found something, but they do not carry a score — either by design (an advisory check reports evidence rather than grading it) or because they could not be scored here. They are excluded from the score for that reason, not because there was nothing to see.
X10 Duplicated predicate — 21 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X6 Hand-rolled structured-format parsing — 31 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
X7 Silent fallback defaults — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 2 control(s) we could not find positive evidence for
These checks grade a working control, and the repository shows no evidence of one. That is deliberately not scored as a zero: a repository cannot show an ops runbook, a database TTL or an infrastructure-side audit log, so absence of evidence here is not evidence the control is missing. It is also not a statement that the check is irrelevant to this codebase — the thing it grades applies; we just could not see it. Excluded from the score either way.
P4 Deployment & Rollback — not evidenced — no deploy/rollback/approval signal in the repo; absence of evidence is not evidence of a manual release
P5 DR & Backup — not evidenced — repo shows no backup/RTO/RPO controls; absence of evidence is not evidence of a working control
Not included — 64 check(s) not relevant to this codebase
These checks had nothing to measure here (no tests, no git history, the codebase is small, or the architecture style doesn't apply), so they're omitted above rather than scored low.
AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
AC7 A11y enforcement — No web markup found — accessibility is not applicable to this repository.
AX1 Captive dependencies — Not applicable: this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads.
AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX6 Interface segregation — not assessed — interface segregation is computed over a type surface that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
AX7 Slice cohesion — not applicable — not a vertical-slice architecture
AX8 Test isolation — no test/production split to check
AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
AXB1 Runtime evidence locked — no reproducible boot — This repository has nothing the runtime tiers could boot or serve — no markup, no UI framework or web-server dependency, no UI component source, no native UI project and no API definition — nothing here is a surface to boot — so runtime a11y/egress/header evidence has no subject here. Not applicable: this is neither a gap in the scan nor a finding about your code.
AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
C2 Access Controls — No access-control surface detected in the analyzed source — this repository registers no route and starts no server another machine can reach (no Flask/FastAPI/Starlette route, Django urlpatterns or class-based view, Tornado handler). Access control is therefore N/A here — a library or command-line tool is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or MongoEngine model, a migration or a SQL schema — and no database or data-store client (Django ORM, SQLAlchemy, psycopg, PyMongo, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
D10 Test Quality — ~8157 lines of test source are present (.py) but no test cases reached the test census for this repository — no test root we could resolve declared them, or the files we read declare no cases in a test framework we recognise — so skipped/assertion-free tests couldn't be counted. Not scored — this is a gap in the analyzer, not a finding about this repository.
D12 Dependency Hygiene — Dependency hygiene not measured — no supported dependency manifest was read
D14 License Compliance — No dependency manifest found — no declared dependency closure to grade for licences
D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ projects each declaring an entity of their own. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
D24 Comment Value — No inline comments to assess — comment value is not applicable here.
D25 ADR Conformance — no ADRs to check
D27 Navigability — D27 counts a call into the standard library or a dependency as unresolved for this repository's language (.py), so too few call sites counted as resolved to assess navigability. Not scored: this is a gap in the analyzer, not a verdict about this repository.
D30 Dependency Vulnerabilities — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
D31 IaC & Container Security — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
D37 Vulnerability-disclosure Policy — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
D39 IL Efficiency — D39 measures the IL emitted by a .NET build; this repository has no .NET solution or project files, so the dimension does not apply.
D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
D43 Malicious Dependencies — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
D44 Platform End-of-Life — Platform end-of-life not assessed — this repository declares no platform this pass reads
D5 Coupling — Not applicable — this Python build ships 1 production module(s), so there is no coupling BETWEEN modules to measure. (Its test and non-production modules are not part of the shipped graph.)
D7 Architectural Integrity — no checkable ADRs, and no project-reference graph for the cycle pass to read — so this dimension makes no claim about dependency cycles in either direction (where this repository's language has an import-cycle lens, cycles are reported there). Architectural integrity not assessed
D8 Code Coverage — Coverage not included — suite not readable by the collector
DM1 Domain Modelling — not scored — this repository shows none of the 3 signals this lens looks for
ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby and Scala, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
P12 CI test-gate honesty — Reported, not scored — and nothing was matched here. The coverage check applies to any stack, and the automatic-re-run check to any GitHub-Actions workflow, but the checks for excluded tests, skipped tests and sleep-based synchronisation currently recognise only some ecosystems' test-runner idioms, so on a repository built with another stack the zeros below mean 'not checked', not 'clean'.
P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the Python source, so there is no service whose uptime a failing dependency could take down
P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
P9 Domain vs controller coverage — no coverage report found on disk — produce a coverage report in a standard format (`coverage run -m pytest` then `coverage xml`) and commit it — a hosted scan measures a clone of the repository, so a report that exists only in a working tree, a CI runner's or your own, never reaches it; the artefact is commonly gitignored, so `git add -f` that one file (or un-ignore its path) and commit it alongside the code it measures, or wire coverage collection into CI, to enable this cross-layer check
PF1 Benchmark discipline — Not applicable: no benchmark suite was found. This check searched for a pytest-benchmark or pytest-codspeed dependency with tests taking the `benchmark` fixture, an asv.conf.json with its `time_`/`mem_`/`peakmem_` benchmarks, or a pyperf Runner, and for a `*benchmark*` script that this repository's CI runs. Benchmarks are credited as a bonus, so their absence is neither scored nor deducted.
PF2 Allocation hygiene — Not applicable: Python runs on a garbage-collected runtime that gives a program no allocation-control idiom to choose on a hot path — no pools, stack allocation or value types — so allocation awareness is not something this code can be rated on.
PF3 Async & latency hygiene — Not applicable: this repository declares no async functions, so there is no asynchronous code for a blocking call to stall.
S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
X16 Unfloored truncation loop — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X18 Disposal-pattern correctness — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X29 Per-element action decided by a fixed element — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
X4 Structured logging — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
Appendix A — Findings (grouped)
The findings behind the scores, grouped by severity, then by dimension and kind. The high-severity issues are enumerated in full below; items per group are capped at 25 with any overflow stated explicitly per group, never silently truncated. The complete machine-readable list of every finding (all severities) is the companion findings.md in this report's bundle.
TodoComment REDACTED:2247— # TODO: HTML5 allows entities without a semicolon. For example, — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:6178— # TODO: fallback to CLI tools — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/traversal.py:3— # TODO: move these utils.fns here and move import to utils — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/swfinterp.py:698— # TODO warn here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/jsinterp.py:268— # TODO: Symbol, BigInt — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/jsinterp.py:440— # TODO: execute matches with these flags (remaining: d, y) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/jsinterp.py:553— # TODO: [MDN] When a segment overflows or underflows its expected — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/jsinterp.py:952— # TODO: make interpret_statement do this properly, if possible — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/jsinterp.py:1128— # TODO: handle extreme sparsity without memory bloat, eg using auxiliary dict — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/jsinterp.py:1366— # TODO: argvals[1] callable, other Py vs JS edge cases — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:3294— # TODO: [Base]ExceptionGroup (3.12+) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/YoutubeDL.py:1214— # TODO: skip failed (empty) entries? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/YoutubeDL.py:1810— # TODO Central sorting goes here — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/YoutubeDL.py:1961— # TODO: backward compatibility, to be removed — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/YoutubeDL.py:2121— # TODO: Check acodec/vcodec — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:247— # TODO: reverse actual botguard identifier generation algo — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:3610— # TODO: add support for nested playlists so each shelf is processed — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:3612— # TODO: this includes only first N items — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:3617— # TODO — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:4184— # TODO: full playlist requires _reload_with_unavailable_videos() — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/extractor/yandexdisk.py:95— # TODO: figure out how to detect if download limit has — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment REDACTED:24— # TODO: fix url _type result processing — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/extractor/vk.py:257— # TODO: use act=show to extract view_count — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/extractor/vimeo.py:145— # TODO: fix handling of 308 status code returned for live archive manifest requests — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
TodoComment youtube_dl/extractor/ustream.py:145— # TODO: generate a MPD doc for external players? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FileTooLong: extractor/generic.py youtube_dl/extractor/generic.py— FileTooLong — 2515 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 2015 over it, 5.03× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 2463 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1963 over it, 4.93× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 2329 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 1829 over it, 4.66× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: REDACTED REDACTED— FileTooLong — 1401 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 901 over it, 2.80× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: youtube_dl/YoutubeDL.py youtube_dl/YoutubeDL.py— FileTooLong — 1082 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 582 over it, 2.16× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: youtube_dl/jsinterp.py youtube_dl/jsinterp.py— FileTooLong — 974 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 474 over it, 1.95× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: youtube_dl/options.py youtube_dl/options.py— FileTooLong — 887 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 387 over it, 1.77× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: extractor/bbc.py youtube_dl/extractor/bbc.py— FileTooLong — 808 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 308 over it, 1.62× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: youtube_dl/swfinterp.py youtube_dl/swfinterp.py— FileTooLong — 733 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 233 over it, 1.47× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: extractor/orf.py youtube_dl/extractor/orf.py— FileTooLong — 589 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 89 over it, 1.18× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: extractor/peertube.py youtube_dl/extractor/peertube.py— FileTooLong — 528 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 28 over it, 1.06× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: extractor/twitter.py youtube_dl/extractor/twitter.py— FileTooLong — 526 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 26 over it, 1.05× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: youtube_dl/casefold.py youtube_dl/casefold.py— FileTooLong — 522 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 22 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: postprocessor/ffmpeg.py youtube_dl/postprocessor/ffmpeg.py— FileTooLong — 520 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 20 over it, 1.04× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
FileTooLong: extractor/npo.py youtube_dl/extractor/npo.py— FileTooLong — 519 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 19 over it, 1.04× 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.
XxxComment test/test_http.py:170— # XXX: Python 3 http server does not allow non-ASCII header values — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment test/test_YoutubeDL.py:350— # XXX: In real cases InfoExtractor._parse_mpd_formats() fills up 'acodec' — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment youtube_dl/jsinterp.py:980— # XXX: This works for now, but makes debugging future issues very hard — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment youtube_dl/extractor/mediasite.py:131— # XXX: add UrlReferrer? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment youtube_dl/extractor/mediasite.py:134— # XXX: might have also extracted UrlReferrer and QueryString from the html — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment youtube_dl/extractor/mediasite.py:181— # XXX: if Stream.get('CanChangeScheme', False), switch scheme to HTTP/HTTPS — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment youtube_dl/extractor/mediasite.py:222— # XXX: Presentation['Presenters'] — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment youtube_dl/extractor/mediasite.py:223— # XXX: Presentation['Transcript'] — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
XxxComment youtube_dl/extractor/lecture2go.py:49— # XXX: currently broken — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Swallowed exception (empty catch) devscripts/make_lazy_extractors.py:130— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:283— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) REDACTED:3740— An empty catch block silently discards the error — failures vanish with no log and no rethrow. On a teardown path letting it propagate is not an option (throwing out of `__del__()` masks the failure already in flight and abandons the rest of the cleanup), so make the swallow deliberate instead: narrow the catch to the exception this release can actually raise, and record it through whatever this codebase already uses to report problems — or, if it truly cannot matter, say why in a comment on the catch.
Swallowed exception (empty catch) youtube_dl/YoutubeDL.py:2534— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) youtube_dl/downloader/fragment.py:285— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
Swallowed exception (empty catch) youtube_dl/downloader/common.py:234— An empty catch block silently discards the error — failures vanish with no log and no rethrow. Log it, handle it, or don't catch it.
FixmeComment youtube_dl/jsinterp.py:1013— # FIXME — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment REDACTED:2892— # FIXME: raise error if .. is applied at toplevel? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment REDACTED:2975— # FIXME: what if the selector is "*" ? — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment REDACTED:3006— # implicit all (FIXME: keep this?) — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
FixmeComment youtube_dl/extractor/generic.py:2710— # FIXME: unescaping the whole page may break URLs, commenting out for now. — source code is not a task system: move the work to your tracker and leave a reference instead (e.g. `# REF: #123`), so the task is planned where tasks live and the ticket links back to the code.
Duplicated block (8 lines × 2) youtube_dl/downloader/external.py:444— youtube_dl/downloader/external.py:444-451 | youtube_dl/downloader/rtmp.py:101-108 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 2) youtube_dl/extractor/dplay.py:228— youtube_dl/extractor/dplay.py:228-235 | youtube_dl/extractor/npo.py:230-237 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/dplay.py:228` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) youtube_dl/extractor/metacafe.py:236— youtube_dl/extractor/metacafe.py:236-243 | youtube_dl/extractor/nobelprize.py:38-45 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (8 lines × 2) youtube_dl/extractor/redtube.py:90— youtube_dl/extractor/redtube.py:90-98 | youtube_dl/extractor/udemy.py:290-297 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (8 lines × 2) youtube_dl/extractor/tudou.py:20— youtube_dl/extractor/tudou.py:20-27 | youtube_dl/extractor/tudou.py:42-49 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/tudou.py:20` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
TooManyMethods: InfoExtractor REDACTED:98— TooManyMethods — 124 methods. The bar is 30 methods; this is 94 over it, 4.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: YoutubeDL youtube_dl/YoutubeDL.py:148— TooManyMethods — 67 methods. The bar is 30 methods; this is 37 over it, 2.23× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: FileDownloader youtube_dl/downloader/common.py:21— TooManyMethods — 36 methods. The bar is 30 methods; this is 6 over it, 1.20× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
TooManyMethods: YoutubeIE REDACTED:685— TooManyMethods — 34 methods. The bar is 30 methods; this is 4 over it, 1.13× the bar. To reduce it, group the members that share the same data into a smaller type of their own and delegate to it, so no single type carries every responsibility.
Duplicated block (11 lines × 2) youtube_dl/extractor/ard.py:84— youtube_dl/extractor/ard.py:84-94 | youtube_dl/extractor/tvplay.py:265-275 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 2) youtube_dl/extractor/byutv.py:87— youtube_dl/extractor/byutv.py:87-97 | youtube_dl/extractor/crackle.py:107-117 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/byutv.py:87` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (11 lines × 2) REDACTED:4867— REDACTED:4867-4887 | REDACTED:4919-4929 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:4867` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 2) youtube_dl/extractor/howcast.py:28— youtube_dl/extractor/howcast.py:28-43 | youtube_dl/extractor/rottentomatoes.py:22-32 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/howcast.py:28` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Swallowed exception (caught, then discarded) REDACTED:1805— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) youtube_dl/jsinterp.py:1444— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) youtube_dl/downloader/fragment.py:81— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
Swallowed exception (caught, then discarded) youtube_dl/extractor/wwe.py:135— `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
HackComment REDACTED:2503— # HACK: The following are the correct unquote_to_bytes, unquote and unquote_plus — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment REDACTED:2585— # HACK: The following is the correct parse_qs implementation from cpython 3's stdlib. — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
HackComment REDACTED:3106— # HACK: The default implementations of os.path.expanduser from cpython do not decode — a workaround marked in source: record what it is compensating for and what would allow its removal (the upstream fix, the API it is waiting on, the invariant it restores), so the next reader can judge whether it is still needed rather than rediscovering why it is there.
Duplicated block (14 lines × 2) REDACTED:531— REDACTED:531-544 | REDACTED:552-565 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:531` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (14 lines × 2) REDACTED:3818— REDACTED:3818-3831 | REDACTED:3933-3946 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (14 lines × 2) youtube_dl/options.py:146— youtube_dl/options.py:146-159 | youtube_dl/options.py:759-772 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:146` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (7 lines × 2) youtube_dl/downloader/external.py:159— youtube_dl/downloader/external.py:159-165 | youtube_dl/downloader/external.py:208-214 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `youtube_dl/downloader/external.py:156` calls `_bool_option`, `_valueless_option` and `youtube_dl/downloader/external.py:207` does not — after which the two agree again for 2 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
Duplicated block (7 lines × 2) REDACTED:302— REDACTED:302-308 | REDACTED:355-363 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `REDACTED:355` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7 lines × 2) youtube_dl/extractor/maoritv.py:25— youtube_dl/extractor/maoritv.py:25-31 | youtube_dl/extractor/thestar.py:29-36 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/maoritv.py:25` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (5 lines × 2) youtube_dl/extractor/filmon.py:45— youtube_dl/extractor/filmon.py:45-49 | youtube_dl/extractor/filmon.py:130-134 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (5 lines × 2) youtube_dl/extractor/imggaming.py:57— youtube_dl/extractor/imggaming.py:57-62 | youtube_dl/extractor/sevenplus.py:59-63 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (5 lines × 2) REDACTED:407— REDACTED:407-411 | REDACTED:436-440 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–15 lines × 2) youtube_dl/extractor/dplay.py:232— youtube_dl/extractor/dplay.py:232-243 | youtube_dl/extractor/generic.py:3573-3587 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12–15 lines × 2) youtube_dl/extractor/limelight.py:166— youtube_dl/extractor/limelight.py:166-180 | youtube_dl/extractor/theweatherchannel.py:75-86 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (12 lines × 2) youtube_dl/YoutubeDL.py:1464— youtube_dl/YoutubeDL.py:1464-1475 | youtube_dl/YoutubeDL.py:1476-1487 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/YoutubeDL.py:1464` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (12 lines × 2) youtube_dl/downloader/dash.py:22— youtube_dl/downloader/dash.py:22-33 | youtube_dl/downloader/ism.py:214-225 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (11 lines × 4) youtube_dl/options.py:184— youtube_dl/options.py:184-195 | youtube_dl/options.py:635-645 | youtube_dl/options.py:660-670 | youtube_dl/options.py:766-776 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:184` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 4) youtube_dl/options.py:439— youtube_dl/options.py:439-449 | youtube_dl/options.py:612-622 | youtube_dl/options.py:644-654 | youtube_dl/options.py:669-679 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:439` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11 lines × 3) youtube_dl/options.py:145— youtube_dl/options.py:145-155 | youtube_dl/options.py:746-756 | youtube_dl/options.py:758-768 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:145` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11 lines × 3) youtube_dl/options.py:480— youtube_dl/options.py:480-490 | youtube_dl/options.py:745-755 | youtube_dl/options.py:757-767 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:480` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10 lines × 2) youtube_dl/YoutubeDL.py:1244— youtube_dl/YoutubeDL.py:1244-1253 | REDACTED:4905-4914 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10 lines × 2) youtube_dl/extractor/npo.py:607— youtube_dl/extractor/npo.py:607-616 | youtube_dl/extractor/spiegel.py:42-54 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/npo.py:607` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 2) youtube_dl/extractor/atresplayer.py:90— youtube_dl/extractor/atresplayer.py:90-98 | youtube_dl/extractor/swrmediathek.py:78-86 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (9 lines × 2) youtube_dl/swfinterp.py:701— youtube_dl/swfinterp.py:701-709 | youtube_dl/swfinterp.py:740-748 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/swfinterp.py:701` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
GenericIE._real_extract (cyclomatic 227) youtube_dl/extractor/generic.py:2529— GenericIE._real_extract has cyclomatic complexity 227 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
YoutubeIE._real_extract (cyclomatic 187) REDACTED:2346— YoutubeIE._real_extract has cyclomatic complexity 187 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
youtube_dl._real_main (cyclomatic 121) youtube_dl/__init__.py:49— youtube_dl._real_main has cyclomatic complexity 121 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
JSInterpreter.interpret_statement (cyclomatic 121) youtube_dl/jsinterp.py:832— JSInterpreter.interpret_statement has cyclomatic complexity 121 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BBCIE._real_extract (cyclomatic 97) youtube_dl/extractor/bbc.py:897— BBCIE._real_extract has cyclomatic complexity 97 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
YoutubeDL.process_info (cyclomatic 60) youtube_dl/YoutubeDL.py:1952— YoutubeDL.process_info 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.
FacebookIE._extract_from_url (cyclomatic 57) youtube_dl/extractor/facebook.py:380— FacebookIE._extract_from_url 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.
InfoExtractor._parse_mpd_formats_and_subtitles (cyclomatic 55) REDACTED:2295— InfoExtractor._parse_mpd_formats_and_subtitles has cyclomatic complexity 55 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
NiconicoIE._real_extract (cyclomatic 53) REDACTED:381— NiconicoIE._real_extract 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.
YoutubeTabIE._entries (cyclomatic 53) REDACTED:3806— YoutubeTabIE._entries 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.
YoutubeDL.process_video_result (cyclomatic 52) youtube_dl/YoutubeDL.py:1645— YoutubeDL.process_video_result 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.
XHamsterIE._real_extract (cyclomatic 48) youtube_dl/extractor/xhamster.py:131— XHamsterIE._real_extract 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.
HlsFD.real_download (cyclomatic 43) youtube_dl/downloader/hls.py:60— HlsFD.real_download 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.
CrunchyrollIE._real_extract (cyclomatic 42) REDACTED:414— CrunchyrollIE._real_extract 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.
JSInterpreter._separate (cyclomatic 42) youtube_dl/jsinterp.py:625— JSInterpreter._separate 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.
UdemyIE._real_extract (cyclomatic 39) youtube_dl/extractor/udemy.py:214— UdemyIE._real_extract 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.
DRTVIE._real_extract (cyclomatic 38) youtube_dl/extractor/drtv.py:119— DRTVIE._real_extract 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.
NRKIE._real_extract (cyclomatic 38) youtube_dl/extractor/nrk.py:146— NRKIE._real_extract 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.
TEDIE._talk_info (cyclomatic 38) youtube_dl/extractor/ted.py:179— TEDIE._talk_info 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.
BrightcoveNewIE._parse_brightcove_metadata (cyclomatic 36) youtube_dl/extractor/brightcove.py:471— BrightcoveNewIE._parse_brightcove_metadata 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.
CeskaTelevizeIE._real_extract (cyclomatic 36) youtube_dl/extractor/ceskatelevize.py:107— CeskaTelevizeIE._real_extract 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.
VimeoBaseInfoExtractor._parse_config (cyclomatic 36) youtube_dl/extractor/vimeo.py:123— VimeoBaseInfoExtractor._parse_config 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.
FFmpegFD._call_downloader (cyclomatic 35) youtube_dl/downloader/external.py:373— FFmpegFD._call_downloader 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.
PuhuTVIE._real_extract (cyclomatic 35) youtube_dl/extractor/puhutv.py:59— PuhuTVIE._real_extract 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.
SoundcloudIE._extract_info_dict (cyclomatic 35) youtube_dl/extractor/soundcloud.py:318— SoundcloudIE._extract_info_dict 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.
TurnerBaseIE._extract_cvp_info (cyclomatic 35) youtube_dl/extractor/turner.py:53— TurnerBaseIE._extract_cvp_info 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.
VimeoIE._real_extract (cyclomatic 35) youtube_dl/extractor/vimeo.py:635— VimeoIE._real_extract 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.
SWFInterpreter.__init__ (cyclomatic 35) youtube_dl/swfinterp.py:186— SWFInterpreter.__init__ has cyclomatic complexity 35 (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.
KalturaIE._real_extract (cyclomatic 34) youtube_dl/extractor/kaltura.py:229— KalturaIE._real_extract 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.
NPOIE._get_old_info (cyclomatic 33) youtube_dl/extractor/npo.py:299— NPOIE._get_old_info 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.
RtmpFD.real_download (cyclomatic 32) youtube_dl/downloader/rtmp.py:24— RtmpFD.real_download has cyclomatic complexity 32 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ADNIE._real_extract (cyclomatic 31) youtube_dl/extractor/adn.py:165— ADNIE._real_extract has cyclomatic complexity 31 (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.
GoIE._real_extract (cyclomatic 31) youtube_dl/extractor/go.py:158— GoIE._real_extract 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.
PBSIE._real_extract (cyclomatic 31) youtube_dl/extractor/pbs.py:539— PBSIE._real_extract 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.
PornHubIE._real_extract (cyclomatic 31) REDACTED:261— PornHubIE._real_extract 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.
RTSIE._real_extract (cyclomatic 31) youtube_dl/extractor/rts.py:118— RTSIE._real_extract 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.
CSpanIE._real_extract (cyclomatic 30) youtube_dl/extractor/cspan.py:84— CSpanIE._real_extract 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.
ThreeQSDNIE._real_extract (cyclomatic 30) youtube_dl/extractor/threeqsdn.py:87— ThreeQSDNIE._real_extract 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.
VKIE._real_extract (cyclomatic 30) youtube_dl/extractor/vk.py:310— VKIE._real_extract 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.
InfoExtractor._parse_smil_formats (cyclomatic 29) REDACTED:2095— InfoExtractor._parse_smil_formats 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.
FranceTVIE._extract_video (cyclomatic 28) youtube_dl/extractor/francetv.py:89— FranceTVIE._extract_video 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.
ProSiebenSat1BaseIE._extract_video_info (cyclomatic 28) REDACTED:25— ProSiebenSat1BaseIE._extract_video_info 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.
update.update_self (cyclomatic 28) youtube_dl/update.py:34— update.update_self 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.
AdobePassIE._extract_mvpd_auth (cyclomatic 27) youtube_dl/extractor/adobepass.py:1354— AdobePassIE._extract_mvpd_auth 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.
InfoExtractor._parse_f4m_formats (cyclomatic 27) REDACTED:1699— InfoExtractor._parse_f4m_formats 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.
DailymotionIE._real_extract (cyclomatic 27) REDACTED:206— DailymotionIE._real_extract 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.
MetacafeIE._real_extract (cyclomatic 27) youtube_dl/extractor/metacafe.py:131— MetacafeIE._real_extract 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.
TV2IE._real_extract (cyclomatic 27) youtube_dl/extractor/tv2.py:41— TV2IE._real_extract 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.
F4mFD.real_download (cyclomatic 26) youtube_dl/downloader/f4m.py:319— F4mFD.real_download 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.
InfoExtractor._parse_html5_media_entries (cyclomatic 26) REDACTED:2785— InfoExtractor._parse_html5_media_entries 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.
LimelightBaseIE._extract_info (cyclomatic 26) youtube_dl/extractor/limelight.py:88— LimelightBaseIE._extract_info 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.
TwitterIE._real_extract (cyclomatic 26) youtube_dl/extractor/twitter.py:432— TwitterIE._real_extract 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.
ArcPublishingIE._real_extract (cyclomatic 25) youtube_dl/extractor/arcpublishing.py:88— ArcPublishingIE._real_extract 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.
BandcampIE._real_extract (cyclomatic 25) youtube_dl/extractor/bandcamp.py:89— BandcampIE._real_extract 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.
InfoExtractor._json_ld (cyclomatic 25) REDACTED:1355— InfoExtractor._json_ld 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.
InfoExtractor._parse_ism_formats (cyclomatic 25) REDACTED:2690— InfoExtractor._parse_ism_formats 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.
CrackleIE._real_extract (cyclomatic 25) youtube_dl/extractor/crackle.py:69— CrackleIE._real_extract 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.
HotStarIE._real_extract (cyclomatic 25) youtube_dl/extractor/hotstar.py:111— HotStarIE._real_extract 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.
FFmpegExtractAudioPP.run (cyclomatic 25) youtube_dl/postprocessor/ffmpeg.py:265— FFmpegExtractAudioPP.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.
ArkenaIE._real_extract (cyclomatic 24) youtube_dl/extractor/arkena.py:65— ArkenaIE._real_extract 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.
Channel9IE._real_extract (cyclomatic 24) youtube_dl/extractor/channel9.py:99— Channel9IE._real_extract 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.
DisneyIE._real_extract (cyclomatic 24) youtube_dl/extractor/disney.py:80— DisneyIE._real_extract 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.
DPlayIE._get_disco_api_info (cyclomatic 24) youtube_dl/extractor/dplay.py:187— DPlayIE._get_disco_api_info 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.
InstagramIE._real_extract (cyclomatic 24) REDACTED:142— InstagramIE._real_extract 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.
LecturioIE._real_extract (cyclomatic 24) youtube_dl/extractor/lecturio.py:105— LecturioIE._real_extract 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.
InfoExtractor._parse_m3u8_formats (cyclomatic 23) REDACTED:1838— InfoExtractor._parse_m3u8_formats 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.
InstagramPlaylistIE._extract_graphql (cyclomatic 23) REDACTED:292— InstagramPlaylistIE._extract_graphql 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.
NDREmbedBaseIE._real_extract (cyclomatic 23) youtube_dl/extractor/ndr.py:235— NDREmbedBaseIE._real_extract 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.
NPOIE._get_info (cyclomatic 23) youtube_dl/extractor/npo.py:186— NPOIE._get_info 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.
OoyalaBaseIE._extract (cyclomatic 23) youtube_dl/extractor/ooyala.py:26— OoyalaBaseIE._extract 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.
PluralsightIE._real_extract (cyclomatic 23) youtube_dl/extractor/pluralsight.py:275— PluralsightIE._real_extract 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.
URPlayIE._real_extract (cyclomatic 23) youtube_dl/extractor/urplay.py:54— URPlayIE._real_extract 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.
XTubeIE._real_extract (cyclomatic 23) youtube_dl/extractor/xtube.py:73— XTubeIE._real_extract 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.
YoutubeDL._format_note (cyclomatic 22) youtube_dl/YoutubeDL.py:2406— YoutubeDL._format_note 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.
GoogleDriveIE._real_extract (cyclomatic 22) youtube_dl/extractor/googledrive.py:164— GoogleDriveIE._real_extract 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.
IviIE._real_extract (cyclomatic 22) youtube_dl/extractor/ivi.py:83— IviIE._real_extract 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.
MSNIE._real_extract (cyclomatic 22) youtube_dl/extractor/msn.py:69— MSNIE._real_extract 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.
YoutubeBaseInfoExtractor._login (cyclomatic 22) REDACTED:211— YoutubeBaseInfoExtractor._login 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.
YoutubeDL.process_ie_result (cyclomatic 21) youtube_dl/YoutubeDL.py:1001— YoutubeDL.process_ie_result 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.
ArteTVIE._real_extract (cyclomatic 21) youtube_dl/extractor/arte.py:52— ArteTVIE._real_extract has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
BBCCoUkIE._process_media_selector (cyclomatic 21) youtube_dl/extractor/bbc.py:364— BBCCoUkIE._process_media_selector 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.
ITVIE._real_extract (cyclomatic 21) youtube_dl/extractor/itv.py:180— ITVIE._real_extract has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
KonserthusetPlayIE._real_extract (cyclomatic 21) youtube_dl/extractor/konserthusetplay.py:31— KonserthusetPlayIE._real_extract has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
RaiBaseIE._extract_relinker_info (cyclomatic 21) youtube_dl/extractor/rai.py:36— RaiBaseIE._extract_relinker_info 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.
RTBFIE._real_extract (cyclomatic 21) youtube_dl/extractor/rtbf.py:70— RTBFIE._real_extract has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
XFileShareIE._real_extract (cyclomatic 21) youtube_dl/extractor/xfileshare.py:196— XFileShareIE._real_extract has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
YahooIE._extract_yahoo_video (cyclomatic 21) REDACTED:180— YahooIE._extract_yahoo_video 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.
utils.dfxp2srt (cyclomatic 21) REDACTED:4970— utils.dfxp2srt 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.
BiliBiliIE._real_extract (cyclomatic 20) REDACTED:123— BiliBiliIE._real_extract 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.
InfoExtractor._parse_jwplayer_formats (cyclomatic 20) REDACTED:3111— InfoExtractor._parse_jwplayer_formats 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.
GloboIE._real_extract (cyclomatic 20) REDACTED:93— GloboIE._real_extract 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.
RteBaseIE._real_extract (cyclomatic 20) youtube_dl/extractor/rte.py:20— RteBaseIE._real_extract 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.
ServusIE._real_extract (cyclomatic 20) REDACTED:63— ServusIE._real_extract 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.
ToggleIE._real_extract (cyclomatic 20) youtube_dl/extractor/toggle.py:90— ToggleIE._real_extract 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.
YandexDiskIE._real_extract (cyclomatic 20) youtube_dl/extractor/yandexdisk.py:59— YandexDiskIE._real_extract has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils.decode_png (cyclomatic 20) REDACTED:6061— utils.decode_png 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.
YoutubeDL.process_subtitles (cyclomatic 19) youtube_dl/YoutubeDL.py:1872— YoutubeDL.process_subtitles 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.
AfreecaTVIE._real_extract (cyclomatic 19) youtube_dl/extractor/afreecatv.py:223— AfreecaTVIE._real_extract 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.
AMPIE._extract_feed_info (cyclomatic 19) youtube_dl/extractor/amp.py:18— AMPIE._extract_feed_info 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.
CCMAIE._real_extract (cyclomatic 19) youtube_dl/extractor/ccma.py:63— CCMAIE._real_extract 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.
NovaEmbedIE._real_extract (cyclomatic 19) youtube_dl/extractor/nova.py:32— NovaEmbedIE._real_extract 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.
SixPlayIE._real_extract (cyclomatic 19) youtube_dl/extractor/sixplay.py:43— SixPlayIE._real_extract 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.
SteamIE._real_extract (cyclomatic 19) youtube_dl/extractor/steam.py:68— SteamIE._real_extract 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.
VevoIE._real_extract (cyclomatic 19) youtube_dl/extractor/vevo.py:191— VevoIE._real_extract 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.
ZypeIE._real_extract (cyclomatic 19) youtube_dl/extractor/zype.py:43— ZypeIE._real_extract 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.
YoutubeDL._match_entry (cyclomatic 18) youtube_dl/YoutubeDL.py:793— YoutubeDL._match_entry 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.
FileDownloader.report_progress (cyclomatic 18) youtube_dl/downloader/common.py:259— FileDownloader.report_progress 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.
CanvasIE._real_extract (cyclomatic 18) REDACTED:49— CanvasIE._real_extract 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.
ChaturbateIE._real_extract (cyclomatic 18) youtube_dl/extractor/chaturbate.py:38— ChaturbateIE._real_extract 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.
FirstTVIE._real_extract (cyclomatic 18) youtube_dl/extractor/firsttv.py:62— FirstTVIE._real_extract 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.
HBOBaseIE._extract_info (cyclomatic 18) youtube_dl/extractor/hbo.py:56— HBOBaseIE._extract_info 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.
LEGOIE._real_extract (cyclomatic 18) youtube_dl/extractor/lego.py:66— LEGOIE._real_extract 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.
MedalTVIE._real_extract (cyclomatic 18) youtube_dl/extractor/medaltv.py:53— MedalTVIE._real_extract 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.
PeerTubeIE._real_extract (cyclomatic 18) youtube_dl/extractor/peertube.py:531— PeerTubeIE._real_extract 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.
SRGSSRIE._real_extract (cyclomatic 18) youtube_dl/extractor/srgssr.py:84— SRGSSRIE._real_extract 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.
Vbox7IE._real_extract (cyclomatic 18) youtube_dl/extractor/vbox7.py:111— Vbox7IE._real_extract 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.
VGTVIE._real_extract (cyclomatic 18) youtube_dl/extractor/vgtv.py:167— VGTVIE._real_extract 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.
LazyList.__getitem__ (cyclomatic 18) REDACTED:4094— LazyList.__getitem__ 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.
AdultSwimIE._real_extract (cyclomatic 17) REDACTED:91— AdultSwimIE._real_extract 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.
BrightcoveLegacyIE._real_extract (cyclomatic 17) youtube_dl/extractor/brightcove.py:286— BrightcoveLegacyIE._real_extract 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.
InfoExtractor._request_webpage (cyclomatic 17) REDACTED:647— InfoExtractor._request_webpage 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.
HKETVIE._real_extract (cyclomatic 17) youtube_dl/extractor/hketv.py:74— HKETVIE._real_extract 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.
LinuxAcademyIE._real_extract (cyclomatic 17) youtube_dl/extractor/linuxacademy.py:154— LinuxAcademyIE._real_extract 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.
MixcloudIE._real_extract (cyclomatic 17) youtube_dl/extractor/mixcloud.py:99— MixcloudIE._real_extract 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.
NineGagIE._real_extract (cyclomatic 17) youtube_dl/extractor/ninegag.py:39— NineGagIE._real_extract 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.
OdnoklassnikiIE._real_extract (cyclomatic 17) youtube_dl/extractor/odnoklassniki.py:133— OdnoklassnikiIE._real_extract 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.
OnetBaseIE._extract_from_id (cyclomatic 17) youtube_dl/extractor/onet.py:29— OnetBaseIE._extract_from_id 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.
RedTubeIE._real_extract (cyclomatic 17) youtube_dl/extractor/redtube.py:45— RedTubeIE._real_extract 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.
SVTBaseIE._extract_video (cyclomatic 17) youtube_dl/extractor/svt.py:22— SVTBaseIE._extract_video 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.
VideomoreIE._real_extract (cyclomatic 17) youtube_dl/extractor/videomore.py:147— VideomoreIE._real_extract 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.
WatchBoxIE._real_extract (cyclomatic 17) youtube_dl/extractor/watchbox.py:65— WatchBoxIE._real_extract 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.
WDRIE._real_extract (cyclomatic 17) youtube_dl/extractor/wdr.py:44— WDRIE._real_extract 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.
ZattooPlatformBaseIE._extract_formats (cyclomatic 17) youtube_dl/extractor/zattoo.py:124— ZattooPlatformBaseIE._extract_formats 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.
YoutubeDLHandler.http_response (cyclomatic 17) REDACTED:2789— YoutubeDLHandler.http_response has cyclomatic complexity 17 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
utils.parse_codecs (cyclomatic 17) REDACTED:4742— utils.parse_codecs 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.
YoutubeDL.prepare_filename (cyclomatic 16) youtube_dl/YoutubeDL.py:704— YoutubeDL.prepare_filename 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.
YoutubeDL.__process_playlist (cyclomatic 16) youtube_dl/YoutubeDL.py:1108— YoutubeDL.__process_playlist 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.
DashSegmentsFD.real_download (cyclomatic 16) youtube_dl/downloader/dash.py:20— DashSegmentsFD.real_download 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.
ARDMediathekIE._real_extract (cyclomatic 16) youtube_dl/extractor/ard.py:161— ARDMediathekIE._real_extract 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.
InfoExtractor._parse_jwplayer_data (cyclomatic 16) REDACTED:3037— InfoExtractor._parse_jwplayer_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.
CondeNastIE._extract_video (cyclomatic 16) youtube_dl/extractor/condenast.py:143— CondeNastIE._extract_video 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.
FunimationIE._real_extract (cyclomatic 16) youtube_dl/extractor/funimation.py:81— FunimationIE._real_extract 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.
ImgGamingBaseIE._real_extract (cyclomatic 16) youtube_dl/extractor/imggaming.py:64— ImgGamingBaseIE._real_extract 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.
LyndaIE._real_extract (cyclomatic 16) youtube_dl/extractor/lynda.py:130— LyndaIE._real_extract 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.
MailRuIE._real_extract (cyclomatic 16) youtube_dl/extractor/mailru.py:99— MailRuIE._real_extract 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.
MindsIE._real_extract (cyclomatic 16) youtube_dl/extractor/minds.py:71— MindsIE._real_extract 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.
VidmeIE._real_extract (cyclomatic 16) youtube_dl/extractor/vidme.py:135— VidmeIE._real_extract 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.
VoxMediaVolumeIE._real_extract (cyclomatic 16) youtube_dl/extractor/voxmedia.py:18— VoxMediaVolumeIE._real_extract 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.
WistiaBaseIE._extract_media (cyclomatic 16) youtube_dl/extractor/wistia.py:33— WistiaBaseIE._extract_media 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.
ZingMp3BaseIE._extract_item (cyclomatic 16) youtube_dl/extractor/zingmp3.py:15— ZingMp3BaseIE._extract_item 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.
JSInterpreter._separate_at_op (cyclomatic 16) youtube_dl/jsinterp.py:710— JSInterpreter._separate_at_op 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.
EmbedThumbnailPP.run (cyclomatic 16) youtube_dl/postprocessor/embedthumbnail.py:33— EmbedThumbnailPP.run 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.
Hotspot: REDACTED REDACTED:2346— REDACTED changed 24 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 187 in YoutubeIE._real_extract at line 2346. 5 of those changes were fix/bug commits, and the other 19 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2025-08-28..2025-11-26, the 90 days ending at the analysed commit. Reproduce with `git log --since='2025-08-28 03:02:36 +00:00' --until='2025-11-26 03:02:36 +00:00' --full-history --no-merges -- REDACTED`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
YoutubeIE._real_extract (cognitive 382) REDACTED:2346— YoutubeIE._real_extract has cognitive complexity 382 (threshold 15). Drivers by points: if/else 94 (237 pts), loops 22 (58 pts), boolean chains 54, ternaries 14 (30 pts), error handling 1 (3 pts) (nesting depth added 197). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
GenericIE._real_extract (cognitive 287) youtube_dl/extractor/generic.py:2529— GenericIE._real_extract has cognitive complexity 287 (threshold 15). Drivers by points: if/else 196 (247 pts), boolean chains 15, loops 7 (13 pts), ternaries 3 (9 pts), error handling 2 (3 pts) (nesting depth added 64). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
JSInterpreter.interpret_statement (cognitive 226) youtube_dl/jsinterp.py:832— JSInterpreter.interpret_statement has cognitive complexity 226 (threshold 15). Drivers by points: if/else 79 (152 pts), ternaries 11 (28 pts), loops 10 (18 pts), boolean chains 16, error handling 4 (12 pts) (nesting depth added 106). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BBCIE._real_extract (cognitive 207) youtube_dl/extractor/bbc.py:897— BBCIE._real_extract has cognitive complexity 207 (threshold 15). Drivers by points: if/else 51 (127 pts), boolean chains 30, loops 11 (28 pts), ternaries 5 (15 pts), error handling 1 (7 pts) (nesting depth added 109). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
youtube_dl._real_main (cognitive 164) youtube_dl/__init__.py:49— youtube_dl._real_main has cognitive complexity 164 (threshold 15). Drivers by points: if/else 82 (113 pts), boolean chains 29, ternaries 7 (10 pts), loops 4 (9 pts), error handling 2 (3 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.
YoutubeTabIE._entries (cognitive 157) REDACTED:3806— YoutubeTabIE._entries has cognitive complexity 157 (threshold 15). Drivers by points: if/else 29 (83 pts), loops 17 (63 pts), boolean chains 5, error handling 1 (3 pts), ternaries 1 (3 pts) (nesting depth added 104). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InfoExtractor._parse_mpd_formats_and_subtitles (cognitive 154) REDACTED:2295— InfoExtractor._parse_mpd_formats_and_subtitles has cognitive complexity 154 (threshold 15). Drivers by points: if/else 24 (84 pts), loops 9 (44 pts), ternaries 3 (14 pts), boolean chains 12 (nesting depth added 106). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
YoutubeDL.process_info (cognitive 140) youtube_dl/YoutubeDL.py:1952— YoutubeDL.process_info has cognitive complexity 140 (threshold 15). Drivers by points: if/else 44 (94 pts), error handling 9 (28 pts), boolean chains 12, loops 2 (6 pts) (nesting depth added 73). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
XHamsterIE._real_extract (cognitive 132) youtube_dl/extractor/xhamster.py:131— XHamsterIE._real_extract has cognitive complexity 132 (threshold 15). Drivers by points: if/else 23 (83 pts), loops 9 (31 pts), boolean chains 9, ternaries 7 (9 pts) (nesting depth added 84). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
HlsFD.real_download (cognitive 116) youtube_dl/downloader/hls.py:60— HlsFD.real_download has cognitive complexity 116 (threshold 15). Drivers by points: if/else 25 (91 pts), loops 4 (8 pts), ternaries 2 (8 pts), error handling 1 (5 pts), boolean chains 4 (nesting depth added 80). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
FacebookIE._extract_from_url (cognitive 108) youtube_dl/extractor/facebook.py:380— FacebookIE._extract_from_url has cognitive complexity 108 (threshold 15). Drivers by points: if/else 28 (56 pts), loops 11 (31 pts), boolean chains 16, ternaries 1 (5 pts) (nesting depth added 52). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
CrunchyrollIE._real_extract (cognitive 92) REDACTED:414— CrunchyrollIE._real_extract has cognitive complexity 92 (threshold 15). Drivers by points: if/else 32 (75 pts), loops 7 (14 pts), boolean chains 3 (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.
DRTVIE._real_extract (cognitive 90) youtube_dl/extractor/drtv.py:119— DRTVIE._real_extract has cognitive complexity 90 (threshold 15). Drivers by points: if/else 22 (57 pts), loops 5 (15 pts), boolean chains 8, error handling 1 (5 pts), ternaries 1 (5 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.
YoutubeDL.process_video_result (cognitive 86) youtube_dl/YoutubeDL.py:1645— YoutubeDL.process_video_result has cognitive complexity 86 (threshold 15). Drivers by points: if/else 34 (57 pts), loops 9 (18 pts), boolean chains 8, ternaries 1 (3 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.
UdemyIE._real_extract (cognitive 84) youtube_dl/extractor/udemy.py:214— UdemyIE._real_extract has cognitive complexity 84 (threshold 15). Drivers by points: if/else 23 (56 pts), loops 5 (11 pts), boolean chains 9, ternaries 2 (7 pts), error handling 1 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
TEDIE._talk_info (cognitive 82) youtube_dl/extractor/ted.py:179— TEDIE._talk_info has cognitive complexity 82 (threshold 15). Drivers by points: if/else 22 (58 pts), loops 7 (16 pts), boolean chains 8 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
CeskaTelevizeIE._real_extract (cognitive 77) youtube_dl/extractor/ceskatelevize.py:107— CeskaTelevizeIE._real_extract has cognitive complexity 77 (threshold 15). Drivers by points: if/else 28 (58 pts), loops 5 (12 pts), boolean chains 4, ternaries 1 (3 pts) (nesting depth added 39). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
InfoExtractor._parse_html5_media_entries (cognitive 75) REDACTED:2785— InfoExtractor._parse_html5_media_entries has cognitive complexity 75 (threshold 15). Drivers by points: if/else 12 (47 pts), loops 6 (20 pts), boolean chains 8 (nesting depth added 49). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
NiconicoIE._real_extract (cognitive 74) REDACTED:381— NiconicoIE._real_extract has cognitive complexity 74 (threshold 15). Drivers by points: if/else 17 (27 pts), boolean chains 21, ternaries 8 (19 pts), loops 3 (5 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.
JSInterpreter._separate (cognitive 72) youtube_dl/jsinterp.py:625— JSInterpreter._separate has cognitive complexity 72 (threshold 15). Drivers by points: if/else 19 (43 pts), boolean chains 16, ternaries 2 (9 pts), loops 2 (4 pts) (nesting depth added 33). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PBSIE._real_extract (cognitive 71) youtube_dl/extractor/pbs.py:539— PBSIE._real_extract has cognitive complexity 71 (threshold 15). Drivers by points: if/else 21 (53 pts), loops 5 (13 pts), boolean chains 5 (nesting depth added 40). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ProSiebenSat1BaseIE._extract_video_info (cognitive 71) REDACTED:25— ProSiebenSat1BaseIE._extract_video_info has cognitive complexity 71 (threshold 15). Drivers by points: if/else 17 (46 pts), ternaries 2 (12 pts), loops 3 (8 pts), boolean chains 5 (nesting depth added 44). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
AdobePassIE._extract_mvpd_auth (cognitive 69) youtube_dl/extractor/adobepass.py:1354— AdobePassIE._extract_mvpd_auth has cognitive complexity 69 (threshold 15). Drivers by points: if/else 22 (63 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 41). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
BandcampIE._real_extract (cognitive 69) youtube_dl/extractor/bandcamp.py:89— BandcampIE._real_extract has cognitive complexity 69 (threshold 15). Drivers by points: if/else 15 (51 pts), loops 3 (12 pts), boolean chains 5, ternaries 1 (nesting depth added 45). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
GoIE._real_extract (cognitive 69) youtube_dl/extractor/go.py:158— GoIE._real_extract has cognitive complexity 69 (threshold 15). Drivers by points: if/else 19 (43 pts), loops 5 (10 pts), ternaries 2 (9 pts), boolean chains 7 (nesting depth added 36). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PornHubIE._real_extract (cognitive 68) REDACTED:261— PornHubIE._real_extract has cognitive complexity 68 (threshold 15). Drivers by points: if/else 21 (52 pts), loops 5 (12 pts), boolean chains 4 (nesting depth added 38). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NPOIE._get_old_info (cognitive 65) youtube_dl/extractor/npo.py:299— NPOIE._get_old_info has cognitive complexity 65 (threshold 15). Drivers by points: if/else 21 (48 pts), boolean chains 7, loops 3 (7 pts), error handling 1 (2 pts), ternaries 1 (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.
VimeoBaseInfoExtractor._parse_config (cognitive 64) youtube_dl/extractor/vimeo.py:123— VimeoBaseInfoExtractor._parse_config has cognitive complexity 64 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 8 (15 pts), boolean chains 12, ternaries 3 (7 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.
SWFInterpreter.__init__ (cognitive 60) youtube_dl/swfinterp.py:186— SWFInterpreter.__init__ has cognitive complexity 60 (threshold 15). Drivers by points: loops 25 (41 pts), if/else 9 (19 pts) (nesting depth added 26). 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.
TurnerBaseIE._extract_cvp_info (cognitive 59) youtube_dl/extractor/turner.py:53— TurnerBaseIE._extract_cvp_info has cognitive complexity 59 (threshold 15). Drivers by points: if/else 16 (42 pts), boolean chains 8, loops 4 (8 pts), ternaries 1 (nesting depth added 30). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
CSpanIE._real_extract (cognitive 58) youtube_dl/extractor/cspan.py:84— CSpanIE._real_extract has cognitive complexity 58 (threshold 15). Drivers by points: if/else 18 (31 pts), ternaries 7 (16 pts), loops 4 (8 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.
ArcPublishingIE._real_extract (cognitive 57) youtube_dl/extractor/arcpublishing.py:88— ArcPublishingIE._real_extract has cognitive complexity 57 (threshold 15). Drivers by points: if/else 13 (39 pts), loops 5 (9 pts), ternaries 3 (7 pts), boolean chains 2 (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.
Channel9IE._real_extract (cognitive 57) youtube_dl/extractor/channel9.py:99— Channel9IE._real_extract has cognitive complexity 57 (threshold 15). Drivers by points: if/else 17 (37 pts), loops 5 (13 pts), ternaries 1 (4 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.
BrightcoveNewIE._parse_brightcove_metadata (cognitive 56) youtube_dl/extractor/brightcove.py:471— BrightcoveNewIE._parse_brightcove_metadata has cognitive complexity 56 (threshold 15). Drivers by points: if/else 15 (30 pts), boolean chains 14, ternaries 3 (9 pts), loops 3 (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.
BBCCoUkIE._process_media_selector (cognitive 55) youtube_dl/extractor/bbc.py:364— BBCCoUkIE._process_media_selector has cognitive complexity 55 (threshold 15). Drivers by points: if/else 11 (38 pts), loops 3 (9 pts), error handling 1 (5 pts), boolean chains 3 (nesting depth added 37). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
KalturaIE._real_extract (cognitive 55) youtube_dl/extractor/kaltura.py:229— KalturaIE._real_extract has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (39 pts), boolean chains 7, error handling 1 (3 pts), loops 2 (3 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.
LimelightBaseIE._extract_info (cognitive 55) youtube_dl/extractor/limelight.py:88— LimelightBaseIE._extract_info has cognitive complexity 55 (threshold 15). Drivers by points: if/else 14 (37 pts), loops 5 (10 pts), boolean chains 8 (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.
CrackleIE._real_extract (cognitive 54) youtube_dl/extractor/crackle.py:69— CrackleIE._real_extract has cognitive complexity 54 (threshold 15). Drivers by points: if/else 14 (38 pts), loops 4 (9 pts), boolean chains 4, error handling 1 (2 pts), 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.
NRKIE._real_extract (cognitive 54) youtube_dl/extractor/nrk.py:146— NRKIE._real_extract has cognitive complexity 54 (threshold 15). Drivers by points: if/else 20 (37 pts), boolean chains 11, loops 3, ternaries 1 (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.
SoundcloudIE._extract_info_dict (cognitive 54) youtube_dl/extractor/soundcloud.py:318— SoundcloudIE._extract_info_dict has cognitive complexity 54 (threshold 15). Drivers by points: if/else 17 (34 pts), boolean chains 13, loops 3 (5 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.
SteamIE._real_extract (cognitive 54) youtube_dl/extractor/steam.py:68— SteamIE._real_extract has cognitive complexity 54 (threshold 15). Drivers by points: if/else 15 (38 pts), loops 4 (15 pts), boolean chains 1 (nesting depth added 34). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
FFmpegFD._call_downloader (cognitive 53) youtube_dl/downloader/external.py:373— FFmpegFD._call_downloader has cognitive complexity 53 (threshold 15). Drivers by points: if/else 25 (40 pts), boolean chains 6, loops 2 (4 pts), ternaries 1 (2 pts), error handling 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.
RTSIE._real_extract (cognitive 53) youtube_dl/extractor/rts.py:118— RTSIE._real_extract has cognitive complexity 53 (threshold 15). Drivers by points: if/else 16 (33 pts), boolean chains 9, ternaries 4 (7 pts), loops 3 (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.
InfoExtractor._parse_ism_formats (cognitive 52) REDACTED:2690— InfoExtractor._parse_ism_formats has cognitive complexity 52 (threshold 15). Drivers by points: if/else 6 (16 pts), ternaries 4 (12 pts), loops 4 (10 pts), boolean chains 9, error handling 1 (5 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.
PluralsightIE._real_extract (cognitive 51) youtube_dl/extractor/pluralsight.py:275— PluralsightIE._real_extract has cognitive complexity 51 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 6 (12 pts), ternaries 2 (5 pts), error handling 1 (3 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ThreeQSDNIE._real_extract (cognitive 51) youtube_dl/extractor/threeqsdn.py:87— ThreeQSDNIE._real_extract has cognitive complexity 51 (threshold 15). Drivers by points: if/else 9 (27 pts), boolean chains 9, ternaries 3 (8 pts), loops 4 (6 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.
MetacafeIE._real_extract (cognitive 50) youtube_dl/extractor/metacafe.py:131— MetacafeIE._real_extract has cognitive complexity 50 (threshold 15). Drivers by points: if/else 24 (41 pts), loops 2 (6 pts), boolean chains 2, ternaries 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
F4mFD.real_download (cognitive 48) youtube_dl/downloader/f4m.py:319— F4mFD.real_download has cognitive complexity 48 (threshold 15). Drivers by points: if/else 18 (34 pts), boolean chains 6, error handling 2 (5 pts), 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.
InfoExtractor._parse_m3u8_formats (cognitive 48) REDACTED:1838— InfoExtractor._parse_m3u8_formats has cognitive complexity 48 (threshold 15). Drivers by points: if/else 14 (34 pts), ternaries 2 (8 pts), boolean chains 4, loops 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.
NovaEmbedIE._real_extract (cognitive 48) youtube_dl/extractor/nova.py:32— NovaEmbedIE._real_extract has cognitive complexity 48 (threshold 15). Drivers by points: if/else 10 (30 pts), loops 5 (14 pts), boolean chains 4 (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.
TV2IE._real_extract (cognitive 47) youtube_dl/extractor/tv2.py:41— TV2IE._real_extract has cognitive complexity 47 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 7, ternaries 2 (6 pts), 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.
TwitterIE._real_extract (cognitive 47) youtube_dl/extractor/twitter.py:432— TwitterIE._real_extract has cognitive complexity 47 (threshold 15). Drivers by points: if/else 10 (20 pts), ternaries 5 (15 pts), boolean chains 7, loops 2 (5 pts) (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ADNIE._real_extract (cognitive 46) youtube_dl/extractor/adn.py:165— ADNIE._real_extract has cognitive complexity 46 (threshold 15). Drivers by points: boolean chains 18, if/else 7 (18 pts), loops 4 (8 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.
InfoExtractor._parse_f4m_formats (cognitive 46) REDACTED:1699— InfoExtractor._parse_f4m_formats has cognitive complexity 46 (threshold 15). Drivers by points: if/else 12 (25 pts), ternaries 4 (12 pts), boolean chains 8, loops 1 (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
update.update_self (cognitive 46) youtube_dl/update.py:34— update.update_self has cognitive complexity 46 (threshold 15). Drivers by points: if/else 17 (32 pts), error handling 7 (12 pts), boolean chains 1, ternaries 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.
InstagramPlaylistIE._extract_graphql (cognitive 45) REDACTED:292— InstagramPlaylistIE._extract_graphql has cognitive complexity 45 (threshold 15). Drivers by points: if/else 11 (29 pts), boolean chains 8, loops 3 (5 pts), error handling 1 (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.
PuhuTVIE._real_extract (cognitive 45) youtube_dl/extractor/puhutv.py:59— PuhuTVIE._real_extract has cognitive complexity 45 (threshold 15). Drivers by points: if/else 13 (24 pts), boolean chains 16, loops 4, 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.
ArkenaIE._real_extract (cognitive 44) youtube_dl/extractor/arkena.py:65— ArkenaIE._real_extract has cognitive complexity 44 (threshold 15). Drivers by points: if/else 8 (33 pts), loops 3 (6 pts), boolean chains 5 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InfoExtractor._json_ld (cognitive 44) REDACTED:1355— InfoExtractor._json_ld has cognitive complexity 44 (threshold 15). Drivers by points: if/else 16 (37 pts), boolean chains 6, loops 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
FFmpegExtractAudioPP.run (cognitive 44) youtube_dl/postprocessor/ffmpeg.py:265— FFmpegExtractAudioPP.run has cognitive complexity 44 (threshold 15). Drivers by points: if/else 19 (36 pts), boolean chains 6, error handling 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ARDMediathekBaseIE._extract_formats (cognitive 43) youtube_dl/extractor/ard.py:65— ARDMediathekBaseIE._extract_formats has cognitive complexity 43 (threshold 15). Drivers by points: if/else 10 (35 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InstagramIE._real_extract (cognitive 43) REDACTED:142— InstagramIE._real_extract has cognitive complexity 43 (threshold 15). Drivers by points: if/else 14 (28 pts), boolean chains 7, loops 1 (4 pts), ternaries 1 (4 pts) (nesting depth added 20). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
VimeoIE._real_extract (cognitive 43) youtube_dl/extractor/vimeo.py:635— VimeoIE._real_extract has cognitive complexity 43 (threshold 15). Drivers by points: if/else 24 (33 pts), boolean chains 9, 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.
InfoExtractor._parse_smil_formats (cognitive 42) REDACTED:2095— InfoExtractor._parse_smil_formats has cognitive complexity 42 (threshold 15). Drivers by points: if/else 7 (17 pts), ternaries 4 (12 pts), boolean chains 11, loops 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NPOIE._get_info (cognitive 42) youtube_dl/extractor/npo.py:186— NPOIE._get_info has cognitive complexity 42 (threshold 15). Drivers by points: if/else 13 (30 pts), boolean chains 6, loops 2 (6 pts) (nesting depth added 21). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
utils.dfxp2srt (cognitive 42) REDACTED:4970— utils.dfxp2srt has cognitive complexity 42 (threshold 15). Drivers by points: if/else 12 (29 pts), loops 7 (11 pts), boolean chains 2 (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.
DailymotionIE._real_extract (cognitive 41) REDACTED:206— DailymotionIE._real_extract has cognitive complexity 41 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 9, ternaries 4 (7 pts), loops 5 (6 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.
GoogleDriveIE._real_extract (cognitive 41) youtube_dl/extractor/googledrive.py:164— GoogleDriveIE._real_extract has cognitive complexity 41 (threshold 15). Drivers by points: if/else 14 (30 pts), boolean chains 7, loops 2 (4 pts) (nesting depth added 18). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
MSNIE._real_extract (cognitive 41) youtube_dl/extractor/msn.py:69— MSNIE._real_extract has cognitive complexity 41 (threshold 15). Drivers by points: if/else 11 (30 pts), loops 3 (5 pts), ternaries 1 (4 pts), boolean chains 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.
YouNowChannelIE._entries (cognitive 41) youtube_dl/extractor/younow.py:131— YouNowChannelIE._entries has cognitive complexity 41 (threshold 15). Drivers by points: if/else 8 (31 pts), loops 3 (8 pts), boolean chains 2 (nesting depth added 28). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
BrightcoveLegacyIE._real_extract (cognitive 40) youtube_dl/extractor/brightcove.py:286— BrightcoveLegacyIE._real_extract has cognitive complexity 40 (threshold 15). Drivers by points: if/else 13 (36 pts), boolean chains 4 (nesting depth added 23). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
DPlayIE._get_disco_api_info (cognitive 39) youtube_dl/extractor/dplay.py:187— DPlayIE._get_disco_api_info has cognitive complexity 39 (threshold 15). Drivers by points: if/else 12 (29 pts), boolean chains 5, loops 2 (3 pts), error handling 2 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VKIE._real_extract (cognitive 39) youtube_dl/extractor/vk.py:310— VKIE._real_extract has cognitive complexity 39 (threshold 15). Drivers by points: if/else 19 (29 pts), boolean chains 7, 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.
YoutubeBaseInfoExtractor._login (cognitive 39) REDACTED:211— YoutubeBaseInfoExtractor._login has cognitive complexity 39 (threshold 15). Drivers by points: if/else 20 (32 pts), ternaries 2 (6 pts), boolean chains 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.
DisneyIE._real_extract (cognitive 38) youtube_dl/extractor/disney.py:80— DisneyIE._real_extract has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (23 pts), boolean chains 7, loops 4 (6 pts), ternaries 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.
HBOBaseIE._extract_info (cognitive 38) youtube_dl/extractor/hbo.py:56— HBOBaseIE._extract_info has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 3 (7 pts), ternaries 1 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RteBaseIE._real_extract (cognitive 38) youtube_dl/extractor/rte.py:20— RteBaseIE._real_extract has cognitive complexity 38 (threshold 15). Drivers by points: if/else 12 (30 pts), boolean chains 5, error handling 1 (2 pts), loops 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
XTubeIE._real_extract (cognitive 38) youtube_dl/extractor/xtube.py:73— XTubeIE._real_extract has cognitive complexity 38 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 4, loops 2 (4 pts), ternaries 1 (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.
ZypeIE._real_extract (cognitive 38) youtube_dl/extractor/zype.py:43— ZypeIE._real_extract has cognitive complexity 38 (threshold 15). Drivers by points: if/else 14 (29 pts), loops 3 (5 pts), boolean chains 3, 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.
SixPlayIE._real_extract (cognitive 37) youtube_dl/extractor/sixplay.py:43— SixPlayIE._real_extract has cognitive complexity 37 (threshold 15). Drivers by points: if/else 8 (24 pts), boolean chains 8, loops 2 (5 pts) (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
DashSegmentsFD.real_download (cognitive 36) youtube_dl/downloader/dash.py:20— DashSegmentsFD.real_download has cognitive complexity 36 (threshold 15). Drivers by points: if/else 8 (22 pts), error handling 2 (6 pts), ternaries 2 (4 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 21). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RtmpFD.real_download (cognitive 36) youtube_dl/downloader/rtmp.py:24— RtmpFD.real_download has cognitive complexity 36 (threshold 15). Drivers by points: if/else 21 (25 pts), boolean chains 7, loops 2 (3 pts), error handling 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
BiliBiliIE._real_extract (cognitive 36) REDACTED:123— BiliBiliIE._real_extract has cognitive complexity 36 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 6 (12 pts), ternaries 1 (4 pts), boolean chains 3 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LecturioIE._real_extract (cognitive 36) youtube_dl/extractor/lecturio.py:105— LecturioIE._real_extract has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (21 pts), boolean chains 8, ternaries 3 (5 pts), loops 2 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
AfreecaTVIE._real_extract (cognitive 35) youtube_dl/extractor/afreecatv.py:223— AfreecaTVIE._real_extract has cognitive complexity 35 (threshold 15). Drivers by points: if/else 13 (22 pts), ternaries 3 (8 pts), loops 2 (3 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.
FranceTVIE._extract_video (cognitive 35) youtube_dl/extractor/francetv.py:89— FranceTVIE._extract_video has cognitive complexity 35 (threshold 15). Drivers by points: if/else 15 (25 pts), boolean chains 5, loops 3 (4 pts), 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.
YouPornListBase._entries (cognitive 34) youtube_dl/extractor/youporn.py:280— YouPornListBase._entries has cognitive complexity 34 (threshold 15). Drivers by points: if/else 7 (27 pts), loops 3 (6 pts), boolean chains 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.
KonserthusetPlayIE._real_extract (cognitive 33) youtube_dl/extractor/konserthusetplay.py:31— KonserthusetPlayIE._real_extract has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 7, ternaries 2 (7 pts), loops 2 (4 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.
TVNowShowIE._real_extract (cognitive 33) youtube_dl/extractor/tvnow.py:444— TVNowShowIE._real_extract has cognitive complexity 33 (threshold 15). Drivers by points: if/else 9 (25 pts), loops 3 (7 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.
ArteTVIE._real_extract (cognitive 32) youtube_dl/extractor/arte.py:52— ArteTVIE._real_extract has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 7, loops 3 (6 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.
InfoExtractor._parse_jwplayer_formats (cognitive 32) REDACTED:3111— InfoExtractor._parse_jwplayer_formats has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (24 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.
NDREmbedBaseIE._real_extract (cognitive 32) youtube_dl/extractor/ndr.py:235— NDREmbedBaseIE._real_extract has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 8, loops 3 (4 pts), 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.
NprIE._real_extract (cognitive 32) REDACTED:58— NprIE._real_extract has cognitive complexity 32 (threshold 15). Drivers by points: if/else 9 (26 pts), loops 3 (5 pts), boolean chains 1 (nesting depth added 19). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
OnetBaseIE._extract_from_id (cognitive 32) youtube_dl/extractor/onet.py:29— OnetBaseIE._extract_from_id has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 3 (6 pts), boolean chains 3, ternaries 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.
XFileShareIE._real_extract (cognitive 32) youtube_dl/extractor/xfileshare.py:196— XFileShareIE._real_extract has cognitive complexity 32 (threshold 15). Drivers by points: if/else 10 (16 pts), loops 5 (10 pts), boolean chains 5, 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.
FragmentFD._prepare_frag_download (cognitive 31) youtube_dl/downloader/fragment.py:133— FragmentFD._prepare_frag_download has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (23 pts), boolean chains 4, ternaries 1 (4 pts) (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
ChaturbateIE._real_extract (cognitive 31) youtube_dl/extractor/chaturbate.py:38— ChaturbateIE._real_extract has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (19 pts), loops 6 (10 pts), ternaries 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.
HotStarIE._real_extract (cognitive 31) youtube_dl/extractor/hotstar.py:111— HotStarIE._real_extract has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (17 pts), boolean chains 8, loops 3, error handling 1 (2 pts), 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.
NineGagIE._real_extract (cognitive 31) youtube_dl/extractor/ninegag.py:39— NineGagIE._real_extract has cognitive complexity 31 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 3 (6 pts), ternaries 3 (5 pts), boolean chains 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.
RaiBaseIE._extract_relinker_info (cognitive 31) youtube_dl/extractor/rai.py:36— RaiBaseIE._extract_relinker_info has cognitive complexity 31 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 6, ternaries 2 (6 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.
URPlayIE._real_extract (cognitive 31) youtube_dl/extractor/urplay.py:54— URPlayIE._real_extract has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 9, loops 3, ternaries 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
YahooIE._extract_yahoo_video (cognitive 31) REDACTED:180— YahooIE._extract_yahoo_video has cognitive complexity 31 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 6, loops 4 (6 pts), ternaries 3 (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.
ZattooPlatformBaseIE._extract_formats (cognitive 31) youtube_dl/extractor/zattoo.py:124— ZattooPlatformBaseIE._extract_formats has cognitive complexity 31 (threshold 15). Drivers by points: if/else 10 (22 pts), loops 3 (6 pts), 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.
JSInterpreter._separate_at_op (cognitive 31) youtube_dl/jsinterp.py:710— JSInterpreter._separate_at_op has cognitive complexity 31 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 3 (8 pts), ternaries 2 (5 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.
AdultSwimIE._real_extract (cognitive 30) REDACTED:91— AdultSwimIE._real_extract has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 2 (5 pts), boolean chains 4 (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.
GediDigitalIE._real_extract (cognitive 30) youtube_dl/extractor/gedidigital.py:97— GediDigitalIE._real_extract has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (28 pts), boolean chains 1, loops 1 (nesting depth added 19). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
LyndaIE._real_extract (cognitive 30) youtube_dl/extractor/lynda.py:130— LyndaIE._real_extract has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (7 pts), ternaries 2 (6 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.
TvigleIE._real_extract (cognitive 30) youtube_dl/extractor/tvigle.py:56— TvigleIE._real_extract has cognitive complexity 30 (threshold 15). Drivers by points: if/else 11 (25 pts), loops 2 (4 pts), boolean chains 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.
utils.decode_png (cognitive 30) REDACTED:6061— utils.decode_png has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (22 pts), loops 4 (5 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.
YoutubeDL._match_entry (cognitive 29) youtube_dl/YoutubeDL.py:793— YoutubeDL._match_entry has cognitive complexity 29 (threshold 15). Drivers by points: if/else 15 (27 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.
CCMAIE._real_extract (cognitive 29) youtube_dl/extractor/ccma.py:63— CCMAIE._real_extract has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (18 pts), boolean chains 4, loops 2 (3 pts), ternaries 2 (3 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.
InfoExtractor._initialize_geo_bypass (cognitive 29) REDACTED:480— InfoExtractor._initialize_geo_bypass has cognitive complexity 29 (threshold 15). Drivers by points: if/else 12 (27 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.
FirstTVIE._real_extract (cognitive 29) youtube_dl/extractor/firsttv.py:62— FirstTVIE._real_extract has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 8, 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.
ImgGamingBaseIE._real_extract (cognitive 29) youtube_dl/extractor/imggaming.py:64— ImgGamingBaseIE._real_extract has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (17 pts), loops 4 (7 pts), ternaries 1 (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.
IviIE._real_extract (cognitive 29) youtube_dl/extractor/ivi.py:83— IviIE._real_extract has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 4, error handling 1 (3 pts), loops 2, ternaries 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.
SohuIE._real_extract (cognitive 29) youtube_dl/extractor/sohu.py:87— SohuIE._real_extract has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4 (7 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.
ToggleIE._real_extract (cognitive 29) youtube_dl/extractor/toggle.py:90— ToggleIE._real_extract has cognitive complexity 29 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 pts), boolean chains 4 (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.
utils.write_xattr (cognitive 29) REDACTED:6166— utils.write_xattr has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (19 pts), error handling 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.
YoutubeDL.process_ie_result (cognitive 28) youtube_dl/YoutubeDL.py:1001— YoutubeDL.process_ie_result has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (22 pts), boolean chains 4, 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.
AMPIE._extract_feed_info (cognitive 28) youtube_dl/extractor/amp.py:18— AMPIE._extract_feed_info has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (19 pts), loops 3 (5 pts), boolean chains 4 (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.
InfoExtractor._request_webpage (cognitive 28) REDACTED:647— InfoExtractor._request_webpage has cognitive complexity 28 (threshold 15). Drivers by points: if/else 16 (26 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.
LEGOIE._real_extract (cognitive 28) youtube_dl/extractor/lego.py:66— LEGOIE._real_extract has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (17 pts), boolean chains 6, loops 2 (4 pts), error handling 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
LinuxAcademyIE._real_extract (cognitive 28) youtube_dl/extractor/linuxacademy.py:154— LinuxAcademyIE._real_extract has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 6, ternaries 2 (5 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.
MDRIE._real_extract (cognitive 28) youtube_dl/extractor/mdr.py:102— MDRIE._real_extract has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (22 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RTBFIE._real_extract (cognitive 28) youtube_dl/extractor/rtbf.py:70— RTBFIE._real_extract has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 6, loops 3 (5 pts), 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.
SRGSSRIE._real_extract (cognitive 28) youtube_dl/extractor/srgssr.py:84— SRGSSRIE._real_extract has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (18 pts), loops 4 (7 pts), boolean chains 3 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TeamcocoIE._real_extract (cognitive 28) youtube_dl/extractor/teamcoco.py:110— TeamcocoIE._real_extract has cognitive complexity 28 (threshold 15). Drivers by points: if/else 12 (25 pts), loops 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.
WDRIE._real_extract (cognitive 28) youtube_dl/extractor/wdr.py:44— WDRIE._real_extract has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (21 pts), loops 3 (5 pts), boolean chains 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.
WistiaBaseIE._extract_media (cognitive 28) youtube_dl/extractor/wistia.py:33— WistiaBaseIE._extract_media has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (18 pts), boolean chains 5, ternaries 1 (3 pts), loops 2 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ARDMediathekIE._real_extract (cognitive 27) youtube_dl/extractor/ard.py:161— ARDMediathekIE._real_extract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 12 (17 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CuriosityStreamIE._real_extract (cognitive 27) youtube_dl/extractor/curiositystream.py:68— CuriosityStreamIE._real_extract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (17 pts), loops 4 (7 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.
HitboxLiveIE._real_extract (cognitive 27) youtube_dl/extractor/hitbox.py:160— HitboxLiveIE._real_extract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 2 (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.
PBSIE._extract_webpage (cognitive 27) youtube_dl/extractor/pbs.py:438— PBSIE._extract_webpage has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (21 pts), loops 2 (4 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.
SpankwireIE._real_extract (cognitive 27) youtube_dl/extractor/spankwire.py:76— SpankwireIE._real_extract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (3 pts), ternaries 1 (3 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.
TwitchPlaylistBaseIE._entries (cognitive 27) REDACTED:428— TwitchPlaylistBaseIE._entries has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (3 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.
VevoIE._real_extract (cognitive 27) youtube_dl/extractor/vevo.py:191— VevoIE._real_extract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 13 (21 pts), boolean chains 2, loops 2, ternaries 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.
VRVIE._real_extract (cognitive 27) youtube_dl/extractor/vrv.py:167— VRVIE._real_extract has cognitive complexity 27 (threshold 15). Drivers by points: if/else 7 (15 pts), loops 6 (11 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.
ZingMp3BaseIE._extract_item (cognitive 27) youtube_dl/extractor/zingmp3.py:15— ZingMp3BaseIE._extract_item has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (19 pts), boolean chains 4, 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.
utils._match_one (cognitive 27) REDACTED:4866— utils._match_one has cognitive complexity 27 (threshold 15). Drivers by points: if/else 9 (21 pts), boolean chains 3, error handling 1 (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.
YoutubeDL.__process_playlist (cognitive 26) youtube_dl/YoutubeDL.py:1108— YoutubeDL.__process_playlist has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (19 pts), loops 2 (4 pts), 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.
YoutubeDL.process_subtitles (cognitive 26) youtube_dl/YoutubeDL.py:1872— YoutubeDL.process_subtitles has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (16 pts), loops 3 (5 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.
PeerTubeIE._real_extract (cognitive 26) youtube_dl/extractor/peertube.py:531— PeerTubeIE._real_extract has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (16 pts), boolean chains 5, ternaries 2 (3 pts), loops 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.
PinterestBaseIE._extract_video (cognitive 26) youtube_dl/extractor/pinterest.py:29— PinterestBaseIE._extract_video has cognitive complexity 26 (threshold 15). Drivers by points: if/else 8 (18 pts), boolean chains 4, 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.
YandexDiskIE._real_extract (cognitive 26) youtube_dl/extractor/yandexdisk.py:59— YandexDiskIE._real_extract has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 10, 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.
YoutubeDLHandler.http_response (cognitive 26) REDACTED:2789— YoutubeDLHandler.http_response has cognitive complexity 26 (threshold 15). Drivers by points: if/else 11 (20 pts), loops 2 (3 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.
YoutubeDLCookieJar.save (cognitive 26) REDACTED:2951— YoutubeDLCookieJar.save has cognitive complexity 26 (threshold 15). Drivers by points: if/else 14 (22 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.
utils.parse_codecs (cognitive 26) REDACTED:4742— utils.parse_codecs has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (17 pts), boolean chains 4, ternaries 3 (4 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.
FileDownloader.report_progress (cognitive 25) youtube_dl/downloader/common.py:259— FileDownloader.report_progress has cognitive complexity 25 (threshold 15). Drivers by points: if/else 17 (23 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.
InfoExtractor._parse_jwplayer_data (cognitive 25) REDACTED:3037— InfoExtractor._parse_jwplayer_data has cognitive complexity 25 (threshold 15). Drivers by points: if/else 10 (16 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.
CoubIE._real_extract (cognitive 25) youtube_dl/extractor/coub.py:46— CoubIE._real_extract has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (5 pts), loops 2 (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.
GloboIE._real_extract (cognitive 25) REDACTED:93— GloboIE._real_extract has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 7, ternaries 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.
MediasiteIE._real_extract (cognitive 25) youtube_dl/extractor/mediasite.py:125— MediasiteIE._real_extract has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (6 pts), ternaries 1 (3 pts) (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RedTubeIE._real_extract (cognitive 25) youtube_dl/extractor/redtube.py:45— RedTubeIE._real_extract has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (15 pts), boolean chains 5, loops 3 (5 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SVTBaseIE._extract_video (cognitive 25) youtube_dl/extractor/svt.py:22— SVTBaseIE._extract_video has cognitive complexity 25 (threshold 15). Drivers by points: if/else 8 (16 pts), boolean chains 3, loops 2 (3 pts), ternaries 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.
YoutubeDL.trouble (cognitive 24) youtube_dl/YoutubeDL.py:610— YoutubeDL.trouble has cognitive complexity 24 (threshold 15). Drivers by points: if/else 11 (19 pts), ternaries 3, 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.
YoutubeDL._calc_headers (cognitive 24) youtube_dl/YoutubeDL.py:1578— YoutubeDL._calc_headers has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 2 (5 pts), ternaries 1 (5 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.
IsmFD.real_download (cognitive 24) youtube_dl/downloader/ism.py:213— IsmFD.real_download has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (17 pts), error handling 1 (3 pts), 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.
AppleTrailersIE._real_extract (cognitive 24) youtube_dl/extractor/appletrailers.py:96— AppleTrailersIE._real_extract has cognitive complexity 24 (threshold 15). Drivers by points: loops 5 (12 pts), if/else 4 (10 pts), boolean chains 2 (nesting depth added 13). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
CamModelsIE._real_extract (cognitive 24) youtube_dl/extractor/cammodels.py:19— CamModelsIE._real_extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (21 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.
DVTVIE._parse_video_metadata (cognitive 24) youtube_dl/extractor/dvtv.py:115— DVTVIE._parse_video_metadata has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (7 pts), boolean chains 4 (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.
HKETVIE._real_extract (cognitive 24) youtube_dl/extractor/hketv.py:74— HKETVIE._real_extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (14 pts), boolean chains 6, 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.
ITVIE._real_extract (cognitive 24) youtube_dl/extractor/itv.py:180— ITVIE._real_extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 9, loops 3, ternaries 2 (nesting depth added 3). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
KinjaEmbedIE._real_extract (cognitive 24) youtube_dl/extractor/kinja.py:131— KinjaEmbedIE._real_extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 4, 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.
MTVServicesInfoExtractor._extract_video_formats (cognitive 24) youtube_dl/extractor/mtv.py:71— MTVServicesInfoExtractor._extract_video_formats has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (6 pts), error handling 1 (3 pts), boolean chains 1, loops 1 (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NexxIE._extract_azure_formats (cognitive 24) REDACTED:223— NexxIE._extract_azure_formats has cognitive complexity 24 (threshold 15). Drivers by points: if/else 6 (19 pts), loops 1 (3 pts), boolean chains 1, ternaries 1 (nesting depth added 15). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
NRKTVSeriesIE._real_extract (cognitive 24) youtube_dl/extractor/nrk.py:693— NRKTVSeriesIE._real_extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 5 (12 pts), boolean chains 6, loops 2 (4 pts), ternaries 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.
VGTVIE._real_extract (cognitive 24) youtube_dl/extractor/vgtv.py:167— VGTVIE._real_extract has cognitive complexity 24 (threshold 15). Drivers by points: if/else 10 (14 pts), loops 2 (4 pts), ternaries 3 (4 pts), boolean chains 2 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EmbedThumbnailPP.run (cognitive 24) youtube_dl/postprocessor/embedthumbnail.py:33— EmbedThumbnailPP.run has cognitive complexity 24 (threshold 15). Drivers by points: if/else 15 (23 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.
FFmpegPostProcessor._determine_executables (cognitive 24) youtube_dl/postprocessor/ffmpeg.py:76— FFmpegPostProcessor._determine_executables has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (18 pts), loops 2 (3 pts), ternaries 2 (3 pts) (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
InfoExtractor._extract_akamai_formats (cognitive 23) REDACTED:2911— InfoExtractor._extract_akamai_formats has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 3 (9 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
CorusIE._real_extract (cognitive 23) youtube_dl/extractor/corus.py:98— CorusIE._real_extract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (15 pts), ternaries 2 (4 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.
FusionIE._real_extract (cognitive 23) youtube_dl/extractor/fusion.py:38— FusionIE._real_extract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 5 (9 pts), ternaries 2 (8 pts), boolean chains 3, 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.
MedalTVIE._real_extract (cognitive 23) youtube_dl/extractor/medaltv.py:53— MedalTVIE._real_extract 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.
OoyalaBaseIE._extract (cognitive 23) youtube_dl/extractor/ooyala.py:26— OoyalaBaseIE._extract has cognitive complexity 23 (threshold 15). Drivers by points: boolean chains 11, if/else 6 (10 pts), loops 2 (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.
ServusIE._real_extract (cognitive 23) REDACTED:63— ServusIE._real_extract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 6 (12 pts), boolean chains 9, 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.
TeamTreeHouseIE._real_extract (cognitive 23) youtube_dl/extractor/teamtreehouse.py:73— TeamTreeHouseIE._real_extract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 3 (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.
TVNowBaseIE._extract_video (cognitive 23) youtube_dl/extractor/tvnow.py:30— TVNowBaseIE._extract_video has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (13 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.
UMGDeIE._real_extract (cognitive 23) youtube_dl/extractor/umg.py:28— UMGDeIE._real_extract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (19 pts), loops 2 (3 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.
VideomoreIE._real_extract (cognitive 23) youtube_dl/extractor/videomore.py:147— VideomoreIE._real_extract has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (16 pts), loops 3 (4 pts), boolean chains 3 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
YoutubeTabIE._grid_entries (cognitive 23) REDACTED:3560— YoutubeTabIE._grid_entries has cognitive complexity 23 (threshold 15). Drivers by points: if/else 8 (19 pts), loops 2 (4 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.
prepare_manpage.filter_options (cognitive 22) devscripts/prepare_manpage.py:43— prepare_manpage.filter_options has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (21 pts), loops 1 (nesting depth added 13). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
YoutubeDL.__init__ (cognitive 22) youtube_dl/YoutubeDL.py:378— YoutubeDL.__init__ has cognitive complexity 22 (threshold 15). Drivers by points: if/else 11 (15 pts), error handling 2 (4 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.
YoutubeDL._format_note (cognitive 22) youtube_dl/YoutubeDL.py:2406— YoutubeDL._format_note has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 8, ternaries 4 (5 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
CanvasIE._real_extract (cognitive 22) REDACTED:49— CanvasIE._real_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (16 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.
DiscoveryGoBaseIE._extract_video_info (cognitive 22) youtube_dl/extractor/discoverygo.py:31— DiscoveryGoBaseIE._extract_video_info has cognitive complexity 22 (threshold 15). Drivers by points: if/else 7 (12 pts), ternaries 2 (5 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
MediasetIE._real_extract (cognitive 22) youtube_dl/extractor/mediaset.py:134— MediasetIE._real_extract has cognitive complexity 22 (threshold 15). Drivers by points: loops 4 (7 pts), if/else 3 (6 pts), ternaries 1 (4 pts), error handling 1 (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.
MicrosoftVirtualAcademyIE._real_extract (cognitive 22) youtube_dl/extractor/microsoftvirtualacademy.py:55— MicrosoftVirtualAcademyIE._real_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (15 pts), loops 3 (4 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.
NHLBaseIE._real_extract (cognitive 22) youtube_dl/extractor/nhl.py:16— NHLBaseIE._real_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (15 pts), ternaries 2 (4 pts), loops 2, 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.
PornHubPagedPlaylistBaseIE._entries (cognitive 22) REDACTED:584— PornHubPagedPlaylistBaseIE._entries has cognitive complexity 22 (threshold 15). Drivers by points: if/else 5 (11 pts), error handling 2 (4 pts), loops 2 (3 pts), boolean chains 2, ternaries 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.
TelecincoIE._real_extract (cognitive 22) youtube_dl/extractor/telecinco.py:118— TelecincoIE._real_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (17 pts), boolean chains 3, 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.
TVPlayIE._real_extract (cognitive 22) youtube_dl/extractor/tvplay.py:236— TVPlayIE._real_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (18 pts), boolean chains 2, error handling 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.
UdemyCourseIE._real_extract (cognitive 22) youtube_dl/extractor/udemy.py:437— UdemyCourseIE._real_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (20 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.
UOLIE._real_extract (cognitive 22) youtube_dl/extractor/uol.py:67— UOLIE._real_extract has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 5 (8 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.
options.parseOpts (cognitive 22) youtube_dl/options.py:42— options.parseOpts has cognitive complexity 22 (threshold 15). Drivers by points: if/else 9 (18 pts), loops 1 (3 pts), 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.
BrightcoveNewIE._real_extract (cognitive 21) youtube_dl/extractor/brightcove.py:589— BrightcoveNewIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 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.
CondeNastIE._extract_video (cognitive 21) youtube_dl/extractor/condenast.py:143— CondeNastIE._extract_video has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), ternaries 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.
DailymotionBaseInfoExtractor._call_api (cognitive 21) REDACTED:48— DailymotionBaseInfoExtractor._call_api has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (4 pts), error handling 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.
MailRuIE._real_extract (cognitive 21) youtube_dl/extractor/mailru.py:99— MailRuIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 5, 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.
NBABaseIE._extract_video (cognitive 21) youtube_dl/extractor/nba.py:277— NBABaseIE._extract_video 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.
OdnoklassnikiIE._real_extract (cognitive 21) youtube_dl/extractor/odnoklassniki.py:133— OdnoklassnikiIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 14 (17 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
PlayvidIE._real_extract (cognitive 21) youtube_dl/extractor/playvid.py:41— PlayvidIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 1 (4 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.
RICEIE._real_extract (cognitive 21) youtube_dl/extractor/rice.py:32— RICEIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), loops 2, 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.
RTVEALaCartaIE._decrypt_url (cognitive 21) youtube_dl/extractor/rtve.py:80— RTVEALaCartaIE._decrypt_url has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 3 (7 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
RUTVIE._real_extract (cognitive 21) youtube_dl/extractor/rutv.py:126— RUTVIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 3 (5 pts), loops 2 (3 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SevenPlusIE._real_extract (cognitive 21) youtube_dl/extractor/sevenplus.py:45— SevenPlusIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 5 (13 pts), loops 3 (5 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.
SVTSeriesIE._real_extract (cognitive 21) youtube_dl/extractor/svt.py:303— SVTSeriesIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 5, 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.
VidmeIE._real_extract (cognitive 21) youtube_dl/extractor/vidme.py:135— VidmeIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (12 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
VoxMediaVolumeIE._real_extract (cognitive 21) youtube_dl/extractor/voxmedia.py:18— VoxMediaVolumeIE._real_extract has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, ternaries 1 (3 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.
OnDemandPagedList.getslice (cognitive 21) REDACTED:4162— OnDemandPagedList.getslice has cognitive complexity 21 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (4 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.
CONtvIE._real_extract (cognitive 20) youtube_dl/extractor/contv.py:36— CONtvIE._real_extract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (11 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.
HiDiveIE._real_extract (cognitive 20) youtube_dl/extractor/hidive.py:57— HiDiveIE._real_extract 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.
MindsIE._real_extract (cognitive 20) youtube_dl/extractor/minds.py:71— MindsIE._real_extract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), boolean chains 7, loops 1, ternaries 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.
MixcloudIE._real_extract (cognitive 20) youtube_dl/extractor/mixcloud.py:99— MixcloudIE._real_extract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 7, loops 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.
NownessBaseIE._extract_url_result (cognitive 20) youtube_dl/extractor/nowness.py:17— NownessBaseIE._extract_url_result has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (18 pts), loops 1 (2 pts) (nesting depth added 14). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
PyvideoIE._real_extract (cognitive 20) youtube_dl/extractor/pyvideo.py:29— PyvideoIE._real_extract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 2 (4 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.
RoosterTeethIE._real_extract (cognitive 20) youtube_dl/extractor/roosterteeth.py:84— RoosterTeethIE._real_extract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 4 (11 pts), boolean chains 4, loops 2 (4 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.
ThePlatformIE._real_extract (cognitive 20) youtube_dl/extractor/theplatform.py:235— ThePlatformIE._real_extract has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), loops 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.
ZDFBaseIE._extract_ptmd (cognitive 20) youtube_dl/extractor/zdf.py:95— ZDFBaseIE._extract_ptmd has cognitive complexity 20 (threshold 15). Drivers by points: loops 4 (10 pts), if/else 3 (9 pts), boolean chains 1 (nesting depth added 12). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
LazyList.__getitem__ (cognitive 20) REDACTED:4094— LazyList.__getitem__ has cognitive complexity 20 (threshold 15). Drivers by points: boolean chains 9, if/else 6 (8 pts), error handling 2 (3 pts) (nesting depth added 3). 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.
AparatIE._real_extract (cognitive 19) youtube_dl/extractor/aparat.py:36— AparatIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 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.
ARDIE._real_extract (cognitive 19) youtube_dl/extractor/ard.py:283— ARDIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 3 (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.
CiscoLiveSearchIE._entries (cognitive 19) REDACTED:120— CiscoLiveSearchIE._entries has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
EaglePlatformIE._real_extract (cognitive 19) youtube_dl/extractor/eagleplatform.py:123— EaglePlatformIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (3 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.
EpornerIE._real_extract (cognitive 19) youtube_dl/extractor/eporner.py:53— EpornerIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (13 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.
FunimationIE._real_extract (cognitive 19) youtube_dl/extractor/funimation.py:81— FunimationIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (10 pts), boolean chains 7, 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.
IPrimaIE._real_extract (cognitive 19) youtube_dl/extractor/iprima.py:74— IPrimaIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
KeezMoviesIE._extract_info (cognitive 19) youtube_dl/extractor/keezmovies.py:37— KeezMoviesIE._extract_info has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, loops 1 (2 pts), 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.
ManyVidsIE._real_extract (cognitive 19) youtube_dl/extractor/manyvids.py:47— ManyVidsIE._real_extract 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.
NetEaseMusicBaseIE.extract_formats (cognitive 19) REDACTED:113— NetEaseMusicBaseIE.extract_formats has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (12 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.
ORFONBase._extract_video (cognitive 19) youtube_dl/extractor/orf.py:531— ORFONBase._extract_video has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (13 pts), loops 2 (3 pts), 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.
PatreonIE._real_extract (cognitive 19) youtube_dl/extractor/patreon.py:95— PatreonIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (14 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.
RaiPlayPlaylistIE._real_extract (cognitive 19) youtube_dl/extractor/rai.py:365— RaiPlayPlaylistIE._real_extract 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.
SkyBaseIE._process_ooyala_element (cognitive 19) youtube_dl/extractor/sky.py:19— SkyBaseIE._process_ooyala_element has cognitive complexity 19 (threshold 15). Drivers by points: if/else 5 (15 pts), boolean chains 4 (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
VideaIE._real_extract (cognitive 19) REDACTED:128— VideaIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (10 pts), ternaries 2 (4 pts), boolean chains 3, loops 2 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
YahooIE._real_extract (cognitive 19) REDACTED:276— YahooIE._real_extract has cognitive complexity 19 (threshold 15). Drivers by points: if/else 7 (15 pts), boolean chains 2, 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.
FFmpegPostProcessor.get_audio_codec (cognitive 19) youtube_dl/postprocessor/ffmpeg.py:157— FFmpegPostProcessor.get_audio_codec has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 2, loops 1 (2 pts), ternaries 2, error handling 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, 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.
ADNIE._get_subtitles (cognitive 18) youtube_dl/extractor/adn.py:79— ADNIE._get_subtitles has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 3, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
BRMediathekIE._real_extract (cognitive 18) youtube_dl/extractor/br.py:194— BRMediathekIE._real_extract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 4 (5 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InfoExtractor._search_regex (cognitive 18) REDACTED:1063— InfoExtractor._search_regex has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), loops 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.
ImgurIE._real_extract (cognitive 18) youtube_dl/extractor/imgur.py:95— ImgurIE._real_extract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 12 (15 pts), boolean chains 3 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
KakaoIE._real_extract (cognitive 18) youtube_dl/extractor/kakao.py:53— KakaoIE._real_extract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (9 pts), boolean chains 4, error handling 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.
MLBBaseIE._real_extract (cognitive 18) youtube_dl/extractor/mlb.py:16— MLBBaseIE._real_extract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), boolean chains 3, loops 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.
MTVServicesInfoExtractor._get_video_info (cognitive 18) youtube_dl/extractor/mtv.py:132— MTVServicesInfoExtractor._get_video_info has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
PuhuTVSerieIE._extract_entries (cognitive 18) youtube_dl/extractor/puhutv.py:195— PuhuTVSerieIE._extract_entries has cognitive complexity 18 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (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.
RayWenderlichIE._extract_video_id (cognitive 18) youtube_dl/extractor/raywenderlich.py:54— RayWenderlichIE._extract_video_id has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (13 pts), loops 2 (3 pts), boolean chains 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TeachableIE._real_extract (cognitive 18) youtube_dl/extractor/teachable.py:153— TeachableIE._real_extract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (14 pts), loops 1 (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.
Vbox7IE._real_extract (cognitive 18) youtube_dl/extractor/vbox7.py:111— Vbox7IE._real_extract has cognitive complexity 18 (threshold 15). Drivers by points: boolean chains 7, if/else 6, ternaries 2 (3 pts), error handling 1 (2 pts) (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
ViewLiftEmbedIE._real_extract (cognitive 18) youtube_dl/extractor/viewlift.py:94— ViewLiftEmbedIE._real_extract has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (11 pts), boolean chains 2, loops 2, ternaries 1 (2 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.
VRVBaseIE._call_cms (cognitive 18) youtube_dl/extractor/vrv.py:65— VRVBaseIE._call_cms has cognitive complexity 18 (threshold 15). Drivers by points: if/else 4 (12 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 10). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
WebcasterIE._real_extract (cognitive 18) youtube_dl/extractor/webcaster.py:30— WebcasterIE._real_extract has cognitive complexity 18 (threshold 15). Drivers by points: loops 3 (7 pts), if/else 2 (6 pts), ternaries 1 (5 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
XAttrMetadataPP.run (cognitive 18) youtube_dl/postprocessor/xattrpp.py:26— XAttrMetadataPP.run has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 1 (3 pts), error handling 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.
YoutubeDL._build_format_filter (cognitive 17) youtube_dl/YoutubeDL.py:1225— YoutubeDL._build_format_filter has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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.
YoutubeDL.print_debug_header (cognitive 17) youtube_dl/YoutubeDL.py:2497— YoutubeDL.print_debug_header has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), error handling 2 (3 pts), loops 1, ternaries 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
YoutubeDL._write_thumbnails (cognitive 17) youtube_dl/YoutubeDL.py:2680— YoutubeDL._write_thumbnails has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), ternaries 2 (4 pts), error handling 1 (3 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.
HttpFD.real_download (cognitive 17) youtube_dl/downloader/http.py:28— HttpFD.real_download has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (7 pts), error handling 3 (6 pts), boolean chains 2, 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.
AdobeTVBaseIE._parse_video_data (cognitive 17) youtube_dl/extractor/adobetv.py:39— AdobeTVBaseIE._parse_video_data has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 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.
AnvatoIE._get_anvato_videos (cognitive 17) REDACTED:273— AnvatoIE._get_anvato_videos has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 6, if/else 3 (5 pts), ternaries 2 (4 pts), 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.
FazIE._real_extract (cognitive 17) youtube_dl/extractor/faz.py:44— FazIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (14 pts), boolean chains 1, loops 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.
IndavideoEmbedIE._real_extract (cognitive 17) youtube_dl/extractor/indavideo.py:57— IndavideoEmbedIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (13 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.
IqiyiIE._real_extract (cognitive 17) REDACTED:339— IqiyiIE._real_extract 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.
MixcloudPlaylistBaseIE._real_extract (cognitive 17) youtube_dl/extractor/mixcloud.py:234— MixcloudPlaylistBaseIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: ternaries 3 (6 pts), if/else 3 (5 pts), boolean chains 3, loops 2 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NYTimesBaseIE._extract_video_from_id (cognitive 17) youtube_dl/extractor/nytimes.py:23— NYTimesBaseIE._extract_video_from_id has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, loops 2, ternaries 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.
PlatziCourseIE._real_extract (cognitive 17) youtube_dl/extractor/platzi.py:184— PlatziCourseIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (13 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.
SenateISVPIE._real_extract (cognitive 17) youtube_dl/extractor/senateisvp.py:102— SenateISVPIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), loops 2 (4 pts), ternaries 3 (4 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.
SinaIE._real_extract (cognitive 17) youtube_dl/extractor/sina.py:58— SinaIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (14 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
TagesschauIE._extract_formats (cognitive 17) youtube_dl/extractor/tagesschau.py:213— TagesschauIE._extract_formats has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (16 pts), loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
ThePlatformBaseIE._extract_theplatform_smil (cognitive 17) youtube_dl/extractor/theplatform.py:37— ThePlatformBaseIE._extract_theplatform_smil 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.
TNAFlixNetworkBaseIE._real_extract (cognitive 17) youtube_dl/extractor/tnaflix.py:75— TNAFlixNetworkBaseIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), ternaries 2 (3 pts), loops 2, 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.
TurnerBaseIE._extract_ngtv_info (cognitive 17) youtube_dl/extractor/turner.py:223— TurnerBaseIE._extract_ngtv_info has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (10 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.
TVNetIE._real_extract (cognitive 17) youtube_dl/extractor/tvnet.py:82— TVNetIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (8 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
YouPornIE._real_extract (cognitive 17) youtube_dl/extractor/youporn.py:116— YouPornIE._real_extract has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (9 pts), boolean chains 4, loops 2, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
InfoExtractor._extract_wowza_formats (cognitive 16) REDACTED:2967— InfoExtractor._extract_wowza_formats has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (10 pts), loops 2 (5 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.
DiscoveryIE._real_extract (cognitive 16) youtube_dl/extractor/discovery.py:64— DiscoveryIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 5, 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.
DRTVLiveIE._real_extract (cognitive 16) youtube_dl/extractor/drtv.py:319— DRTVLiveIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (10 pts), loops 3 (6 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
GenericIE._extract_rss (cognitive 16) youtube_dl/extractor/generic.py:2349— GenericIE._extract_rss has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), loops 2 (3 pts), boolean chains 2, 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.
ITVBaseIE._download_webpage_handle (cognitive 16) youtube_dl/extractor/itv.py:55— ITVBaseIE._download_webpage_handle has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 4 (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.
JojIE._real_extract (cognitive 16) youtube_dl/extractor/joj.py:51— JojIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 3 (6 pts), boolean chains 4, loops 2 (3 pts), ternaries 1 (3 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
NBCNewsIE._real_extract (cognitive 16) youtube_dl/extractor/nbc.py:376— NBCNewsIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (13 pts), 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.
PlaytvakIE._real_extract (cognitive 16) youtube_dl/extractor/playtvak.py:102— PlaytvakIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (12 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.
ScreencastIE._real_extract (cognitive 16) youtube_dl/extractor/screencast.py:61— ScreencastIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (16 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.
SportDeutschlandIE._real_extract (cognitive 16) youtube_dl/extractor/sportdeutschland.py:48— SportDeutschlandIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (8 pts), boolean chains 6, ternaries 1 (2 pts) (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
SpotifyBaseIE._extract_episode (cognitive 16) youtube_dl/extractor/spotify.py:43— SpotifyBaseIE._extract_episode has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, 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.
STVPlayerIE._real_extract (cognitive 16) youtube_dl/extractor/stv.py:45— STVPlayerIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 2 (3 pts), loops 2, ternaries 1 (2 pts) (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.
ViceIE._real_extract (cognitive 16) youtube_dl/extractor/vice.py:120— ViceIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 9, if/else 3 (5 pts), error handling 1, 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.
ViqeoIE._real_extract (cognitive 16) youtube_dl/extractor/viqeo.py:49— ViqeoIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
WatchBoxIE._real_extract (cognitive 16) youtube_dl/extractor/watchbox.py:65— WatchBoxIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: boolean chains 11, if/else 5. 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.
XimalayaIE._real_extract (cognitive 16) youtube_dl/extractor/ximalaya.py:108— XimalayaIE._real_extract has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (10 pts), ternaries 3 (4 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.
JS_RegExp.__getattr__ (cognitive 16) youtube_dl/jsinterp.py:484— JS_RegExp.__getattr__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), ternaries 2 (6 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.
utils.parse_duration (cognitive 16) REDACTED:3929— utils.parse_duration has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (11 pts), ternaries 5 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D22 · Internal API Consistency· Inconsistent capability checking methods across extractor and downloader domains. Extractors use `suitable` to check if a URL matches, while external downloaders use `supports` or `can_download` to check if a specific media format/info is supported. This forces consumers to use different method names and argument types (URL vs InfoDict) depending on whether they are checking for URL matching or format compatibility. · ×1
Inconsistent capability checking methods across extractor and downloader domains. Extractors use `suitable` to check if a URL matches, while external downloaders use `supports` or `can_download` to check if a specific media format/info is supported. This forces consumers to use different method names and argument types (URL vs InfoDict) depending on whether they are checking for URL matching or format compatibility. — Standardize on a single method name (e.g., `supports`) and signature (accepting `info_dict` or `url` consistently) for all capability checks, or clearly document that `suitable` is for URL pattern matching and `supports`/`can_download` is for format capability checking. (signatures: InfoExtractor.suitable(cls, url) | ExternalFD.supports(cls, info_dict) | ExternalFD.can_download(cls, info_dict) | HlsFD.can_download(manifest, info_dict))
D22 · Internal API Consistency· Inconsistent parameter handling for cache operations. `store`, `load`, and `clear` require explicit `section`, `key`, and `dtype` parameters, while `remove` takes no arguments (likely operating on the instance's current state or a default context). This breaks the symmetry of the cache API surface. · ×1
Inconsistent parameter handling for cache operations. `store`, `load`, and `clear` require explicit `section`, `key`, and `dtype` parameters, while `remove` takes no arguments (likely operating on the instance's current state or a default context). This breaks the symmetry of the cache API surface. — Make `remove` accept the same `section`, `key`, and `dtype` parameters as `clear` and `load` to allow precise removal of specific cache entries, or remove the instance-level `remove` if it is redundant with `clear`. (signatures: Cache.store(self, section, key, data, dtype) | Cache.load(self, section, key, dtype, default) | Cache.clear(self, section, key, dtype) | Cache.remove(self))
D4 · Code Duplication· Members sharing a duplicated core (4 members, 50+ identical tokens) · ×1
Members sharing a duplicated core (4 members, 50+ identical tokens) youtube_dl/extractor/dplay.py:188— youtube_dl/extractor/dplay.py:188-287 | youtube_dl/extractor/generic.py:2530-3781 | youtube_dl/extractor/npo.py:187-297 | REDACTED:64-148 — These 4 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 4 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 4 times.
Duplicated block (26 lines × 2) youtube_dl/extractor/go.py:290— youtube_dl/extractor/go.py:290-315 | youtube_dl/extractor/vrv.py:217-246 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/go.py:290` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (23–24 lines × 2) youtube_dl/extractor/frontendmasters.py:36— youtube_dl/extractor/frontendmasters.py:36-58 | youtube_dl/extractor/pluralsight.py:169-192 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/frontendmasters.py:36` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (12–22 lines × 2) youtube_dl/extractor/generic.py:2968— youtube_dl/extractor/generic.py:2968-2979 | youtube_dl/extractor/generic.py:3113-3134 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/generic.py:2968` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (17–18 lines × 2) youtube_dl/extractor/hornbunny.py:32— youtube_dl/extractor/hornbunny.py:32-49 | REDACTED:47-63 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
Duplicated block (16 lines × 2) youtube_dl/update.py:106— youtube_dl/update.py:106-121 | youtube_dl/update.py:152-167 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (15 lines × 3) youtube_dl/options.py:607— youtube_dl/options.py:607-621 | youtube_dl/options.py:639-653 | youtube_dl/options.py:664-678 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:607` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (14–15 lines × 2) youtube_dl/extractor/scte.py:21— youtube_dl/extractor/scte.py:21-34 | youtube_dl/extractor/udemy.py:175-189 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/scte.py:21` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (13–14 lines × 2) youtube_dl/downloader/external.py:452— youtube_dl/downloader/external.py:452-465 | youtube_dl/downloader/rtmp.py:128-140 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/downloader/rtmp.py:128` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (13 lines × 2) youtube_dl/extractor/livestream.py:162— youtube_dl/extractor/livestream.py:162-174 | youtube_dl/extractor/livestream.py:290-303 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
Duplicated block (12–13 lines × 2) youtube_dl/extractor/morningstar.py:31— youtube_dl/extractor/morningstar.py:31-42 | youtube_dl/extractor/ruhd.py:23-35 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/morningstar.py:31` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11–12 lines × 6) youtube_dl/options.py:150— youtube_dl/options.py:150-160 | youtube_dl/options.py:620-630 | youtube_dl/options.py:656-667 | youtube_dl/options.py:763-773 | youtube_dl/options.py:795-805 | youtube_dl/options.py:832-842 — all 6 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:150` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (10–12 lines × 4) youtube_dl/options.py:187— youtube_dl/options.py:187-198 | youtube_dl/options.py:606-615 | youtube_dl/options.py:637-647 | youtube_dl/options.py:662-672 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:187` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (11–12 lines × 4) youtube_dl/options.py:185— youtube_dl/options.py:185-196 | youtube_dl/options.py:546-557 | youtube_dl/options.py:635-645 | youtube_dl/options.py:660-670 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:185` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (12 lines × 4) youtube_dl/options.py:442— youtube_dl/options.py:442-453 | youtube_dl/options.py:615-626 | youtube_dl/options.py:672-683 | youtube_dl/options.py:827-838 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:442` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (11–12 lines × 2) youtube_dl/extractor/byutv.py:92— youtube_dl/extractor/byutv.py:92-103 | youtube_dl/extractor/egghead.py:114-124 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (10–11 lines × 7) youtube_dl/options.py:153— youtube_dl/options.py:153-163 | youtube_dl/options.py:184-194 | youtube_dl/options.py:446-456 | youtube_dl/options.py:619-629 | youtube_dl/options.py:660-669 | youtube_dl/options.py:766-775 | youtube_dl/options.py:831-841 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:153` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10–11 lines × 4) youtube_dl/options.py:442— youtube_dl/options.py:442-452 | youtube_dl/options.py:603-612 | youtube_dl/options.py:615-625 | youtube_dl/options.py:672-682 — all 4 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:442` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 7) youtube_dl/options.py:152— youtube_dl/options.py:152-161 | youtube_dl/options.py:445-454 | youtube_dl/options.py:618-627 | youtube_dl/options.py:659-668 | youtube_dl/options.py:765-774 | youtube_dl/options.py:797-806 | youtube_dl/options.py:830-839 — all 7 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:152` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (10 lines × 3) youtube_dl/extractor/byutv.py:89— youtube_dl/extractor/byutv.py:89-98 | youtube_dl/extractor/crackle.py:109-118 | youtube_dl/extractor/egghead.py:111-120 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
Duplicated block (9 lines × 8) youtube_dl/options.py:151— youtube_dl/options.py:151-160 | youtube_dl/options.py:445-453 | youtube_dl/options.py:618-626 | youtube_dl/options.py:658-667 | youtube_dl/options.py:675-683 | youtube_dl/options.py:764-773 | youtube_dl/options.py:796-805 | youtube_dl/options.py:830-838 — all 8 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/options.py:151` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (8–9 lines × 2) youtube_dl/extractor/arkena.py:66— youtube_dl/extractor/arkena.py:66-74 | youtube_dl/extractor/francetv.py:223-230 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
Duplicated block (8 lines × 5) youtube_dl/extractor/generic.py:2937— youtube_dl/extractor/generic.py:2937-2944 | youtube_dl/extractor/generic.py:2967-2975 | youtube_dl/extractor/generic.py:3063-3072 | youtube_dl/extractor/generic.py:3112-3128 | youtube_dl/extractor/generic.py:3153-3163 — all 5 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/generic.py:2937` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (7–8 lines × 3) youtube_dl/extractor/dplay.py:231— youtube_dl/extractor/dplay.py:231-238 | youtube_dl/extractor/generic.py:3572-3578 | REDACTED:96-102 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6–7 lines × 2) youtube_dl/extractor/nbc.py:377— youtube_dl/extractor/nbc.py:377-383 | youtube_dl/extractor/tiktok.py:108-113 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `youtube_dl/extractor/tiktok.py:108` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
Duplicated block (6 lines × 2) youtube_dl/extractor/pbs.py:635— youtube_dl/extractor/pbs.py:635-640 | youtube_dl/extractor/ted.py:261-266 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
Duplicated block (6 lines × 3) REDACTED:98— REDACTED:98-103 | youtube_dl/extractor/xfileshare.py:189-194 | youtube_dl/extractor/youporn.py:109-114 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from all 3 call sites, so a change lands once.
No structured logging — No logging or diagnostics emission found. This repository ships a binary its users launch rather than a service you operate, so there is no operator to page — but when a run fails on a user's machine, neither they nor you have anything to read.
Orphaned file youtube_dl/extractor/generic.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/YoutubeDL.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/casefold.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/bbc.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/jsinterp.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/vimeo.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/options.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/adobepass.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/extractors.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/pbs.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/orf.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/nrk.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/swfinterp.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/brightcove.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/facebook.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/soundcloud.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file REDACTED:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/peertube.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/npo.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/twitter.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Orphaned file youtube_dl/extractor/youporn.py:1— No one still active in this repository holds living knowledge of this file: everyone who made a meaningful change to it has gone quiet, or what the current team did to it (moves, reformatting, log-level or import edits, renames) never needed understanding it. If it breaks, no one currently understands it. Attach the read to the next change that touches it: have a second person review that change, and leave behind a short comment or test recording what the file is for.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/xvideos.py:87— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/xminus.py:46— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/xhamster.py:323— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/xhamster.py:351— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/xhamster.py:358— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/watchindianporn.py:52— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/teamtreehouse.py:132— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/teachable.py:192— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/teachable.py:269— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/tagesschau.py:215— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/tagesschau.py:282— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/steam.py:83— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/samplefocus.py:62— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/porncom.py:90— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/polskieradio.py:154— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/playvid.py:46— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/plays.py:34— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/pbs.py:497— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/njpwworld.py:92— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/metacafe.py:196— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/metacafe.py:265— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/massengeschmacktv.py:56— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/lifenews.py:222— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/fourtube.py:70— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Hand-rolled JSON/XML parsing via regex youtube_dl/extractor/facebook.py:345— A regex whose pattern encodes JSON/XML syntax is parsing a structured format by hand — malformed or differently-typed content (e.g. `"amount": "5"` as a string) silently mis-parses instead of failing validation. This Python code already uses a real parser in the same package; use it here too.
Duplicated predicate youtube_dl/extractor/pbs.py:636— `f.get('protocol') == 'm3u8' and f.get('vcodec') != 'none'` appears character-identically in 2 files — youtube_dl/extractor/pbs.py, youtube_dl/extractor/ted.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/plays.py:49— `info.get('thumbnail') or self._og_search_thumbnail(webpage)` appears character-identically in 2 files — youtube_dl/extractor/plays.py, youtube_dl/extractor/vbox7.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:72— `isinstance(e.cause, compat_HTTPError) and e.cause.code == 400` appears character-identically in 6 files — REDACTED, youtube_dl/extractor/dplay.py, youtube_dl/extractor/packtpub.py, youtube_dl/extractor/vidme.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/adn.py:158— `isinstance(e.cause, compat_HTTPError) and e.cause.code == 401` appears character-identically in 16 files — youtube_dl/extractor/adn.py, REDACTED, REDACTED, youtube_dl/extractor/crackle.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/dplay.py:220— `isinstance(e.cause, compat_HTTPError) and e.cause.code == 403` appears character-identically in 18 files — youtube_dl/extractor/dplay.py, REDACTED, youtube_dl/extractor/funimation.py, youtube_dl/extractor/hotstar.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/ign.py:39— `isinstance(e.cause, compat_HTTPError) and e.cause.code == 404` appears character-identically in 3 files — youtube_dl/extractor/ign.py, REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/brightcove.py:647— `isinstance(e.cause, compat_HTTPError) and e.cause.code in (401, 403)` appears character-identically in 2 files — youtube_dl/extractor/brightcove.py, youtube_dl/extractor/discovery.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/bbc.py:479— `isinstance(ee.cause, compat_HTTPError) and ee.cause.code == 404` appears character-identically in 3 files — youtube_dl/extractor/bbc.py, youtube_dl/extractor/npo.py, youtube_dl/extractor/rte.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:1939— `line.startswith('#') or not line.strip()` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/howstuffworks.py:43— `m3u8_url and determine_ext(m3u8_url) == 'm3u8'` appears character-identically in 2 files — youtube_dl/extractor/howstuffworks.py, youtube_dl/extractor/konserthusetplay.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/metacafe.py:239— `mimetype2ext(source.get('type')) or determine_ext(source_url)` appears character-identically in 2 files — youtube_dl/extractor/metacafe.py, youtube_dl/extractor/tweakers.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:394— `not cursor or not isinstance(cursor, compat_str)` appears character-identically in 2 files — REDACTED, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/philharmoniedeparis.py:75— `not format_url or format_url in format_urls` appears character-identically in 2 files — youtube_dl/extractor/philharmoniedeparis.py, youtube_dl/extractor/xhamster.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate REDACTED:131— `not items or not isinstance(items, list)` appears character-identically in 2 files — REDACTED, youtube_dl/extractor/younow.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/rutube.py:206— `not results or not isinstance(results, list)` appears character-identically in 2 files — youtube_dl/extractor/rutube.py, youtube_dl/extractor/spreaker.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/stv.py:48— `self._download_webpage(url, video_id, fatal=False) or ''` appears character-identically in 2 files — youtube_dl/extractor/stv.py, youtube_dl/extractor/vbox7.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/pbs.py:448— `self._og_search_description( webpage, default=None) or self._html_search_meta( 'description', webpage, default=None)` appears character-identically in 2 files — youtube_dl/extractor/pbs.py, youtube_dl/extractor/tvp.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/ivi.py:199— `self._og_search_description(webpage, default=None) or self._html_search_meta( 'description', webpage, 'description', default=None)` appears character-identically in 2 files — youtube_dl/extractor/ivi.py, youtube_dl/extractor/playtvak.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/generic.py:3572— `src_type == 'application/dash+xml' or ext == 'mpd'` appears character-identically in 2 files — youtube_dl/extractor/generic.py, youtube_dl/extractor/tv2dk.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/extractor/generic.py:3575— `src_type == 'application/x-mpegurl' or ext == 'm3u8'` appears character-identically in 2 files — youtube_dl/extractor/generic.py, youtube_dl/extractor/tv2dk.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
Duplicated predicate youtube_dl/YoutubeDL.py:786— `sys.version_info < (3, 0) and sys.platform == 'win32'` appears character-identically in 2 files — youtube_dl/YoutubeDL.py, REDACTED. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
D34 · Knowledge Freshness· Most significant orphaned file · ×3
Most significant orphaned file REDACTED:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file REDACTED:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Most significant orphaned file REDACTED:1— One of the orphaned files carrying the most lost knowledge — ranked by size weighted by the file's role in the codebase, the same weighting behind the score above, so core code outranks equally large plumbing. A reasonable place to start a read-through before the aggregate risk above bites.
Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 9 significant file(s) lose their only recent owner: REDACTED, REDACTED, REDACTED, youtube_dl/YoutubeDL.py, REDACTED, youtube_dl/jsinterp.py, youtube_dl/options.py, youtube_dl/downloader/common.py (+1 more). Pair on, review, or document these before any departure.
No ADRs found — No ADRs found. No recognised ADR directory (`docs/adr/`, `docs/decisions/`, `adr/`, `docs/rfcs/`, an `ADR0001/` folder, or their siblings) exists anywhere in this tree. What was searched, so you can tell an empty log from a search that missed one: every directory under the tree (build output, dependencies and VCS metadata excepted), for a document that is either any non-index page inside a recognised ADR directory, whatever its name and however deeply nested (`docs/adr/use-postgres.md`, `docs/adr/2024/0001-x.md`); or a file anywhere whose name is ADR-shaped (`0001-use-postgres.md`, `adr-012-caching.md`); or, when neither turned anything up, a document carrying the decision-record signature (an "Architecture Decision Record" heading, or Status / Context / Decision / Consequences as section headings). A decision log that clears none of these — unnumbered files outside any recognised directory, without those headings — is not seen by this check and this row is then wrong. If that is your case, say so rather than renaming anything; otherwise, consider recording architectural decisions in `docs/adr/`.
D26 · Project Cohesion· Projects may be oversized for their cohesion · ×1
Projects may be oversized for their cohesion — 1 of 1 project(s) overshoot their size bounds, lowering Project Cohesion to 0.0/10. The most over is `(repository root)` (142113 LoC, 1617 module-visible types across 7 directories). Review these for cohesion — draw the boundary inside the module first (group each responsibility into its own package or directory and keep the cross-boundary members non-public), since splitting a published package moves types between packages and breaks consumers.
D28 · Secrets (history)· Rotate the exposed credentials · ×1
Dormant codebase — 610 of 610 significant files have no living knowledge — the codebase as a whole is dormant, not 610 separate risks. Counted over 610 of the 863 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over. Re-engage owners or document before change.
No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M2 · Architecture documentation· No architecture diagram/doc · ×1
No architecture diagram/doc — No C4/Structurizr/PlantUML/Mermaid/Graphviz/D2 diagram, no drawn diagram named for the architecture, no file named `architecture` or `design` in any markup this check reads, and nothing in the README, docs or contributor guides that announces the shape — no `## Architecture` heading, no "architecture overview"/"high-level design" phrasing, no "the architecture is …" introduction, no guided code tour. A shape laid out in prose that never names itself as the architecture is not visible to this check, and neither is one kept outside the repository, so this row reports the absence of a re-findable shape document — not evidence that nobody wrote the shape down.
No src/ separation — Production code isn't grouped under a src/ folder — it's spread across several top-level directories, so there's no one place that says 'this is the product'.
README/code drift README.md:762— README.md links to `day|week|month|year`, but `day|week|month|year` does not exist. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
No SAST — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 20833 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
Silent fallback default on parse failure REDACTED:4657— `q` (in `qualities`) returns `-1` when `ValueError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
Appendix B — Reproduction & audit trail
Every external tool invocation behind a deep-scan dimension — the tool, its captured version, the exact command, how many findings it yielded, and a link to the retained raw output. To reproduce any finding: check out the same commit and run the command shown (repo-relative — never an absolute scratch path). The complete raw scanner output is retained verbatim under artifacts/raw/ (indexed in artifacts/raw/index.json); per-invocation exit codes and wall-clock durations are in sidecar.json — kept out of this table so the rendered report stays byte-identical across runs of the same commit.
none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
trivy: not applicable — No Infrastructure-as-Code or container manifests found (Dockerfile, Docker Compose, Terraform, Kubernetes/Helm, CloudFormation, ARM, Bicep, Ansible); nothing to scan.
disclosure: not applicable — No vulnerability-disclosure policy file found (SECURITY.md/.markdown/.rst/.txt at root or under .github/.forgejo/.gitea/docs, .well-known/security.txt). A coordinated-disclosure policy may live off-repo, so this is not evidenced rather than failed.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
none (no readable dependency manifest): not applicable — Not scored — no dependency manifest in a supported ecosystem was read for this repository. A gap in the analyzer's language coverage, NOT a finding that the repository is free of vulnerable dependencies (a Python pyproject.toml/requirements.txt (pip/uv/Poetry), a Swift Package.swift/Package.resolved, a Cargo manifest, a Go module (go.mod/go.sum), a Gradle version catalogue, a Maven POM, an sbt build (build.sbt), composer.json, package.json, a Dart pubspec.yaml, an Elixir mix.exs/mix.lock (Hex), a rebar.config / erlang.mk DEPS (Hex), a Ruby Gemfile/Gemfile.lock or .gemspec (Bundler/RubyGems) — not scanned yet).
0
—
Run 01a166c8-f04c-79e2-81ea-a7a9609ff90f · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.
Issues: 103 · Warnings: 667 · Recommendations: 677 — Appendix A · all findings · full markdown report.
Generated by Watchdog — deterministic code-health analysis. 23-10-2026 @ 03:23 UTC.
Downloadable artifacts
Machine-readable and reproducible from this commit + frozen rubric — drop them straight into a contract appendix, a CRA dossier, or a downstream SCA / VEX tool.