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

pypa/pipenv

Measured 16 November 2026, 16:51 UTC, at code version 7729c82

CAI score 62.3out of 100 At risk Down 1.5 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 medium codebase: 89,776 lines of product code in 2 projects, tests not counted · Estimated rebuild effort: about 1.0 person-years · Weakest lens: Maturity, 54.1

Findings by how serious they are

46 critical 446 serious 43 minor

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

This survey was produced by

Assert small markCanine Code Analyzer
Producer
Canine Development
Analyzer
Canine Code Analyzer engine 1.0.0
Measured
16 November 2026, 16:51 UTC

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

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

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

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

Executive summary

pypa/pipenv is rated At risk because critical security findings are open, most of them in the build pipeline. Its score is held back because the documentation refers to two things that don't exist. It scores 62.3 out of 100, which the At risk rating leaves unchanged.

Maturity, at 54.1, is the weakest lens and counts most in the score. The best first step is adding automated security scanning, worth about 6.0 points. Recording design decisions would lift Maturity itself, worth about 5.3 points. Raising Maturity to 70 would lift the score to about 66.6.

Twenty-four pipeline tools are referenced by a changeable name, so the build pipeline can be tampered with. Nine pipeline steps install packages that can change without warning, and five secrets can leak from the build pipeline. Pinning each tool to an exact version, pinning what the pipeline installs and limiting each secret to its own step would close these risks. Updating the vulnerable packages would fix the four packages with a known security hole, and the two places where the code runs text as code or as a command need a direct call instead.

The product code is 89,776 lines, about €140,000 to rebuild.

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

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

If Maturity rose from 54.1 to 70, the lowest score rated Strong, the score would rise from 62.3 to about 66.6.

Code composition: what the lines of code are
Product code 71%Tests 29%
New since the last survey: 66 findings

These 66 critical or serious findings weren't in the previous survey, on 4 November 2026.

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

Fixed since the last survey: 9 findings

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

  • God Classes · FileTooLong: _internal/exceptions.py pipenv/patched/pip/_internal/exceptions.py
  • Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) pipenv/patched/pip/_internal/commands/download.py
  • Code Duplication · Duplicated block (23 lines × 2) pipenv/routines/check.py
  • Explicit Debt · TodoComment pipenv/utils/markers.py
  • Explicit Debt · TodoComment pipenv/patched/pip/_internal/utils/pylock.py
  • Explicit Debt · TodoComment pipenv/patched/pip/_internal/utils/pylock.py
  • Explicit Debt · TodoComment pipenv/patched/pip/_internal/metadata/base.py
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
  • Dependency Vulnerabilities · High CVE: [GHSA redacted] REDACTED
Rebuild cost: about €140,000 · Estimate
Cost to rebuild€47,000 to €240,000, for 785 to 2,492 hours of work, about 1.0 person-years for 1 to 2 engineers
Difficulty of the problemStandard, judged from the kind of software and how it is built. Code that solves a harder problem, such as payments or medical bookings, costs more per line to write.
Quality factor×0.9 at a score of 62. Better code takes more work to write, so the factor is ×1.0 at a score of 70, lower below it and higher above it.
SizeMedium: 89,776 lines of product code
What it is notNot a quotation: nobody has offered to build it for that. Not a valuation: it says nothing about what the business is worth. Not a certified figure: no professional has signed it as one.

How the estimate is made: We price the hours a team would need to write this code again, at €60 to €95 an hour. Declarations and boilerplate are priced at a fast rate and logic at a slower one, and the logic is then multiplied by the difficulty of the problem and by the quality factor. The estimate can be about 30% off either way, and it moves most with the hourly rate and the difficulty. For this code, every line is priced as straight logic, which keeps the estimate on the low side.

Top priorities

The three actions that raise the score most for the work they take. The full ranked list is in the Roadmap.

1
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.
Raises the score by about 6.0 points · Medium effort · Security & performance tooling
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.
Raises the score by about 5.3 points · Medium effort · Architecture documentation
3
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.
Raises the score by about 1.9 points · Low effort · Bus Factor

Diagnosis: what the measurements show together

Each conclusion below combines several dimensions into one point that no single dimension shows, and lists the measurements it rests on.

Where the investment is most exposed · Value at risk
This code would cost about €140,000 to build again, about 1.0 person-years of work. Its weakest lens is Maturity, at 54.1 (Adequate). Maturity is about how well the project explains and looks after itself, which decides whether a new developer, or a new supplier, can take over. Because the weakest lens counts most in the score, work on Maturity also moves the score most.
Based on: the rebuild estimate · the Maturity grade · how much each lens counts
What to do: Start with the Maturity actions in Top priorities.
If you do one thing first · First action
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. Of all the actions in this report, it raises the score most for the work it takes: about 6.0 points for medium effort. 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 7.1 out of 10. Code at that level is slower to change than clean code, and we estimate the extra work at 2% to 5% on every change. The history of the code shows how much it changes: about 55,105 lines over the last 90 days, which is about 223,481 lines a year. At that pace, the extra work comes to an estimated 11.9 to 74.5 engineer-days a year, and it grows as more code changes.
How this is estimated: The number of changed lines is measured from the history of the code. The rest rests on two assumptions of our own: code scoring 8 out of 10 or more adds no extra work, and each point below 8 adds 2.5% to 5.6% to every change, never less than 2% to 5% and never more than 40% to 60% in all; and an engineer changes 150 to 400 lines in a day. The result is a range for planning, not a measurement.
Based on: Cyclomatic Complexity · Cognitive Complexity · Code Duplication · Cohesion (LCOM4) · the code's change history
What to do: Start with the files listed under Churn × Complexity Hotspots, which change often and are hard to read, because that is where the extra work is paid most often.

Architecture: which parts of the code depend on which

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

458 modules, with 534 dependencies between them. 5 loops run through 11 of the modules, marked above the diagonal.

The table shows the 40 modules with the most connections; 418 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.
uses →1 patched.pip._internal.build_env.base2 patched.pip._internal.cli.base_command3 patched.pip._internal.models.link4 patched.pip._internal.utils.misc5 patched.pip._vendor.packaging.version6 patched.pip._vendor.platformdirs.api7 patched.pip._vendor.rich.jupyter8 patched.pip._vendor.rich.measure9 patched.pip._vendor.rich.style10 patched.pip._vendor.urllib3.response11 project12 vendor.packaging13 vendor.plette.models.base14 patched.pip._vendor.packaging15 patched.pip._vendor.packaging.specifiers16 patched.pip._vendor.requests.models17 patched.pip._vendor.rich.console18 patched.pip._vendor.rich.text19 patched.pip._vendor.urllib3.connectionpool20 patched.pip._internal.exceptions._base21 patched.pip._internal.metadata.base22 patched.pip._vendor.urllib3.exceptions23 patched.pip._vendor.urllib3.poolmanager24 patched.pip._internal.req.req_install25 patched.pip._vendor.requests.adapters26 patched.pip._internal.distributions.base27 patched.pip._internal.exceptions28 patched.pip._internal.index.package_finder29 patched.pip._internal.network.session30 patched.pip._internal.resolution.resolvelib.base31 patched.pip._internal32 patched.pip._internal.cli.index_command33 patched.pip._internal.operations.prepare34 patched.pip._internal.req35 patched.pip._internal.utils36 patched.pip._internal.cli.req_command37 patched.pip._internal.operations38 patched.pip._internal.resolution.resolvelib.factory39 utils40 patched.pip._internal.resolution.resolvelib.candidates
1 patched.pip._internal.build_env.base
2 patched.pip._internal.cli.base_command
3 patched.pip._internal.models.link
4 patched.pip._internal.utils.misc
5 patched.pip._vendor.packaging.version
6 patched.pip._vendor.platformdirs.api
7 patched.pip._vendor.rich.jupyter
8 patched.pip._vendor.rich.measure
9 patched.pip._vendor.rich.style
10 patched.pip._vendor.urllib3.response
11 project
12 vendor.packaging
13 vendor.plette.models.base
14 patched.pip._vendor.packaging3
15 patched.pip._vendor.packaging.specifiers1
16 patched.pip._vendor.requests.models1
17 patched.pip._vendor.rich.console11
18 patched.pip._vendor.rich.text111
19 patched.pip._vendor.urllib3.connectionpool1
20 patched.pip._internal.exceptions._base2
21 patched.pip._internal.metadata.base11
22 patched.pip._vendor.urllib3.exceptions14
23 patched.pip._vendor.urllib3.poolmanager22
24 patched.pip._internal.req.req_install111
25 patched.pip._vendor.requests.adapters411
26 patched.pip._internal.distributions.base111
27 patched.pip._internal.exceptions1112122
28 patched.pip._internal.index.package_finder211
29 patched.pip._internal.network.session13212
30 patched.pip._internal.resolution.resolvelib.base111
31 patched.pip._internal113211
32 patched.pip._internal.cli.index_command11
33 patched.pip._internal.operations.prepare111111
34 patched.pip._internal.req1121
35 patched.pip._internal.utils111111
36 patched.pip._internal.cli.req_command1111
37 patched.pip._internal.operations11211
38 patched.pip._internal.resolution.resolvelib.factory1111121311
39 utils11111
40 patched.pip._internal.resolution.resolvelib.candidates344444
Uses a module listed above itPart of a loopThe module itself
1 patched.pip._internal.build_env.base2 patched.pip._internal.cli.base_command3 patched.pip._internal.models.link4 patched.pip._internal.utils.misc5 patched.pip._vendor.packaging.version6 patched.pip._vendor.platformdirs.api7 patched.pip._vendor.rich.jupyter8 patched.pip._vendor.rich.measure9 patched.pip._vendor.rich.style10 patched.pip._vendor.urllib3.response11 project12 vendor.packaging13 vendor.plette.models.base14 patched.pip._vendor.packaging15 patched.pip._vendor.packaging.specifiers16 patched.pip._vendor.requests.models17 patched.pip._vendor.rich.console18 patched.pip._vendor.rich.text19 patched.pip._vendor.urllib3.connectionpool20 patched.pip._internal.exceptions._base21 patched.pip._internal.metadata.base22 patched.pip._vendor.urllib3.exceptions23 patched.pip._vendor.urllib3.poolmanager24 patched.pip._internal.req.req_install25 patched.pip._vendor.requests.adapters26 patched.pip._internal.distributions.base27 patched.pip._internal.exceptions28 patched.pip._internal.index.package_finder29 patched.pip._internal.network.session30 patched.pip._internal.resolution.resolvelib.base31 patched.pip._internal32 patched.pip._internal.cli.index_command33 patched.pip._internal.operations.prepare34 patched.pip._internal.req35 patched.pip._internal.utils36 patched.pip._internal.cli.req_command37 patched.pip._internal.operations38 patched.pip._internal.resolution.resolvelib.factory39 utils40 patched.pip._internal.resolution.resolvelib.candidatespatched.pip._internal.build_env.base1patched.pip._internal.cli.base_command2patched.pip._internal.models.link3patched.pip._internal.utils.misc4patched.pip._vendor.packaging.version5patched.pip._vendor.platformdirs.api6patched.pip._vendor.rich.jupyter7patched.pip._vendor.rich.measure8patched.pip._vendor.rich.style9patched.pip._vendor.urllib3.response10project11vendor.packaging12vendor.plette.models.base13patched.pip._vendor.packaging14patched.pip._vendor.packaging.specifiers15patched.pip._vendor.requests.models16patched.pip._vendor.rich.console17patched.pip._vendor.rich.text18patched.pip._vendor.urllib3.connectionpool19patched.pip._internal.exceptions._base20patched.pip._internal.metadata.base21patched.pip._vendor.urllib3.exceptions22patched.pip._vendor.urllib3.poolmanager23patched.pip._internal.req.req_install24patched.pip._vendor.requests.adapters25patched.pip._internal.distributions.base26patched.pip._internal.exceptions27patched.pip._internal.index.package_finder28patched.pip._internal.network.session29patched.pip._internal.resolution.resolvelib.base30patched.pip._internal31patched.pip._internal.cli.index_command32patched.pip._internal.operations.prepare33patched.pip._internal.req34patched.pip._internal.utils35patched.pip._internal.cli.req_command36patched.pip._internal.operations37patched.pip._internal.resolution.resolvelib.factory38utils39patched.pip._internal.resolution.resolvelib.candidates403111111112111422111411111111212221113212111113211111111111121111111111111211111112131111111344444+418 more modules (most-connected shown)

At a glance — Code Health · 79.4 · Adequate · gated by D2 ·

At a glance — Architecture · 89.7 · Adequate · gated by D26 ·

At a glance — Maturity · 54.1 · Adequate · gated by M2 ·

At a glance — Readiness · 55.5 · Adequate · gated by P3 ·

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

At a glance — Performance · 88.6 · Strong ·

Security & Compliance — OWASP Top-10 mapping

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

OWASP categoryFindingsSeverity
A05:2025 — Injection59High / Critical
A03:2025 — Software Supply Chain Failures8High / Critical

Roadmap

Top priorities: Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing; 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; Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.

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

Do thisHelpsEffortDimension
Add a SAST step to CI running what this repository's stack ships: bandit, `semgrep --config=p/python`, or CodeQL's python pack — so a security regression fails the build instead of landing.+6.0 ptsMediumSecurity & performance tooling
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.+5.3 ptsMediumArchitecture documentation
Resolve the 1 Off-boarding risk finding(s) in Bus Factor.+1.9 ptsLowBus Factor
Nothing pauses a release for a human: publish as a draft release (or gate the release job on a protected tag/manual dispatch) so a bad build can be stopped before users can download it.+2.3 ptsMediumDeployment & Rollback
Reconcile the README with reality: docs/virtualenv.md names Python 3.10, but pyproject.toml:15 requires `requires-python = ">=3.11"`: the package does not install on Python 3.10; docs/dev/initiative-f-typed-design.md names Python 3.10 or later, but pyproject.toml:15 requires `requires-python = ">=3.11"`: the package does not install on Python 3.10.+1.9 ptsMediumDocumentation accuracy
Explain in the README how to run the tests. Add a section called Testing to the README in the repository's top folder, saying how to run the test suite.+1.5 ptsMediumDocumentation (README)
Resolve the 1 finding(s) in Folder & project structure.+0.9 ptsMediumFolder & project structure
Resolve the 20 Hotspot finding(s) in Churn × Complexity Hotspots — start with project.py (2), dependencies.py, pylock.py.+0.8 ptsHighChurn × Complexity Hotspots

File quality

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

FileScoreBandWorst signal
REDACTED2.0SlopDependency Vulnerabilities: Critical vulnerability: REDACTED
REDACTED2.4SlopStatic Analysis (SAST): High: REDACTED
REDACTED4.2MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.2MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.3MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.3MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.4MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.5MixedStatic Analysis (SAST): High: REDACTED
REDACTED4.9MixedStatic Analysis (SAST): Medium: REDACTED
REDACTED5.1MixedStatic Analysis (SAST): Medium: REDACTED
pipenv/utils/pylock.py6.0MixedExplicit Debt: TodoComment
pipenv/utils/pipfile.py6.0MixedExplicit Debt: HackComment
pipenv/patched/pip/_internal/req/req_uninstall.py6.0MixedExplicit Debt: FixmeComment
pipenv/patched/pip/_internal/req/req_file.py6.0MixedExplicit Debt: FixmeComment
pipenv/patched/pip/_internal/build_env/installer.py6.0MixedExplicit Debt: HackComment
pipenv/patched/pip/_internal/resolution/resolvelib/factory.py6.0MixedExplicit Debt: TodoComment
pipenv/patched/pip/_internal/locations/_distutils.py6.0MixedExplicit Debt: XxxComment
pipenv/project.py6.0MixedExplicit Debt: HackComment
REDACTED6.0MixedExplicit Debt: TodoComment
pipenv/environments.py6.0MixedExplicit Debt: HackComment

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

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

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

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

Could not be resolved — 13

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

Methodology & how to trust this report

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

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

What we checked — 49 dimensions across the health lenses
D1D2D3D4D6D13D14D15D16D17D19D26D27D28D29D30D31D34D35D36D37D43D44AX10AX3AX4AX6M1M2M3M4P1P10P2P3P4P6PF1PF3X12X13X19X23X25X27X28X3X30X4

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

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

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

Tools & methods

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

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

Every finding is locatable in findings.md. Run 01a1e545-a40d-7833-8a0b-308689bfdd23.

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

Run transparency — what happened this run

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

  • D8 Code Coverage — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Coverage NOT MEASURED: the Python half could not be measured — the pytest suite ran no test, so nothing was measured (no report). Coverage is excluded from the score rather than counted as a near-zero. This is OUR limitation, not a defect in the repo — a coverage step in CI (`--cov=`) shows coverage is measured in your own CI.
  • D11 Test Reliability — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Test source is present (.py) and this repository declares a Python test suite (repository root, 117 test files), but it was not re-run: no test result was produced. Not scored — this is a gap in the analyzer's language coverage, not a finding about this repository.
  • D12 Dependency Hygiene — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. This repository's 5 shipped Python distribution(s) across 2 manifest(s) WERE read; what went unanswered is the currency half, because it grades an EXACT pin against the newest release and every declaration here is a floor or a range — which installs the newest release it admits and so cannot be behind one. So pypi.org was never asked. This is a true statement about the repository, and the healthy one, NOT a gap on our side: no reader we could write would find a currency question here.
  • D19 Documentation Quality — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. Each ecosystem's manifests (what makes a folder runnable or a published package) need their own proof before D19 judges its units. Until then those folders' READMEs are judged only as documents (boilerplate, structure), never counted as complete.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D21 Naming Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. PREREGISTRATION version 20's fallback (adjudication D21-sample3-v3): this rule kind was adjudicated below the 95 % precision gate, so its candidates are counted here and not published, and the score covers only the acronym-spelling and awaitable-suffix rules. The kind returns as rows only after it shows a measured precision; this says nothing about whether these names are consistent.
  • D22 Internal API Consistency — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. D22 identifies the intentionally-exposed surface from `IsPackable` and `.Contracts` project names, MSBuild conventions read off the loaded project set. This target exposed no such projects, so the probe never ran; this says nothing about whether the repository has a public API. This repository commits no C#/VB source at all, so there was never an MSBuild project set to read these conventions off. That is OUR side and it is an ADMISSION gap, not an environment fault: it declares a published package (pyproject.toml), but no published-package marker D22 reads admitted any project here. D22 DOES collect the public API of every language in this tree, and admits a project only when its manifest makes that ecosystem's publication act in a form the marker recognises — so what is missing is not a collector but an admission rule for the publication act this repository makes, if it makes one. The remedy is a better discriminator for that marker — not a collector, and no change to the scan image can close it. The marker's rules are measured to refuse applications, so one refused repository is the rule working as calibrated; several are the evidence that it is too strict. For npm the surface is what a published package.json's entry points (exports, main, module, types) export, followed through the source; an entry that names build output the tree does not commit (dist/, build/) is not followed back to source, because only a tsconfig outDir/rootDir pair states that mapping and a bundler's input lives in executable configuration this engine does not evaluate.
  • D24 Comment Value — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Each source language's comment syntax, and the code a comment annotates in it, needs its own proof before D24 judges it. Until then those comments are left unread, not counted as clean.
  • AXB2 Runtime readiness — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. The image build failed, and its output does not match a cause we recognise. (rule: unrecognised-build-failure). The renderer reported: docker build failed (exit 1) —  - InvalidDefaultArgInFrom: Default value for ARG docker.io/python:${PYVERSION} results in empty or invalid base image name (line 2) Dockerfile:2 -------------------- 1 | ARG PYVERSION 2 | >>> FROM docker.io/python:${PYVERSION} 3 | 4 | ARG VERSION -------------------- ERROR: failed to solve: failed to parse stage name "docker.io/python:": invalid reference format; likely cause (not identified): the image build failed, and its output does not match a cause we recognise; runtime evidence skipped.
  • AXR1 Runtime accessibility — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. Render strategy: boot via Dockerfile (docker/Dockerfile). docker build failed (exit 1) —  - InvalidDefaultArgInFrom: Default value for ARG docker.io/python:${PYVERSION} results in empty or invalid base image name (line 2) Dockerfile:2 -------------------- 1 | ARG PYVERSION 2 | >>> FROM docker.io/python:${PYVERSION} 3 | 4 | ARG VERSION -------------------- ERROR: failed to solve: failed to parse stage name "docker.io/python:": invalid reference format; likely cause (not identified): the image build failed, and its output does not match a cause we recognise; runtime evidence skipped.
  • C1 Data Protection — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These personal data controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks personal data controls.
  • GD1 Unfinished & placeholder code — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • IC1 Incompleteness & stubs — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax, JavaScript/TypeScript, Java, Dart, Ruby, Scala and Rust source only, and this repository's Python is most of its product and is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.
  • M4 Documentation accuracy — measured, with a gap in what it reached — We measured this, but not all of it. What we did not reach is a gap on our side — a collector, parser or image we have not built yet — so the numbers on that dimension cover less than the repository, and the part left out is not evidence that it would have passed. M4 checks only the claim kinds adjudicated at or above 95 % precision: links and versions (PREREGISTRATION version 9), and artefact counts an order of magnitude off. Paths, command arguments, installs, environment variables, settings, projects, packages, routes, cd targets, infrastructure products and removed modules are read but not checked, and none of them is reported or counted.
  • P5 DR & Backup — not measured this run — This is a true statement about the repository that carries nothing for its owner to act on, so it is reported here rather than as a defect in their code. No backup/snapshot/replication config, RTO/RPO or restore-procedure documentation was found — and no production persistence was detected either (no data-access packages, no data-store services, no database resources), so there is nothing in this repository whose loss a DR control would recover. If this system's data lives in a platform or ops repo we can't see, that's where the DR evidence belongs.
  • S1 Web-Security Posture — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. These web-security controls are read from declarative annotations, request middleware, entity/column names and guard methods in a C# source model, and none was loaded on this run, so there was nothing to gather. That is a gap in this analyzer's language reach — not a finding that the repository lacks web-security controls.
  • X16 Unfloored truncation loop — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check's reader does not cover most of the languages this repository's product is written in. What it read is kept, but it is too small a share to grade the product by. That is a gap in this analyzer's language reach — not a finding about this repository.
  • X5 Nullable reference types — not measured this run — We could not measure this here. That is a gap on our side — a collector, parser or image we have not built yet — and it is neither a defect in this repository nor evidence that the check would have passed. This check reads C# syntax and MSBuild project configuration, TypeScript source and its tsconfig files, Java source and its package and module declarations, PHP source and its PHPStan and Psalm configuration, Dart source and its pubspec language version, Ruby source and its Sorbet and Steep configuration, Scala source and its build's explicit-nulls, WartRemover and Scalafix settings, Kotlin source, and Rust source only, and no C# was loaded, no TypeScript was found, and this repository's Python is not read yet, so it had nothing of this repository's product to read. That is a gap in this analyzer's language reach — not a finding that the repository is free of what this check looks for.

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

Limitations & what we did not check

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

Per-dimension blind spots

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

  • D1 Cyclomatic Complexity: Cyclomatic complexity counts branches statically — it cannot tell an essential decision tree from accidental tangle, nor see complexity that lives in data or configuration (large switch-case token tables, DSL lexers/parsers, data-as-code rule tables) rather than control flow: a tokenizer's many single-character cases read as high complexity though each branch is trivial.
  • D2 Cognitive Complexity: Cognitive-complexity heuristics approximate how hard code is to follow; genuine domain difficulty and well-named intent that eases reading are not captured.
  • D3 God Classes: "God class" is sized by members and responsibilities visible in the type — a deliberately broad facade over a coherent subsystem can read the same as an accidental grab-bag. For front-end JS the file-length check is cohesion-aware (a single-responsibility module — one class/IIFE — earns a 3× threshold), but cohesion is approximated from top-level declarations, not true dependency structure.
  • D4 Code Duplication: Duplication is token-similarity — an in-process token-stream comparison over sliding windows, with type-aware normalization — so it finds copy-paste, not semantic duplication expressed differently. Committed machine-written code (scaffolded migrations, designer/codegen output, protobuf/OpenAPI stubs, model snapshots) is EXCLUDED — its repetition is the tool's, not the team's — so the score reflects hand-written duplication only.
  • 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.
  • D13 Secret Scanning: Secret detection is signature- and entropy-based on the current tree — a secret that does not match a known pattern, or one already rotated, will not be flagged (a clean scan is "nothing matched", not "no secrets exist").
  • D14 License Compliance: License compatibility is checked against declared package metadata and a policy — mislabelled or missing license metadata, and obligations that depend on how you distribute, are not resolved here.
  • D15 Churn × Complexity Hotspots: Churn hotspots come from git history — a freshly imported or squashed repository has no churn signal, and recent rewrites can mask a historically risky file.
  • D16 Bus Factor: Bus-factor is a time-decayed model of commit attribution (who has recently, repeatedly worked a file), not comprehension — pairing, review and reading-without-committing spread knowledge it can't see; bot commits and shared accounts still distort it.
  • D17 Explicit Debt: Acknowledged-debt signals (TODO/FIXME, suppressions, dead code) are textual — undocumented debt that nobody marked, and debt that lives in design rather than annotations, is invisible. Committed machine-written code (scaffolded migrations, designer/codegen output, generated stubs) is excluded — it is never the team's dead code to delete.
  • D19 Documentation Quality: Documentation quality publishes two things only: a runnable or packaged unit with no example, and a multi-project root README that maps none of its parts. It does not judge clarity, and its other checks (overview, licence, boilerplate, structure, empty sections, XML-doc coverage) are withheld after adjudication: their candidates are counted in the card's gaps, not shown as rows. A false statement in a document is M4's; units are .NET projects only.
  • D26 Project Cohesion: Project focus is sized from members/namespaces per project — a project that is broad by deliberate design reads the same as one that has sprawled.
  • D27 Navigability: Indirection/navigability is structural — it measures hops to follow a call, not whether that indirection buys real flexibility or just ceremony.
  • D28 Secrets (history): Secret-history scanning sweeps the git log for known patterns — a secret that predates the available history, or never matched a signature, is not found (clean means "nothing matched in the history we can see").
  • D29 Static Analysis (SAST): SAST findings are pattern-based (semgrep) — it finds classes of bug it has rules for; logic flaws, auth/authorization gaps and issues needing runtime context are out of reach (and clean means "no rule matched").
  • D30 Dependency Vulnerabilities: CVE matching depends on accurate package/version metadata and on the advisory databases — a vulnerability with no published advisory, or in code not declared as a dependency, is not seen. Coverage needs a RESOLVED graph: an unpinned requirements.txt, or a pom without a resolved build, yields partial coverage rather than a clean verdict. An ecosystem the analyzer cannot scan is reported as unmeasured, never as clean.
  • D31 IaC & Container Security: IaC scanning checks Dockerfiles/Terraform/Kubernetes against best-practice rules — it cannot see the live cloud account, runtime configuration, or drift between the committed config and what is actually deployed.
  • D34 Knowledge Freshness: Freshness is decayed commit RECENCY, not comprehension — code read often but rarely committed reads as orphaned, and stable code that genuinely needs no changes is penalised the same as forgotten code; bot/squash commits distort it like the bus factor.
  • D35 Change Coupling: Change coupling is co-change in COMMITS — files split across separate commits, or coupled only through a shared config/build step, read as uncoupled, and a sweeping commit (rename/format) is excluded so it doesn't couple everything. It shows that files change together, not WHY: a high coupling can be a healthy cohesive pair as readily as a hidden leak.
  • D43 Malicious Dependencies: Only packages some vulnerability database has already NAMED as malicious are seen — a compromise published in the last hours, or never reported at all, is invisible here, and this dimension reading 10 is not evidence that a dependency is trustworthy. There is no typosquat or dependency-confusion analysis: a package nobody has reported is simply absent from the feeds. Coverage is the dependency scan's: an ecosystem that could not be scanned is disclosed as unmeasured, never as clean.
  • D44 Platform End-of-Life: The support table is FROZEN, so it goes out of date by losing RECALL: a release that ended support after the table was written is missed until the table is refreshed, and this dimension reading 10 is not evidence that a platform is current. Only platforms the repository DECLARES in a place this pass reads are seen — a runtime named only in a Dockerfile (D31's subject), in a CI workflow (D29's), or in a file this pass does not parse (go.mod, a Gemfile ruby directive) is invisible here, which is why a repository declaring none of them abstains rather than scoring. Only frameworks with a PUBLISHED support policy are tracked: React, Flask and Express publish none, so their age cannot be judged and their absence from a report is not a statement that they are supported.
  • AX10 Code composition: Role is inferred from namespace/folder convention, not semantics — a domain concept living in a folder named "Services" reads as application, and the split is lines-of-code, not business value. The business-logic-share score is a SOFT, FLOORED signal: it contributes to the Architecture lens but is floored at the Critical gate, so an infrastructure-heavy design (a gateway, an ETL, a driver) is legitimately low without being nuked to zero.
  • M4 Documentation accuracy: Documentation accuracy checks links, versions and artefact counts against the tree: other claims (paths, commands, settings, routes) are read but not checked, and it cannot run the onboarding or measure how long a real new joiner takes.
  • P4 Deployment & Rollback: Approval/branch-protection rules live in repository settings the scan cannot see — only their in-repo evidence (config files, workflows) is checked, so a control enforced purely in the host's settings reads as "not evidenced".
  • P6 Release Hygiene: Rollback/observability controls are inferred from repo artefacts (pipelines, dashboards-as-code) — controls configured in external tooling, with no in-repo trace, cannot be credited.

Dimensions

D1 · Cyclomatic Complexity6.7 / 10Adequate✓ Tool-verified

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

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

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

73 method(s) exceeded the cyclomatic complexity threshold of 15; the worst was dependencies.clean_resolved_dep at 44.

dependencies.clean_resolved_dep (cyclomatic 44)pipenv/utils/dependencies.py:333
dependencies.dependency_as_pip_install_line (cyclomatic 43)pipenv/utils/dependencies.py:527
LockedRequirement.from_install_requirement (cyclomatic 42)pipenv/resolver/schema.py:202
PylockFile.from_lockfile (cyclomatic 41)pipenv/utils/pylock.py:60
uv._translate (cyclomatic 38)REDACTED:595

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

What to do

  1. Bring the 73 bodies over 15 down to 15 or less in Cyclomatic Complexity — start with dependencies.clean_resolved_dep (cyclomatic 44), dependencies.dependency_as_pip_install_line (cyclomatic 43), LockedRequirement.from_install_requirement (cyclomatic 42). — 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 73 together lifts Cyclomatic Complexity from 6.7 to about 10.0/10, projected with the scoring formula itself and assuming each lands exactly at 15.

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

D2 · Cognitive Complexity2.9 / 10Weak✓ Tool-verified

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

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

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

157 method(s) exceeded the cognitive complexity threshold of 15; the worst was dependencies.dependency_as_pip_install_line at 106.

dependencies.dependency_as_pip_install_line (cognitive 106)pipenv/utils/dependencies.py:527
PylockFile.write (cognitive 87)pipenv/utils/pylock.py:486
PylockFile.from_lockfile (cognitive 84)pipenv/utils/pylock.py:60
autocompletion.autocomplete (cognitive 72)pipenv/patched/pip/_internal/cli/autocompletion.py:15
dependencies.clean_resolved_dep (cognitive 71)pipenv/utils/dependencies.py:333

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

What to do

  1. Bring the 8 bodies over 60 down to 60 or less in Cognitive Complexity — start with dependencies.dependency_as_pip_install_line (cognitive 106), PylockFile.write (cognitive 87), PylockFile.from_lockfile (cognitive 84). — 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 8 together lifts Cognitive Complexity from 2.9 to about 4.4/10, projected with the scoring formula itself and assuming each lands exactly at 60; a cleaner split scores higher.

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

D3 · God Classes9.0 / 10Strong✓ Tool-verified

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

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

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

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

FileTooLong: utils/dependencies.py · ×19pipenv/utils/dependencies.py

What to do

  1. Resolve the 19 FileTooLong finding(s) in God Classes — start with install.py (2), dependencies.py, REDACTED. — One of this dimension's main actionable groups (19 warning-level).

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

D4 · Code Duplication9.2 / 10Stronggated by 64 serious findings✓ Tool-verified

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

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

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

40 duplicated block group(s) detected. 1.9 % of the production lines (1,721 of 89,776) are in a reported copy. A further 24 rows report members as variants of one another; the share counts each copied line once, however many rows cite it.

Edited copy of a member (17 corresponding lines) · ×3pipenv/utils/locking.py:258
Duplicated block (13 lines × 2) · ×3pipenv/patched/pip/_internal/commands/download.py:99
Duplicated block (9 lines × 2) · ×3pipenv/resolver/schema.py:885
Duplicated block (8 lines × 2) · ×3pipenv/project.py:224
Edited copy of a member (11 corresponding lines) · ×2pipenv/resolver/pure_python_metadata.py:717

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

What to do

  1. Resolve the 3 Edited copy of a member (17 corresponding lines) finding(s) in Code Duplication — start with locking.py, compatibility_tags.py, bazaar.py. — One of this dimension's main actionable groups (3 warning-level).
  2. Resolve the 3 Duplicated block (13 lines × 2) finding(s) in Code Duplication — start with download.py, manifest_cache.py, check.py. — One of this dimension's main actionable groups (3 warning-level).
  3. Resolve the 3 Duplicated block (9 lines × 2) finding(s) in Code Duplication — start with schema.py, locking.py, pipfile.py. — One of this dimension's main actionable groups (3 warning-level).

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

D6 · Cohesion (LCOM4)9.8 / 10Stronggated by 3 serious findings✓ Tool-verified

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

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

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

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

3 of 180 classes have LCOM4 above 3.

Low cohesion: Link (LCOM4 5) · ×3pipenv/patched/pip/_internal/models/link.py:242

What to do

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

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

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

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

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

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

Secret scan ran and found no leaked secrets.

✓ On the Gold path — maintain.

Detailed fixes: d13_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d14_recommendation.md.

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

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

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

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

Top hotspots: pipenv/utils/dependencies.py (21×44=924); pipenv/utils/pylock.py (14×41=574); pipenv/routines/lock.py (13×36=468) Repeated repair below the complexity floor: pipenv/resolver/pure_python_sdist.py (6 of 11 changes were fixes)

Hotspot: pipenv/utils/dependencies.py · ×20pipenv/utils/dependencies.py:333
Repeated repair: pipenv/resolver/pure_python_sdist.pypipenv/resolver/pure_python_sdist.py:204

What to do

  1. Resolve the 20 Hotspot finding(s) in Churn × Complexity Hotspots — start with project.py (2), dependencies.py, pylock.py. — One of this dimension's main actionable groups (20 warning-level).
  2. Resolve the 1 Repeated repair finding(s) in Churn × Complexity Hotspots — start with pure_python_sdist.py. — 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.

D16 · Bus Factor8.1 / 10Strong✓ Tool-verified

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

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

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

35 source file(s) have their living knowledge concentrated in one author (≥90% of recent, decayed contribution). The largest is pipenv/resolver/pure_python_provider.py. Counted over 182 of the 243 production source files in this repository: the rest are under the ~2,400-byte size floor this dimension measures over.

Off-boarding risk: anonymized user #1

What to do

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

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

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

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

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

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

68 deducted task-comment markers across 89776 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 · ×45tests/unit/test_lockfile.py:16
FixmeComment · ×9pipenv/shells.py:176
HackComment · ×8pipenv/environments.py:11
XxxComment · ×6pipenv/patched/pip/_internal/configuration.py:359

What to do

  1. Resolve the 45 TodoComment finding(s) in Explicit Debt — start with lockfile.py (8), markers.py (6), base.py (3). — One of this dimension's main actionable groups (45 warning-level).
  2. Resolve the 9 FixmeComment finding(s) in Explicit Debt — start with base.py (3), shells.py, subversion.py. — One of this dimension's main actionable groups (9 warning-level).
  3. Resolve the 8 HackComment finding(s) in Explicit Debt — start with environments.py (3), project.py, pipfile.py. — One of this dimension's main actionable groups (8 warning-level).

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

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

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

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

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

1 of 1 documentation facets pass in full. 46 document(s) read across 1 unit(s).

✓ On the Gold path — maintain.

Detailed fixes: d19_recommendation.md.

D26 · Project Cohesion0.0 / 10Critical✓ Tool-verified

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

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

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

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

Projects may be oversized for their cohesionpyproject.toml:1

What to do

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

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

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

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d27_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d28_recommendation.md.

D29 · Static Analysis (SAST)0.3 / 10Critical✓ Tool-verified

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

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

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

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

59 finding(s): 0 critical, 42 high, 6 medium, 11 low. 24 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 2 file(s) — `docs/_templates/sidebarlogo.html` (line 19, line 23), `pipenv/patched/pip/_vendor/pygments/lexers/_mapping.py` — so no absence of findings in the named regions is evidence of anything; rows reported elsewhere in those files are real. Fix the syntax error (or exclude the file deliberately) and re-scan to cover them. Separately, one or more rules could not re-parse an embedded snippet in 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

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

What to do

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

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

D30 · Dependency Vulnerabilities9.4 / 10Adequategated by 4 critical findings✓ Tool-verified

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

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

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

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

REDACTED
REDACTED
REDACTED

What to do

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

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

D31 · IaC & Container Security10.0 / 10Exemplary○ Nothing flagged

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

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

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

trivy and checkov found no infrastructure-as-code or container misconfigurations.

✓ On the Gold path — maintain.

Detailed fixes: d31_recommendation.md.

D34 · Knowledge Freshness9.9 / 10Exemplary✓ Tool-verified

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

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

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

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

Orphaned file · ×2pipenv/utils/exceptions.py:1
Orphaned files with no living knowledge

✓ On the Gold path — maintain.

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

D35 · Change Coupling10.0 / 10Stronggated by 1 serious finding✓ Tool-verified

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

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

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

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

Strongest change-coupling: project.py↔toml.py 50%

Change coupling: project.py ↔ toml.pypipenv/project.py:1

What to do

  1. Resolve the 1 Change coupling finding(s) in Change Coupling — start with project.py. — One of this dimension's main actionable groups (1 warning-level).

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

D36 · Supply-chain Provenance & Signing7.5 / 10Strong✓ Tool-verified

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.

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

3/4 supply-chain integrity signals present (provenance, signing, SBOM, pinned actions).

REDACTED
REDACTED

What to do

  1. Resolve the 1 REDACTED finding(s) in Supply-chain Provenance & Signing. — One of this dimension's main actionable groups (1 warning-level).
  2. 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.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d37_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d43_recommendation.md.

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

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

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

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

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

✓ On the Gold path — maintain.

Detailed fixes: d44_recommendation.md.

Frontend & cross-cutting dimensions

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

AX10 · Code composition9.9 / 10Exemplary✓ Tool-verified

Other · Architecture — How the codebase splits by code ROLE — domain, application, infrastructure, test, generated. The significance map behind the knowledge/coupling weighting, and a DDD signal in its own right: a thin domain core under fat infrastructure is the anemic-domain smell, quantified. How each file's role is decided, because the split is only as good as that: a generated name or a build-output tree makes it Generated, a test project makes it Test, and otherwise the file's NAMESPACE and PATH words are matched against fixed vocabularies in a fixed ORDER — domain, then infrastructure, then application — so a file whose words hit two layers is counted under the earlier one. A production file matching none of them counts as application, so that share reads 'application or unclassified' rather than a measured application layer. Roles come from naming convention, never from what the code does. On this repository the split was taken from the source tree on disk rather than from a loaded .NET workspace, so a file's role is decided by its PATH segments alone — no declared namespace was available to add to the evidence — and generated output is excluded from the census entirely rather than counted as a generated share.

Method: Roslyn line-count by code ROLE: every source file classified Domain/Application/Infrastructure/Test/Generated by namespace + path convention (the shared CodeRoleClassifier), then significant lines summed per role. Deterministic; the advisory score is the business-logic (domain+application) share of production code.

Coverage: Population: ALL source files, each bucketed into ONE of five roles (Domain/Application/Infrastructure/Test/Generated) by namespace + path convention — a file whose layer isn't named in the convention falls to Application (the neutral default), and the split is line-count, not semantic depth or business value.

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

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

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

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

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

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

AX6 · Interface segregation9.7 / 10Exemplary✓ Tool-verified

Other · Architecture — Whether interfaces stay focused rather than fat — the Interface-Segregation principle (SOLID 'I').

Method: Roslyn scan: public interface declared-member counts (accessors fold into their property/event); fat-interface threshold (over 15 declared members) flagged per type. Each finding also reports the distinct-OPERATION count — members counted by name, so an overload group counts once — which decides whether it states the caller-side ISP harm or the implementer-side burden of an overload set. TypeScript: exported interfaces that declare behaviour, counted over their REQUIRED operations (method signatures and function-typed properties with no `?`, once per signature) — data-shape interfaces and ambient .d.ts declarations are outside the population; JavaScript declares no interfaces and is not applicable. Deterministic, type-level.

  • `BaseDistribution` declares 35 protocol members: `from_directory`, `from_metadata_file_contents`, `from_wheel`, `location`, `editable_project_location`, `installed_location`, `info_location`, `installed_by_distutils`, `installed_as_egg`, `installed_with_setuptools_egg_info`, `installed_with_dist_info`, `canonical_name`, `version`, `raw_version`, `setuptools_filename`, `direct_url`, `installer`, `requested`, `editable`, `local`, `in_usersite`, `in_site_packages`, `is_file`, `iter_distutils_script_names`, `read_text`, `iter_entry_points`, `metadata`, `metadata_dict`, `metadata_version`, `raw_name`, `requires_python`, `iter_dependencies`, `iter_raw_dependencies`, `iter_provided_extras`, `iter_declared_entries`. Counted over its public methods and properties, once per name — a `typing.Protocol` is satisfied structurally, so every one of them is an operation each implementer must provide and each consumer depends on; `_`-prefixed members, static methods and data attributes are not counted, and an `@overload` family is one operation. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — pipenv/patched/pip/_internal/metadata/base.py:100
  • `PlatformDirsABC` declares 27 abstract methods: `user_data_dir`, `site_data_dir`, `user_config_dir`, `site_config_dir`, `user_cache_dir`, `site_cache_dir`, `user_state_dir`, `site_state_dir`, `user_log_dir`, `site_log_dir`, `user_documents_dir`, `user_downloads_dir`, `user_pictures_dir`, `user_videos_dir`, `user_music_dir`, `user_desktop_dir`, `user_projects_dir`, `user_publicshare_dir`, `user_templates_dir`, `user_fonts_dir`, `user_preference_dir`, `user_bin_dir`, `site_bin_dir`, `user_applications_dir`, `site_applications_dir`, `user_runtime_dir`, `site_runtime_dir`. Counted over its `@abstractmethod`s (and abstract properties), once per name; concrete methods are helpers an implementer inherits, not a burden, and `_`-prefixed members are not counted. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces. — pipenv/patched/pip/_vendor/platformdirs/api.py:17

What to do

  • Split fat interfaces into focused role-interfaces so clients depend only on what they use.
M1 · Documentation (README)6.7 / 10Adequate✓ Tool-verified

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

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

What to do

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

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

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

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

What to do

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

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

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

  • Most of the production code is in directories of its own, but 1 application file(s) sit at the repository root beside the build and tooling files (`get-pipenv.py`).
M4 · Documentation accuracy6.0 / 10Adequate✓ Tool-verified

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

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

  • docs/virtualenv.md names Python 3.10, but pyproject.toml:15 requires `requires-python = ">=3.11"`: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/virtualenv.md:217
  • docs/dev/initiative-f-typed-design.md names Python 3.10 or later, but pyproject.toml:15 requires `requires-python = ">=3.11"`: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong. — docs/dev/initiative-f-typed-design.md:392

What to do

  • Reconcile the README with reality: docs/virtualenv.md names Python 3.10, but pyproject.toml:15 requires `requires-python = ">=3.11"`: the package does not install on Python 3.10; docs/dev/initiative-f-typed-design.md names Python 3.10 or later, but pyproject.toml:15 requires `requires-python = ">=3.11"`: the package does not install on Python 3.10.
P1 · CI/CD gates10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

P2 · Observability7.0 / 10Strong✓ Tool-verified

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

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

P3 · Security & performance tooling0.0 / 10Critical✓ Tool-verified

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

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

  • No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner. — REDACTED:27
  • `pyproject.toml` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`. — pyproject.toml:31

What to do

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

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

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

  • The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release. — REDACTED:34

What to do

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

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

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

PF1 · Benchmark discipline8.0 / 10Strong✓ Tool-verified

Readiness · Performance — Whether the code protects its performance with benchmarks — a benchmark suite, allocation/memory measurement, and (ideally) a CI gate. Presence is credited as a bonus, never a deduction.

Method: Repo + source scan: BenchmarkDotNet referenced (csproj/source), [Benchmark]/[MemoryDiagnoser] attribute counts, and a benchmark step in CI; off .NET, the same ladder over Go testing.B, Rust criterion/#[bench]/divan, JMH/kotlinx-benchmark, pytest-benchmark/asv/pyperf, tinybench/mitata/vitest bench/benchmark.js and Swift package-benchmark — scored as a bonus ladder (absence is neutral, never a deduction). Deterministic, presence detection.

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

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

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

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

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

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

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

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

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

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

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

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

X23 · Unguarded diagnostic materialisation7.5 / 10Strong✓ Tool-verified

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.

  • `debug` at line 550 is called with an argument built by `"…".join(req_to_install.extras)` (line 552), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — pipenv/patched/pip/_internal/resolution/legacy/resolver.py:550
  • `debug` at line 425 is called with an argument built by `"…".join(redact_auth_from_url(url) for url in index_urls)` (line 427), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on. — pipenv/patched/pip/_internal/index/collector.py:425

What to do

  • In Python, put the construction behind the logger's own check (`if logger.isEnabledFor(logging.DEBUG):`), or pass the collection itself with a `%s` placeholder (`logger.debug("Items %s", items)`) so the logging module renders it only when the record is emitted. The placeholder alone is not the fix when the argument is still built first: it defers the formatting, not a `json.dumps`, a `join` or a comprehension in the argument, and an f-string defers nothing at all.
X25 · Inert configuration knob10.0 / 10Exemplary○ Nothing flagged

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

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

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

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

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

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

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

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

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

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

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

  • `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter. (×27) — pipenv/utils/dependencies.py:98, pipenv/utils/pipfile.py:161, pipenv/utils/shell.py:155, …
  • 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. (×3) — pipenv/utils/prefetch.py:408, pipenv/resolver/main.py:345, pipenv/patched/pip/_internal/network/session.py:160

What to do

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

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

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

X4 · Structured logging10.0 / 10Exemplary○ Nothing flagged

Other · Code Health — Whether log calls use message templates (queryable) rather than interpolated strings.

Method: Roslyn syntax scan: every log call-site counted; interpolated-string first-argument violations flagged. Population is all log calls, not estimated. On a repository with no .NET source it reads JavaScript/TypeScript off the engine’s own token stream (test, vendored and minified paths not) with the same rule: a `trace`/`debug`/`info`/`warn`/`error`/`fatal`/`verbose`/`silly`/`http`/`log` call on a receiver named for a logger, in a package whose own or an enclosing `package.json` declares a logger that carries values as fields (pino, pino-http, nestjs-pino, Fastify, winston, bunyan, tslog, LogTape, roarr), whose first deciding argument is a template literal with substitutions; an object-literal fields argument is stepped over, a plain string message clears the call. Python is read the same way: a `debug`/`info`/`warning`/`error`/`exception`/`critical`/`log` call on a logger in a file that imports the standard library’s `logging` or structlog (loguru, which formats at the call, is not judged), whose message is a whole f-string with a non-constant field; a `%`-formatted, `.format()`-ed or concatenated message is not convicted, as in C#. PHP is read the same way: a PSR-3 level call (`emergency`…`debug`, `log`) on a logger (`$logger`, `$this->logger`, Laravel’s `Log::`, `logger()`, `\Drupal::logger()`) in a package whose `composer.json` requires a PSR-3 logger or a framework that hands one out (psr/log, Monolog, Laravel, Symfony, Drupal, CakePHP), or a file that imports one, whose message is a double-quoted string interpolating a variable; a single-quoted message clears the call, and `sprintf` or `.` concatenation is not convicted, as in C#. Dart is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on Sentry’s structured logger (`Sentry.logger`) whose message is a whole string literal interpolating a value (`$name`, `${…}`); the `Sentry.logger.fmt` template API clears the call. Dart that logs only through loggers with one message and no fields (package:logging, package:logger, talker, dart:developer) is not applicable rather than a reach gap. Ruby is read the same way: a `trace`/`debug`/`info`/`warn`/`error`/`fatal` call on the console gem’s `Console` (declared by a Gemfile, gemspec or Gemfile.lock, or required) or, where SemanticLogger, Ougai or dry-logger is declared or required, on a receiver named for a logger (`logger`, `@logger`, `Rails.logger`, `log`), whose first deciding argument is, as the whole argument, a double-quoted string interpolating a non-constant value (`#{…}`, `#@ivar`); a plain literal clears the call, keyword arguments are the fields, and a block, `%`-format or `+` concatenation is not convicted. Ruby that logs only through the standard Logger (Rails.logger) is not applicable rather than a reach gap. Deterministic.

Reference — by lens

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

LensScoreRatingImpact
Code Health79.4Adequate — gated by D2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Architecture89.7Adequate — gated by D26Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Maturity54.1Adequate — gated by M2Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Readiness55.5Adequate — gated by P3Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Security79.6Adequate — gated by D29Capped at Fair by a Critical contributor — resolve it before relying on this lens.
Performance88.6StrongStrongest area.
Unscored — 4 check(s) recorded observations but carry no score

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

  • P12 CI test-gate honesty — 1 observation(s) recorded · Reported, not scored — this card publishes what the CI gate does with the test inventory rather than grading it. The findings above are its output.
  • X10 Duplicated predicate — 6 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X6 Hand-rolled structured-format parsing — 1 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
  • X7 Silent fallback defaults — 7 observation(s) recorded · Advisory — this card reports evidence and never carries a score.
Not evidenced — 1 control(s) we could not find positive evidence for

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

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

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

  • AC1 Text alternatives — No web markup found — accessibility is not applicable to this repository.
  • AC2 Forms & labels — No web markup found — accessibility is not applicable to this repository.
  • AC3 Page structure — No web markup found — accessibility is not applicable to this repository.
  • AC4 Keyboard semantics — No web markup found — accessibility is not applicable to this repository.
  • AC5 ARIA correctness — No web markup found — accessibility is not applicable to this repository.
  • AC6 Visual & motion safety — No web markup found — accessibility is not applicable to this repository.
  • AX1 Captive dependencies — Not applicable: this repository's Python imports no dependency-injection container and defines no container of its own — nothing that both registers and resolves bindings, and nothing that names two lifetimes — so nothing holds one lifetime's instance while handing out another's.
  • AX2 Stateful singletons — No container singleton was found, so there is no shared instance for concurrent requests to race on. No function in this Python code is served by a threaded web framework (a Flask, Bottle or FastAPI route, a Django or Pyramid view), so no module is shared between request threads. TypeScript/JavaScript runs each process's requests on one event loop, so no two requests write a shared object at the same instant (interleaving across an await is a different defect).
  • AX5 Architecture & structure — not assessed — architecture style/structure is computed from a project graph (projects, types, module namespaces) that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • AX7 Slice cohesion — not applicable — not a vertical-slice architecture
  • AX8 Test isolation — no test/production split to check
  • AX9 CQS / query purity — no CQRS query handlers detected — query purity is not applicable to this codebase
  • AXB2 Runtime readiness — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.
  • AXR1 Runtime accessibility — docker build failed (exit 1) —  - InvalidDefaultArgInFrom: Default value for ARG docker.io/python:${PYVERSION} results in empty or invalid base image name (line 2) Dockerfile:2 -------------------- 1 | ARG PYVERSION 2 | >>> FROM docker.io/python:${PYVERSION} 3 | 4 | ARG VERSION -------------------- ERROR: failed to solve: failed to parse stage name "docker.io/python:": invalid reference format; likely cause (not identified): the image build failed, and its output does not match a cause we recognise; runtime evidence skipped This is a statement about this run, not a statement about your application: nothing here says the surface is inaccessible, only that it was never rendered.
  • C1 Data Protection — Not assessed: these personal data controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks personal data controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • C2 Access Controls — No access-control surface detected in the analyzed source — this repository registers no route and starts no server another machine can reach (no Flask/FastAPI/Starlette route, Django urlpatterns or class-based view, Tornado handler). Access control is therefore N/A here — a library or command-line tool is authorized by the application that serves it, not by itself. If this codebase grows request handlers, the dimension reactivates and a default-deny posture is expected then.
  • C3 Audit Trail — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential in a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or MongoEngine model, a migration or a SQL schema — and no database or data-store client (Django ORM, SQLAlchemy, psycopg, PyMongo, …) in the source either, so this repository keeps no sensitive data whose changes an audit trail would record. If it does (through a store configured outside this repository, for instance), the trail belongs to wherever that data is stored.
  • C4 Data Retention — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data whose lifetime a retention limit would bound.
  • C5 Data-Subject Rights — No personal data detected in a persisted data model — no PII-named field (email, first_name, date_of_birth, phone, …) or stored credential on a Django, SQLAlchemy, SQLModel, Peewee, Tortoise or mongoengine model, in a migration or in a SQL schema — and no database or data-store client (django.db, sqlalchemy, psycopg2, pymongo, sqlite3, …) imported either, so this repository keeps no personal data for a data subject to erase, export or consent over.
  • D10 Test Quality — ~37133 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.
  • D11 Test Reliability — Test reliability not included — the .py suite was found but not re-run
  • D12 Dependency Hygiene — Dependency currency not established — no declaration carries an exact pin to grade
  • D18 Solution Shape — D18 scores the shape of a .NET solution; this repository has no .NET solution or project files, so the dimension does not apply.
  • D20 ADR Quality — N/A — ADRs are expected on deployable products with a user-facing host, not consumed libraries; no ADR log is required here.
  • D21 Naming Consistency — D21 withholds its case and prefix conventions rows: 17 candidate(s) found and not reported.
  • D22 Internal API Consistency — The exposed public-API surface could not be collected — no C#/VB projects loaded.
  • D23 Boundary Type-Coupling — No bounded-context organisation was detected either — neither a context-shaped layout, nor 2+ sibling source directories each declaring an aggregate root, nor 2+ sibling projects each declaring an entity of their own or taking another project's integration events. Declaring this codebase's bounded contexts (≥2) would let cross-boundary type coupling be assessed. Declare them in `.codehealth/config.yaml` at the repository root (create it if absent), mapping each context name to the module-path or namespace prefixes that belong to it — e.g. `architecture:` → `contexts:` → `Billing: ["src/billing", "Acme.Billing"]`, `Catalog: ["src/catalog", "Acme.Catalog"]`.
  • D24 Comment Value — D24 reads C#, Visual Basic, TypeScript and JavaScript comments only; comments in this repository's .py source were not judged.
  • D25 ADR Conformance — no ADRs to check
  • D32 Data Compliance (PII/GDPR) — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.
  • D40 Network Egress Confinement — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.
  • D41 Kernel & Syscall Confinement — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.
  • D42 Runtime Threat Enforcement — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.
  • D5 Coupling — Not applicable — 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 measured — Python suite
  • DM1 Domain Modelling — not scored — this repository shows only 1 of the 3 signals this lens looks for (134 value object(s))
  • ED1 Event-Driven — not scored — this repository shows none of the 3 signals this lens looks for
  • ED5 Idempotency — no mutating command handlers or message consumers detected — idempotency check not applicable
  • ES1 Event Sourcing — not scored — this repository shows none of the 3 signals this lens looks for
  • GD1 Unfinished & placeholder code — no source files were read — this check reads C#, F#, JavaScript/TypeScript, Dart, Ruby, Scala, Rust and Java, and none was read for this repository's product. That is a limit of the analyzer, not a finding about your code.
  • IC1 Incompleteness & stubs — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • P7 Outbound HTTP resilience — not applicable — no HTTP server, API framework or worker entry point was found in the JavaScript/TypeScript, Python source, so there is no service whose uptime a failing dependency could take down
  • P8 Schema migrations — no ORM, schema-migration tool or schema auto-create was found in this repository's dependency manifests or source, so there is no database schema for this check to judge
  • P9 Domain vs controller coverage — coverage not measured: this check compares the coverage of the analyzer's own test run across the domain and web layers, and that run measured none here — Test coverage (D8) says why
  • PF2 Allocation hygiene — Not scored: this check counted allocation-aware idioms (Span, pools, stackalloc) per line, which describes what kind of code a repository is rather than whether it has an allocation problem, so it was withdrawn. Nothing here is a finding about your code.
  • S1 Web-Security Posture — Not assessed: these web-security controls are read from a source model (declarative annotations, request middleware, entity/column names, guard methods) that was not loaded for this repository — because the repository is written in a language this check does not yet model, or because its projects failed to load. Absence of an idiom this check recognises is NOT evidence that this repository lacks web-security controls: it may implement them entirely in its own ecosystem. This is a gap in the analyzer's language coverage, not a finding about this repository.
  • X1 Async correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X14 Bypassable address classification — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X15 Unvalidated length from an untrusted reader — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X16 Unfloored truncation loop — X16 reached only 0% of this repository's production lines — python (89,776 lines) was left unread. Not scored: a score over a minority of the product would be published as the whole of it.
  • X17 Uncapped recursion over a caller-supplied document — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X18 Disposal-pattern correctness — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X2 Cancellation propagation — no C# was loaded; this repository's Python was read, and no request in it can be cancelled by a caller — a Python request takes no token: asyncio cancels the task and trio or anyio the scope that made it, from outside the call, and requests, httpx, aiohttp and gRPC take a timeout, not a cancellation
  • X20 Mistyped argument guard — This check asks whether an argument guard reports an EMPTY value as a NULL one, which needs a language that throws a null-specific argument exception — .NET's ArgumentNullException, the JVM's NullPointerException, Dart's ArgumentError.notNull. This repository contains none of those languages: the ones it is written in have a single exception for a bad argument, so there is no pair of exceptions to confuse and nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X21 Side-effecting pattern guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X22 Contradicted release guard — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X24 Document value interpolated into markup unescaped — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X26 Unsynchronised callback handoff — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X29 Per-element action decided by a fixed element — not applicable — the code was read and holds no site of this kind, so there is nothing for this check to judge
  • X32 Type resolved by simple name across every loaded assembly — This check is about how a .NET program searches the assemblies loaded into its process for a type, and this repository contains no .NET source, so there is nothing here for it to assess. Not a gap in the analyzer and not a finding about your code.
  • X5 Nullable reference types — not analysed — these correctness checks read a source model that was not loaded for this repository, because the repository is written in a language this check does not yet model, or because its projects failed to load. This is a gap in the analyzer, not a finding about this repository
  • X9 Subsumed condition operand — Advisory — this card reports evidence and never carries a score, so there is nothing missing here.

Appendix A — Findings (grouped)

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

Critical — 46 finding(s)
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
D30 · Dependency Vulnerabilities · High CVE · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED
  • REDACTED
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D30 · Dependency Vulnerabilities · Critical vulnerability · ×1
  • REDACTED
Serious — 446 finding(s)
D17 · Explicit Debt · TodoComment · ×45
  • TodoComment tests/unit/test_lockfile.py:16 — # TODO(pylock):`` so they remain greppable for the 2027 — 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:463 — # TODO: Fix this whenever it gets sorted out (see https://github.com/pypa/pip/issues/5739)
  • TodoComment pipenv/project.py:347 — # TODO(pylock):`` tags for the 2027 follow-up. The orchestrator — 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 pipenv/project.py:443 — # TODO(pylock): pylock branch — will fold into the format-detection layer. — 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 pipenv/utils/lockfile.py:13 — # TODO(pylock):`` tags so they remain greppable for the 2027 — 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 pipenv/utils/lockfile.py:78 — # TODO(pylock):`` per the T_D.1 §8.1 maintainer sign-off; the — 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 pipenv/utils/lockfile.py:97 — # TODO(pylock): REDACTED location/existence accessors live here as — 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 pipenv/utils/lockfile.py:116 — # TODO(pylock): merge into a single ``exists`` once the format- — 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 pipenv/utils/lockfile.py:128 — # TODO(pylock): move to the future pylock subsystem. — 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 pipenv/utils/lockfile.py:166 — # TODO(pylock): format-detection seam. The pylock-vs-Pipfile.lock — 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 pipenv/utils/lockfile.py:196 — # TODO(pylock): format-detection seam — pylock fallback. — 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 pipenv/utils/lockfile.py:303 — # TODO(pylock): pylock side-write. Future redesign will move 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.
  • TodoComment pipenv/utils/markers.py:164 — # TODO: Rename this to something meaningful — 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 pipenv/utils/markers.py:217 — # TODO: Rename this to something meaningful — 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 pipenv/utils/markers.py:175 — # TODO: rename this to something meaningful — 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 pipenv/utils/markers.py:206 — # TODO: Check if this is used by anything public otherwise make it private — 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 pipenv/utils/markers.py:218 — # TODO: Add a deprecation decorator and deprecate this -- i'm sure it's used — 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 pipenv/utils/markers.py:472 — # TODO: Refactor this (reduce complexity) — 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 pipenv/utils/pylock.py:249 — # TODO(T_F.8): surface ``[tool.pipenv] resolver = "..."`` 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 pipenv/utils/settings.py:194 — # TODO(T_F.8)`` markers in those readers. — 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:283 — # TODO: use DirectUrl.equivalent when — 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 pipenv/patched/pip/_internal/configuration.py:39 — # TODO: Use StrEnum when Python 3.10 support is dropped. — 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 pipenv/patched/pip/_internal/utils/temp_dir.py:27 — # TODO: Use StrEnum when Python 3.10 support is dropped. — 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 pipenv/patched/pip/_internal/utils/compat.py:37 — # TODO: Remove the 3.10 fallback once pip drops Python 3.10 support. — 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 pipenv/patched/pip/_internal/utils/pylock.py:258 — # TODO: refactor - this is similar to req_file.get_file_content — 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.
  • + 20 more in this group — see findings.md.
X3 · Exception handling · Swallowed exception (caught, then discarded) · ×27
  • Swallowed exception (caught, then discarded) pipenv/utils/dependencies.py:98 — `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) pipenv/utils/pipfile.py:161 — `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) pipenv/utils/shell.py:155 — `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) pipenv/utils/shell.py:665 — `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) pipenv/utils/sources.py:201 — `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) pipenv/routines/audit.py:35 — `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) pipenv/routines/check.py:160 — `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) pipenv/routines/install.py:66 — `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) pipenv/routines/install.py:72 — `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) pipenv/routines/lock.py:99 — `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) pipenv/routines/lock.py:126 — `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) pipenv/routines/lock.py:139 — `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) pipenv/routines/lock.py:161 — `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) pipenv/routines/lock.py:171 — `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) pipenv/routines/lock.py:186 — `except Exception` takes every exception and records none of it — the body neither logs it, rethrows it, nor even names it, so the failure is discarded as completely as by an empty catch and only the substituted value survives. Log it through whatever this codebase already uses to report problems, narrow the catch to the exception this call can actually raise, or say in a comment on the catch why the failure genuinely cannot matter.
  • Swallowed exception (caught, then discarded) pipenv/routines/lock.py:196 — `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) pipenv/routines/lock.py:223 — `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) pipenv/routines/lock.py:227 — `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) pipenv/routines/lock.py:314 — `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) pipenv/routines/requirements.py:29 — `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) pipenv/routines/scan.py:242 — `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) pipenv/resolver/pep691.py:1078 — `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) pipenv/resolver/pep691.py:1085 — `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) pipenv/resolver/pure_python_metadata.py:769 — `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) pipenv/resolver/pure_python_metadata.py:775 — `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.
  • + 2 more in this group — see findings.md.
D15 · Churn × Complexity Hotspots · Hotspot · ×20
  • Hotspot: pipenv/utils/dependencies.py pipenv/utils/dependencies.py:333 — pipenv/utils/dependencies.py changed 21 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 44 in dependencies.clean_resolved_dep at line 333. 7 of those changes were fix/bug commits, and the other 14 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/utils/dependencies.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/utils/pylock.py pipenv/utils/pylock.py:60 — pipenv/utils/pylock.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 41 in PylockFile.from_lockfile at line 60. 5 of those changes were fix/bug commits, and the other 9 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/utils/pylock.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/lock.py pipenv/routines/lock.py:263 — pipenv/routines/lock.py changed 13 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 36 in lock.do_lock at line 263. 2 of those changes were fix/bug commits, and the other 11 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/lock.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:391 — REDACTED changed 18 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in Resolver.create at line 391. 5 of those changes were fix/bug commits, and the other 13 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05: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.
  • Hotspot: pipenv/utils/pipfile.py pipenv/utils/pipfile.py:976 — pipenv/utils/pipfile.py changed 14 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 29 in Pipfile.generate_entry at line 976. 1 of those changes was a fix/bug commit, and the other 13 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/utils/pipfile.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/install.py pipenv/routines/install.py:235 — pipenv/routines/install.py changed 15 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in install.handle_new_packages at line 235. 3 of those changes were fix/bug commits, and the other 12 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/install.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: REDACTED REDACTED:681 — REDACTED changed 12 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 28 in command.cli at line 681. 3 of those changes were fix/bug commits, and the other 9 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05: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.
  • Hotspot: pipenv/resolver/backends/pure_python.py pipenv/resolver/backends/pure_python.py:573 — pipenv/resolver/backends/pure_python.py changed 10 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in PurePythonBackend._translate_mapping at line 573. 3 of those changes were fix/bug commits, and the other 7 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/resolver/backends/pure_python.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/scan.py pipenv/routines/scan.py:341 — pipenv/routines/scan.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 27 in scan.do_scan at line 341. 3 of those changes were fix/bug commits, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/scan.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/uninstall.py pipenv/routines/uninstall.py:51 — pipenv/routines/uninstall.py changed 8 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 23 in uninstall.do_uninstall at line 51. 4 of those changes were fix/bug commits, and the other 4 changed it for other reasons — this file is under both repair and feature pressure. Before the next change lands here, make sure the area it touches is under test, then split that area out of the file so the following change is smaller than this one — a file this often edited pays the complexity back every time. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/uninstall.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/check.py pipenv/routines/check.py:262 — pipenv/routines/check.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 35 in check.do_check at line 262. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/check.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/utils/prefetch.py pipenv/utils/prefetch.py:67 — pipenv/utils/prefetch.py changed 6 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 26 in prefetch.prefetch_wheels at line 67. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/utils/prefetch.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/cli/options.py pipenv/cli/options.py:963 — pipenv/cli/options.py changed 9 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 17 in options.build_state at line 963. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/cli/options.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/requirements.py pipenv/routines/requirements.py:35 — pipenv/routines/requirements.py changed 7 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in requirements.generate_requirements at line 35. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/requirements.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/update.py pipenv/routines/update.py:688 — pipenv/routines/update.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 24 in update.upgrade at line 688. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/update.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/project.py pipenv/project.py:420 — pipenv/project.py changed 5 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 18 in Project.get_or_create_lockfile at line 420. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/project.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/utils/project.py pipenv/utils/project.py:61 — pipenv/utils/project.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 32 in project.ensure_project at line 61. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/utils/project.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/graph.py pipenv/routines/graph.py:12 — pipenv/routines/graph.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in graph.do_graph at line 12. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/graph.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/outdated.py pipenv/routines/outdated.py:49 — pipenv/routines/outdated.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 19 in outdated.do_outdated at line 49. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/outdated.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
  • Hotspot: pipenv/routines/audit.py pipenv/routines/audit.py:139 — pipenv/routines/audit.py changed 2 times in last 90 days, and the most complex body those changes touched has cyclomatic complexity 16 in audit.do_audit at line 139. Frequent change and high complexity in one file compound: schedule the next change to it to include carving out the part being edited, with the area under test before it moves. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/routines/audit.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D3 · God Classes · FileTooLong · ×19
  • FileTooLong: utils/dependencies.py pipenv/utils/dependencies.py — FileTooLong — 1351 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 851 over it, 2.70× 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 — 1340 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 840 over it, 2.68× 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: utils/pipfile.py pipenv/utils/pipfile.py — FileTooLong — 841 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 341 over it, 1.68× 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: utils/pylock.py pipenv/utils/pylock.py — FileTooLong — 833 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 333 over it, 1.67× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
  • FileTooLong: routines/install.py pipenv/routines/install.py — FileTooLong — 785 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 285 over it, 1.57× 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: commands/install.py pipenv/patched/pip/_internal/commands/install.py — FileTooLong — 759 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 259 over it, 1.52× 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: cli/cmdoptions.py pipenv/patched/pip/_internal/cli/cmdoptions.py — FileTooLong — 750 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 250 over it, 1.50× 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: index/package_finder.py pipenv/patched/pip/_internal/index/package_finder.py — FileTooLong — 736 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 236 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: cli/options.py pipenv/cli/options.py — FileTooLong — 708 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 208 over it, 1.42× 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: resolvelib/factory.py pipenv/patched/pip/_internal/resolution/resolvelib/factory.py — FileTooLong — 654 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 154 over it, 1.31× 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 — 602 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 102 over it, 1.20× 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 — 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20× 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 — 601 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 101 over it, 1.20× 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: req/req_install.py pipenv/patched/pip/_internal/req/req_install.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: REDACTED REDACTED — FileTooLong — 584 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 84 over it, 1.17× 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: install/wheel.py pipenv/patched/pip/_internal/operations/install/wheel.py — FileTooLong — 576 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 76 over it, 1.15× 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: operations/prepare.py pipenv/patched/pip/_internal/operations/prepare.py — FileTooLong — 568 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 68 over it, 1.14× 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: routines/update.py pipenv/routines/update.py — FileTooLong — 534 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 34 over it, 1.07× 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: utils/misc.py pipenv/patched/pip/_internal/utils/misc.py — FileTooLong — 511 significant lines (blank, comment-only and punctuation-only lines excluded). The bar is 500 significant lines; this is 11 over it, 1.02× the bar. To reduce it, split the file along the responsibilities already in it: move each cohesive group of declarations into its own sibling file in the same module or package, so no one file has to be read whole to change one of them.
D17 · Explicit Debt · FixmeComment · ×9
  • FixmeComment pipenv/shells.py:176 — # FIXME: This isn't necessarily the correct prompt. We should read the — 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 pipenv/patched/pip/_internal/vcs/subversion.py:60 — # FIXME: should we warn? — 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 pipenv/patched/pip/_internal/req/req_file.py:248 — # FIXME: it would be nice to keep track of the source — 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 pipenv/patched/pip/_internal/req/req_install.py:380 — # FIXME: Is there a better place to create the build_dir? (hg and bzr — 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 pipenv/patched/pip/_internal/req/req_uninstall.py:562 — # FIXME: need a test for this elif block — 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 pipenv/patched/pip/_internal/operations/prepare.py:750 — # FIXME: https://github.com/pypa/pip/issues/11943
  • FixmeComment pipenv/patched/pip/_internal/locations/base.py:16 — # FIXME doesn't account for venv linked to global site-packages — 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 pipenv/patched/pip/_internal/locations/base.py:60 — # FIXME: keep src in cwd for now (it is not a temporary folder) — 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 pipenv/patched/pip/_internal/build_env/base.py:92 — # FIXME: Consider direct URL? — 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.
D17 · Explicit Debt · HackComment · ×8
  • HackComment pipenv/environments.py:11 — # HACK: avoid REDACTED uses the wrong byte code files. — 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 pipenv/environments.py:73 — # HACK: Prevent invalid shebangs with Homebrew-installed Python: — 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 pipenv/environments.py:304 — # Hack because PIPENV_SHELL is actually something else. Internally this — 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 pipenv/project.py:198 — # Hack to skip this during pipenv run, or -r. — 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 pipenv/utils/pipfile.py:381 — # HACK: There is no good way to prepend a section to an existing — 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 pipenv/patched/pip/_internal/utils/logging.py:78 — # HACK: grab no_color attribute from a random handler console since — 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 pipenv/patched/pip/_internal/resolution/resolvelib/provider.py:70 — # HACK: Theoretically we should check whether this identifier is a valid — 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 pipenv/patched/pip/_internal/build_env/installer.py:62 — # HACK: --prefix shouldn't be necessary for venv environments, but — 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.
D17 · Explicit Debt · XxxComment · ×6
  • XxxComment pipenv/patched/pip/_internal/configuration.py:359 — # XXX: This is patched in the tests. — 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 pipenv/patched/pip/_internal/configuration.py:437 — # XXX: This is patched in the tests. — 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 pipenv/patched/pip/_internal/req/req_uninstall.py:590 — # XXX We use normalized_dist_location because dist_location my contain — 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 pipenv/patched/pip/_internal/operations/install/wheel.py:93 — # XXX RECORD hashes will need to be updated — 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 pipenv/patched/pip/_internal/metadata/base.py:234 — # XXX if the distribution is a zipped egg, location has a trailing / — 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 pipenv/patched/pip/_internal/locations/_distutils.py:166 — # XXX: In old virtualenv versions, sys.prefix can contain '..' components, — 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.
D29 · Static Analysis (SAST) · REDACTED · ×3
  • REDACTED
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (17 corresponding lines) · ×3
  • Edited copy of a member (17 corresponding lines) pipenv/utils/locking.py:258 — pipenv/utils/locking.py:258-274 | pipenv/utils/pipfile.py:471-490 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) pipenv/patched/pip/_internal/utils/compatibility_tags.py:29 — pipenv/patched/pip/_internal/utils/compatibility_tags.py:29-45 | pipenv/patched/pip/_internal/utils/compatibility_tags.py:49-65 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (17 corresponding lines) pipenv/patched/pip/_internal/vcs/bazaar.py:40 — pipenv/patched/pip/_internal/vcs/bazaar.py:40-56 | pipenv/patched/pip/_internal/vcs/subversion.py:282-301 — These two members are one piece of code written twice and then edited apart: 17 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (13 lines × 2) · ×3
  • Duplicated block (13 lines × 2) pipenv/patched/pip/_internal/commands/download.py:99 — pipenv/patched/pip/_internal/commands/download.py:99-112 | pipenv/patched/pip/_internal/commands/lock.py:113-125 — 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 `pipenv/patched/pip/_internal/commands/download.py:99` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just after the matched lines, `pipenv/patched/pip/_internal/commands/lock.py:127` calls `WheelCache` and `pipenv/patched/pip/_internal/commands/download.py:114` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (13 lines × 2) pipenv/resolver/manifest_cache.py:236 — pipenv/resolver/manifest_cache.py:236-249 | pipenv/resolver/pure_python_metadata.py:174-186 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (13 lines × 2) pipenv/routines/check.py:61 — pipenv/routines/check.py:61-73 | pipenv/routines/scan.py:146-158 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (9 lines × 2) · ×3
  • Duplicated block (9 lines × 2) pipenv/resolver/schema.py:885 — pipenv/resolver/schema.py:885-893 | pipenv/utils/locking.py:33-41 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (9 lines × 2) pipenv/utils/locking.py:266 — pipenv/utils/locking.py:266-274 | pipenv/utils/pipfile.py:482-490 — 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. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `pipenv/utils/pipfile.py:481` calls `tomlkit_value_to_python` and `pipenv/utils/locking.py:265` does not — after which the two agree again for 4 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (9 lines × 2) pipenv/utils/pipfile.py:359 — pipenv/utils/pipfile.py:359-367 | pipenv/utils/sources.py:208-216 — 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.
D4 · Code Duplication · Duplicated block (8 lines × 2) · ×3
  • Duplicated block (8 lines × 2) pipenv/project.py:224 — pipenv/project.py:224-231 | pipenv/utils/sources.py:101-108 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice.
  • Duplicated block (8 lines × 2) pipenv/project.py:447 — pipenv/project.py:447-454 | pipenv/project.py:465-472 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
  • Duplicated block (8 lines × 2) pipenv/project.py:213 — pipenv/project.py:213-220 | pipenv/utils/sources.py:90-97 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D6 · Cohesion (LCOM4) · Low cohesion · ×3
  • Low cohesion: Link (LCOM4 5) pipenv/patched/pip/_internal/models/link.py:242 — Link's methods fall into 5 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 5 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: InstallRequirement (LCOM4 4) pipenv/patched/pip/_internal/req/req_install.py:61 — InstallRequirement's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
  • Low cohesion: Container (LCOM4 4) pipenv/vendor/tomlkit/container.py:35 — Container's methods fall into 4 groups that share no field and call none of each other, against a bar of more than 3 for this run (LCOM4, configurable — your repository's bar is the one quoted here). Each group is a set of methods reachable from one another through shared fields or direct calls, so 4 groups means the type has that many internally-connected clusters with nothing tying them together. Types whose shape makes a high count expected — and which would otherwise dominate this list — are excluded before this row is raised, so this is a genuine split candidate rather than a metric reading. It is still a shape, not a defect: confirm the groups match responsibilities you can name before splitting.
X3 · Exception handling · Swallowed exception (empty catch) · ×3
  • Swallowed exception (empty catch) pipenv/utils/prefetch.py:408 — 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) pipenv/resolver/main.py:345 — 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) pipenv/patched/pip/_internal/network/session.py:160 — 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.
D30 · Dependency Vulnerabilities · Medium CVE · ×2
  • REDACTED
  • REDACTED
D4 · Code Duplication · Edited copy of a member (11 corresponding lines) · ×2
  • Edited copy of a member (11 corresponding lines) pipenv/resolver/pure_python_metadata.py:717 — pipenv/resolver/pure_python_metadata.py:717-727 | pipenv/resolver/pure_python_metadata.py:736-755 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (11 corresponding lines) pipenv/patched/pip/_internal/vcs/git.py:480 — pipenv/patched/pip/_internal/vcs/git.py:480-494 | pipenv/patched/pip/_internal/vcs/mercurial.py:148-158 — These two members are one piece of code written twice and then edited apart: 11 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (16 corresponding lines) · ×2
  • Edited copy of a member (16 corresponding lines) pipenv/patched/pip/_internal/resolution/resolvelib/candidates.py:97 — pipenv/patched/pip/_internal/resolution/resolvelib/candidates.py:97-112 | pipenv/patched/pip/_internal/resolution/resolvelib/candidates.py:118-134 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (16 corresponding lines) pipenv/patched/pip/_internal/operations/prepare.py:127 — pipenv/patched/pip/_internal/operations/prepare.py:127-142 | pipenv/utils/unpack.py:111-142 — These two members are one piece of code written twice and then edited apart: 16 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (10 corresponding lines) · ×2
  • Edited copy of a member (10 corresponding lines) pipenv/utils/dependencies.py:775 — pipenv/utils/dependencies.py:775-784 | pipenv/utils/dependencies.py:788-797 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
  • Edited copy of a member (10 corresponding lines) pipenv/patched/pip/_internal/build_env/venv.py:108 — pipenv/patched/pip/_internal/build_env/venv.py:108-117 | pipenv/patched/pip/_internal/build_env/virtual.py:96-114 — These two members are one piece of code written twice and then edited apart: 10 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (16 lines × 2) · ×2
  • Duplicated block (16 lines × 2) pipenv/routines/check.py:205 — pipenv/routines/check.py:205-220 | pipenv/routines/scan.py:283-298 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (16 lines × 2) pipenv/utils/pipfile.py:1176 — pipenv/utils/pipfile.py:1176-1191 | pipenv/utils/pipfile.py:1200-1215 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (10 lines × 2) · ×2
  • Duplicated block (10 lines × 2) pipenv/utils/pylock.py:413 — pipenv/utils/pylock.py:413-422 | pipenv/utils/pylock.py:430-439 — both copies are in the same file, so extract the 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, `pipenv/utils/pylock.py:428` calls `isinstance` and `pipenv/utils/pylock.py:412` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
  • Duplicated block (10 lines × 2) pipenv/utils/sources.py:176 — pipenv/utils/sources.py:176-185 | pipenv/utils/sources.py:188-197 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (6 lines × 2) · ×2
  • Duplicated block (6 lines × 2) REDACTED:373 — REDACTED:373-378 | REDACTED:421-426 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
  • Duplicated block (6 lines × 2) pipenv/resolver/main.py:168 — pipenv/resolver/main.py:168-173 | pipenv/resolver/schema.py:523-528 — 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.
D1 · Cyclomatic Complexity · dependencies.clean_resolved_dep (cyclomatic 44) · ×1
  • dependencies.clean_resolved_dep (cyclomatic 44) pipenv/utils/dependencies.py:333 — dependencies.clean_resolved_dep has cyclomatic complexity 44 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · dependencies.dependency_as_pip_install_line (cyclomatic 43) · ×1
  • dependencies.dependency_as_pip_install_line (cyclomatic 43) pipenv/utils/dependencies.py:527 — dependencies.dependency_as_pip_install_line 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.
D1 · Cyclomatic Complexity · LockedRequirement.from_install_requirement (cyclomatic 42) · ×1
  • LockedRequirement.from_install_requirement (cyclomatic 42) pipenv/resolver/schema.py:202 — LockedRequirement.from_install_requirement 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.
D1 · Cyclomatic Complexity · PylockFile.from_lockfile (cyclomatic 41) · ×1
  • PylockFile.from_lockfile (cyclomatic 41) pipenv/utils/pylock.py:60 — PylockFile.from_lockfile has cyclomatic complexity 41 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · uv._translate (cyclomatic 38) · ×1
  • uv._translate (cyclomatic 38) REDACTED:595 — uv._translate has cyclomatic complexity 38 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · lock.do_lock (cyclomatic 36) · ×1
  • lock.do_lock (cyclomatic 36) pipenv/routines/lock.py:263 — lock.do_lock 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.
D1 · Cyclomatic Complexity · pip.pip_install_deps (cyclomatic 36) · ×1
  • pip.pip_install_deps (cyclomatic 36) pipenv/utils/pip.py:18 — pip.pip_install_deps 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.
D1 · Cyclomatic Complexity · check.do_check (cyclomatic 35) · ×1
  • check.do_check (cyclomatic 35) pipenv/routines/check.py:262 — check.do_check 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.
D1 · Cyclomatic Complexity · lock._prefetch_index_manifests_if_enabled (cyclomatic 35) · ×1
  • lock._prefetch_index_manifests_if_enabled (cyclomatic 35) pipenv/routines/lock.py:46 — lock._prefetch_index_manifests_if_enabled 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.
D1 · Cyclomatic Complexity · virtualenv.ensure_python (cyclomatic 35) · ×1
  • virtualenv.ensure_python (cyclomatic 35) REDACTED:294 — virtualenv.ensure_python 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.
D1 · Cyclomatic Complexity · autocompletion.autocomplete (cyclomatic 34) · ×1
  • autocompletion.autocomplete (cyclomatic 34) pipenv/patched/pip/_internal/cli/autocompletion.py:15 — autocompletion.autocomplete 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.
D1 · Cyclomatic Complexity · dependencies.requirement_from_pipfile (cyclomatic 33) · ×1
  • dependencies.requirement_from_pipfile (cyclomatic 33) pipenv/utils/dependencies.py:1986 — dependencies.requirement_from_pipfile 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.
D1 · Cyclomatic Complexity · project.ensure_project (cyclomatic 32) · ×1
  • project.ensure_project (cyclomatic 32) pipenv/utils/project.py:61 — project.ensure_project has cyclomatic complexity 32 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · uv._parse_spec (cyclomatic 30) · ×1
  • uv._parse_spec (cyclomatic 30) REDACTED:326 — uv._parse_spec has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · dependencies.requirement_from_lockfile (cyclomatic 30) · ×1
  • dependencies.requirement_from_lockfile (cyclomatic 30) pipenv/utils/dependencies.py:1880 — dependencies.requirement_from_lockfile has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PylockFile.write (cyclomatic 30) · ×1
  • PylockFile.write (cyclomatic 30) pipenv/utils/pylock.py:486 — PylockFile.write has cyclomatic complexity 30 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Pipfile.generate_entry (cyclomatic 29) · ×1
  • Pipfile.generate_entry (cyclomatic 29) pipenv/utils/pipfile.py:976 — Pipfile.generate_entry has cyclomatic complexity 29 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · command.cli (cyclomatic 28) · ×1
  • command.cli (cyclomatic 28) REDACTED:681 — command.cli has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · LinkEvaluator.evaluate_link (cyclomatic 28) · ×1
  • LinkEvaluator.evaluate_link (cyclomatic 28) pipenv/patched/pip/_internal/index/package_finder.py:179 — LinkEvaluator.evaluate_link has cyclomatic complexity 28 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · UvBackend._resolve_in (cyclomatic 28) · ×1
  • UvBackend._resolve_in (cyclomatic 28) REDACTED:179 — UvBackend._resolve_in has cyclomatic complexity 28 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · RequirementCommand.get_requirements (cyclomatic 27) · ×1
  • RequirementCommand.get_requirements (cyclomatic 27) pipenv/patched/pip/_internal/cli/req_command.py:379 — RequirementCommand.get_requirements 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.
D1 · Cyclomatic Complexity · InstallCommand.run (cyclomatic 27) · ×1
  • InstallCommand.run (cyclomatic 27) pipenv/patched/pip/_internal/commands/install.py:549 — InstallCommand.run has cyclomatic complexity 27 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · subprocess.call_subprocess (cyclomatic 27) · ×1
  • subprocess.call_subprocess (cyclomatic 27) pipenv/patched/pip/_internal/utils/subprocess.py:59 — subprocess.call_subprocess 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.
D1 · Cyclomatic Complexity · install.handle_new_packages (cyclomatic 27) · ×1
  • install.handle_new_packages (cyclomatic 27) pipenv/routines/install.py:235 — install.handle_new_packages 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.
D1 · Cyclomatic Complexity · install.do_install_dependencies (cyclomatic 27) · ×1
  • install.do_install_dependencies (cyclomatic 27) pipenv/routines/install.py:764 — install.do_install_dependencies 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.
D1 · Cyclomatic Complexity · scan.do_scan (cyclomatic 27) · ×1
  • scan.do_scan (cyclomatic 27) pipenv/routines/scan.py:341 — scan.do_scan 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.
D1 · Cyclomatic Complexity · locations.get_scheme (cyclomatic 26) · ×1
  • locations.get_scheme (cyclomatic 26) pipenv/patched/pip/_internal/locations/__init__.py:228 — locations.get_scheme 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.
D1 · Cyclomatic Complexity · install.batch_install (cyclomatic 26) · ×1
  • install.batch_install (cyclomatic 26) pipenv/routines/install.py:951 — install.batch_install has cyclomatic complexity 26 (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.
D1 · Cyclomatic Complexity · Pipfile.add_packages_batch (cyclomatic 26) · ×1
  • Pipfile.add_packages_batch (cyclomatic 26) pipenv/utils/pipfile.py:1132 — Pipfile.add_packages_batch 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.
D1 · Cyclomatic Complexity · prefetch.prefetch_wheels (cyclomatic 26) · ×1
  • prefetch.prefetch_wheels (cyclomatic 26) pipenv/utils/prefetch.py:67 — prefetch.prefetch_wheels 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.
D1 · Cyclomatic Complexity · UninstallPathSet.from_dist (cyclomatic 25) · ×1
  • UninstallPathSet.from_dist (cyclomatic 25) pipenv/patched/pip/_internal/req/req_uninstall.py:506 — UninstallPathSet.from_dist has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · install.do_install_validations (cyclomatic 25) · ×1
  • install.do_install_validations (cyclomatic 25) pipenv/routines/install.py:588 — install.do_install_validations has cyclomatic complexity 25 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · dependencies.import_requirements (cyclomatic 25) · ×1
  • dependencies.import_requirements (cyclomatic 25) pipenv/utils/dependencies.py:1732 — dependencies.import_requirements has cyclomatic complexity 25 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · req_file.handle_option_line (cyclomatic 24) · ×1
  • req_file.handle_option_line (cyclomatic 24) pipenv/patched/pip/_internal/req/req_file.py:209 — req_file.handle_option_line has cyclomatic complexity 24 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PurePythonBackend._translate_mapping (cyclomatic 24) · ×1
  • PurePythonBackend._translate_mapping (cyclomatic 24) pipenv/resolver/backends/pure_python.py:573 — PurePythonBackend._translate_mapping 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.
D1 · Cyclomatic Complexity · update.upgrade (cyclomatic 24) · ×1
  • update.upgrade (cyclomatic 24) pipenv/routines/update.py:688 — update.upgrade 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.
D1 · Cyclomatic Complexity · Resolver.create (cyclomatic 24) · ×1
  • Resolver.create (cyclomatic 24) REDACTED:391 — Resolver.create 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.
D1 · Cyclomatic Complexity · uninstall.do_uninstall (cyclomatic 23) · ×1
  • uninstall.do_uninstall (cyclomatic 23) pipenv/routines/uninstall.py:51 — uninstall.do_uninstall has cyclomatic complexity 23 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · SubprocessBuildEnvironmentInstaller.install (cyclomatic 22) · ×1
  • SubprocessBuildEnvironmentInstaller.install (cyclomatic 22) pipenv/patched/pip/_internal/build_env/installer.py:50 — SubprocessBuildEnvironmentInstaller.install 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.
D1 · Cyclomatic Complexity · dependencies.parse_setup_file (cyclomatic 22) · ×1
  • dependencies.parse_setup_file (cyclomatic 22) pipenv/utils/dependencies.py:703 — dependencies.parse_setup_file has cyclomatic complexity 22 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · konami.Konami (cyclomatic 22) · ×1
  • konami.Konami (cyclomatic 22) docs/_static/konami.js:12 — konami.Konami has cyclomatic complexity 22 (threshold 15). Most of this is not in the body itself: 3 of the 22 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 85, 35, 119, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D1 · Cyclomatic Complexity · session.user_agent (cyclomatic 21) · ×1
  • session.user_agent (cyclomatic 21) pipenv/patched/pip/_internal/network/session.py:84 — session.user_agent has cyclomatic complexity 21 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · dependencies.find_package_name_from_directory (cyclomatic 21) · ×1
  • dependencies.find_package_name_from_directory (cyclomatic 21) pipenv/utils/dependencies.py:800 — dependencies.find_package_name_from_directory has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · PylockFile.from_pyproject (cyclomatic 21) · ×1
  • PylockFile.from_pyproject (cyclomatic 21) pipenv/utils/pylock.py:331 — PylockFile.from_pyproject has cyclomatic complexity 21 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · command.cmd_pylock (cyclomatic 20) · ×1
  • command.cmd_pylock (cyclomatic 20) REDACTED:550 — command.cmd_pylock has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Resolver.resolve (cyclomatic 20) · ×1
  • Resolver.resolve (cyclomatic 20) pipenv/patched/pip/_internal/resolution/resolvelib/resolver.py:79 — Resolver.resolve has cyclomatic complexity 20 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · dependencies.determine_package_name (cyclomatic 20) · ×1
  • dependencies.determine_package_name (cyclomatic 20) pipenv/utils/dependencies.py:973 — dependencies.determine_package_name has cyclomatic complexity 20 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · freeze.freeze (cyclomatic 19) · ×1
  • freeze.freeze (cyclomatic 19) pipenv/patched/pip/_internal/operations/freeze.py:30 — freeze.freeze has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Factory._report_single_requirement_conflict (cyclomatic 19) · ×1
  • Factory._report_single_requirement_conflict (cyclomatic 19) pipenv/patched/pip/_internal/resolution/resolvelib/factory.py:696 — Factory._report_single_requirement_conflict has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · graph.do_graph (cyclomatic 19) · ×1
  • graph.do_graph (cyclomatic 19) pipenv/routines/graph.py:12 — graph.do_graph has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · init.do_project_init (cyclomatic 19) · ×1
  • init.do_project_init (cyclomatic 19) pipenv/routines/init.py:114 — init.do_project_init has cyclomatic complexity 19 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · outdated.do_outdated (cyclomatic 19) · ×1
  • outdated.do_outdated (cyclomatic 19) pipenv/routines/outdated.py:49 — outdated.do_outdated has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · requirements.generate_requirements (cyclomatic 19) · ×1
  • requirements.generate_requirements (cyclomatic 19) pipenv/routines/requirements.py:35 — requirements.generate_requirements has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · update.get_modified_pipfile_entries (cyclomatic 19) · ×1
  • update.get_modified_pipfile_entries (cyclomatic 19) pipenv/routines/update.py:274 — update.get_modified_pipfile_entries has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · shell.find_python (cyclomatic 19) · ×1
  • shell.find_python (cyclomatic 19) pipenv/utils/shell.py:420 — shell.find_python has cyclomatic complexity 19 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · _distutils.distutils_scheme (cyclomatic 18) · ×1
  • _distutils.distutils_scheme (cyclomatic 18) pipenv/patched/pip/_internal/locations/_distutils.py:50 — _distutils.distutils_scheme 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.
D1 · Cyclomatic Complexity · _sysconfig.get_scheme (cyclomatic 18) · ×1
  • _sysconfig.get_scheme (cyclomatic 18) pipenv/patched/pip/_internal/locations/_sysconfig.py:128 — _sysconfig.get_scheme 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.
D1 · Cyclomatic Complexity · Resolver._add_requirement_to_set (cyclomatic 18) · ×1
  • Resolver._add_requirement_to_set (cyclomatic 18) pipenv/patched/pip/_internal/resolution/legacy/resolver.py:194 — Resolver._add_requirement_to_set 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.
D1 · Cyclomatic Complexity · Project.get_or_create_lockfile (cyclomatic 18) · ×1
  • Project.get_or_create_lockfile (cyclomatic 18) pipenv/project.py:420 — Project.get_or_create_lockfile 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.
D1 · Cyclomatic Complexity · scan.build_safety_check_options (cyclomatic 18) · ×1
  • scan.build_safety_check_options (cyclomatic 18) pipenv/routines/scan.py:16 — scan.build_safety_check_options 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.
D1 · Cyclomatic Complexity · resolver.venv_resolve_deps (cyclomatic 18) · ×1
  • resolver.venv_resolve_deps (cyclomatic 18) REDACTED:1940 — resolver.venv_resolve_deps 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.
D1 · Cyclomatic Complexity · options.build_state (cyclomatic 17) · ×1
  • options.build_state (cyclomatic 17) pipenv/cli/options.py:963 — options.build_state 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.
D1 · Cyclomatic Complexity · SessionCommandMixin._build_session (cyclomatic 17) · ×1
  • SessionCommandMixin._build_session (cyclomatic 17) pipenv/patched/pip/_internal/cli/index_command.py:87 — SessionCommandMixin._build_session 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.
D1 · Cyclomatic Complexity · uv._render_pyproject (cyclomatic 17) · ×1
  • uv._render_pyproject (cyclomatic 17) REDACTED:431 — uv._render_pyproject 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.
D1 · Cyclomatic Complexity · audit.build_audit_options (cyclomatic 17) · ×1
  • audit.build_audit_options (cyclomatic 17) pipenv/routines/audit.py:74 — audit.build_audit_options 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.
D1 · Cyclomatic Complexity · VenvLocator._which (cyclomatic 17) · ×1
  • VenvLocator._which (cyclomatic 17) pipenv/utils/venv_locator.py:387 — VenvLocator._which 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.
D1 · Cyclomatic Complexity · vendoring.packages_missing_licenses (cyclomatic 17) · ×1
  • vendoring.packages_missing_licenses (cyclomatic 17) REDACTED:387 — vendoring.packages_missing_licenses has cyclomatic complexity 17 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D1 · Cyclomatic Complexity · Setting.__init__ (cyclomatic 16) · ×1
  • Setting.__init__ (cyclomatic 16) pipenv/environments.py:103 — Setting.__init__ has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · Factory.get_installation_error (cyclomatic 16) · ×1
  • Factory.get_installation_error (cyclomatic 16) pipenv/patched/pip/_internal/resolution/resolvelib/factory.py:794 — Factory.get_installation_error has cyclomatic complexity 16 (threshold 15). To reduce it, split the body: these branches sit side by side rather than nested inside one another, so extracting each one on its own would leave a function per branch. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D1 · Cyclomatic Complexity · audit.do_audit (cyclomatic 16) · ×1
  • audit.do_audit (cyclomatic 16) pipenv/routines/audit.py:139 — audit.do_audit has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · dependencies.expansive_install_req_from_line (cyclomatic 16) · ×1
  • dependencies.expansive_install_req_from_line (cyclomatic 16) pipenv/utils/dependencies.py:1165 — dependencies.expansive_install_req_from_line has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · Resolver.resolve_constraints (cyclomatic 16) · ×1
  • Resolver.resolve_constraints (cyclomatic 16) REDACTED:848 — Resolver.resolve_constraints has cyclomatic complexity 16 (threshold 15). To reduce it, separate the cases: extract each independent branch into its own named function, and where the body has guards that only reject input, fold those into early returns at the top.
D1 · Cyclomatic Complexity · vendoring.vendor (cyclomatic 16) · ×1
  • vendoring.vendor (cyclomatic 16) REDACTED:317 — vendoring.vendor has cyclomatic complexity 16 (threshold 15). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D15 · Churn × Complexity Hotspots · Repeated repair · ×1
  • Repeated repair: pipenv/resolver/pure_python_sdist.py pipenv/resolver/pure_python_sdist.py:204 — pipenv/resolver/pure_python_sdist.py changed 11 times in last 90 days and 6 of those changes were fix/bug commits, so repair is the majority of this file's churn. Its max cyclomatic complexity is 12 (its worst body is pure_python_sdist._download_sdist at line 204), AT OR UNDER the 15 threshold, so this is deliberately not filed as a churn × complexity hotspot — the difficulty here is in the behaviour the file has to get right, not in its control flow, and refactoring it for complexity would be the wrong move. The repairs counted were: “Fix pure-python sdist hash check crash; memoize parsed manifests”; “fix: address remaining Phase VI review feedback”; “fix: add prefetch cleanup, update design doc, add sdist hash verification, document source limitation”; “fix: non-blocking executor shutdown on sdist timeout; fix _FakeSession mock”. Each one is a case this code did not handle. Before the next change lands here, check that every one of them is pinned by a test that fails without its fix; where the same area keeps coming back, the durable fix is usually at the interface that keeps being misused rather than at the line that was last corrected. Counted over 2026-08-16..2026-11-14, the 90 days ending at the analysed commit. Reproduce with `git log --since='2026-08-16 10:57:26 -05:00' --until='2026-11-14 10:57:26 -05:00' --full-history --no-merges -- pipenv/resolver/pure_python_sdist.py`: merges are excluded because a merge re-states changes already counted at their own commits, and history is NOT path-simplified because a change that reached the file through a merged branch is still a change to it. That command counts raw commits and can read HIGHER than this row, which counts a cherry-picked re-land, and a revert together with the commit it undoes, once each — a difference of several commits on a file whose history was re-landed or reverted inside the window.
D2 · Cognitive Complexity · dependencies.dependency_as_pip_install_line (cognitive 106) · ×1
  • dependencies.dependency_as_pip_install_line (cognitive 106) pipenv/utils/dependencies.py:527 — dependencies.dependency_as_pip_install_line has cognitive complexity 106 (threshold 15). Drivers by points: if/else 32 (84 pts), ternaries 3 (11 pts), boolean chains 9, loops 1 (2 pts) (nesting depth added 61). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · PylockFile.write (cognitive 87) · ×1
  • PylockFile.write (cognitive 87) pipenv/utils/pylock.py:486 — PylockFile.write has cognitive complexity 87 (threshold 15). Drivers by points: if/else 15 (46 pts), loops 13 (40 pts), error handling 1 (nesting depth added 58). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PylockFile.from_lockfile (cognitive 84) · ×1
  • PylockFile.from_lockfile (cognitive 84) pipenv/utils/pylock.py:60 — PylockFile.from_lockfile has cognitive complexity 84 (threshold 15). Drivers by points: if/else 27 (67 pts), loops 6 (9 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (nesting depth added 45). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · autocompletion.autocomplete (cognitive 72) · ×1
  • autocompletion.autocomplete (cognitive 72) pipenv/patched/pip/_internal/cli/autocompletion.py:15 — autocompletion.autocomplete has cognitive complexity 72 (threshold 15). Drivers by points: if/else 22 (48 pts), loops 7 (18 pts), boolean chains 5, error handling 1 (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.
D2 · Cognitive Complexity · dependencies.clean_resolved_dep (cognitive 71) · ×1
  • dependencies.clean_resolved_dep (cognitive 71) pipenv/utils/dependencies.py:333 — dependencies.clean_resolved_dep has cognitive complexity 71 (threshold 15). Drivers by points: if/else 31 (53 pts), boolean chains 7, error handling 2 (7 pts), loops 2 (3 pts), ternaries 1 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · virtualenv.ensure_python (cognitive 69) · ×1
  • virtualenv.ensure_python (cognitive 69) REDACTED:294 — virtualenv.ensure_python has cognitive complexity 69 (threshold 15). Drivers by points: if/else 26 (49 pts), error handling 4 (12 pts), boolean chains 8 (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.
D2 · Cognitive Complexity · lock.do_lock (cognitive 63) · ×1
  • lock.do_lock (cognitive 63) pipenv/routines/lock.py:263 — lock.do_lock has cognitive complexity 63 (threshold 15). Drivers by points: if/else 23 (41 pts), error handling 5 (10 pts), loops 4 (6 pts), boolean chains 4, ternaries 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dependencies.requirement_from_pipfile (cognitive 62) · ×1
  • dependencies.requirement_from_pipfile (cognitive 62) pipenv/utils/dependencies.py:1986 — dependencies.requirement_from_pipfile has cognitive complexity 62 (threshold 15). Drivers by points: if/else 20 (44 pts), ternaries 4 (10 pts), boolean chains 6, loops 2 (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.
D2 · Cognitive Complexity · install.handle_new_packages (cognitive 60) · ×1
  • install.handle_new_packages (cognitive 60) pipenv/routines/install.py:235 — install.handle_new_packages has cognitive complexity 60 (threshold 15). Drivers by points: if/else 12 (36 pts), ternaries 5 (7 pts), error handling 2 (6 pts), loops 2 (6 pts), boolean chains 5 (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.
D2 · Cognitive Complexity · update.get_modified_pipfile_entries (cognitive 60) · ×1
  • update.get_modified_pipfile_entries (cognitive 60) pipenv/routines/update.py:274 — update.get_modified_pipfile_entries has cognitive complexity 60 (threshold 15). Drivers by points: if/else 12 (51 pts), loops 3 (7 pts), boolean chains 2 (nesting depth added 43). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dependencies.requirement_from_lockfile (cognitive 59) · ×1
  • dependencies.requirement_from_lockfile (cognitive 59) pipenv/utils/dependencies.py:1880 — dependencies.requirement_from_lockfile has cognitive complexity 59 (threshold 15). Drivers by points: if/else 14 (28 pts), ternaries 9 (23 pts), boolean chains 6, loops 2 (nesting depth added 28). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Pipfile.add_packages_batch (cognitive 59) · ×1
  • Pipfile.add_packages_batch (cognitive 59) pipenv/utils/pipfile.py:1132 — Pipfile.add_packages_batch has cognitive complexity 59 (threshold 15). Drivers by points: if/else 11 (33 pts), loops 7 (20 pts), boolean chains 4, ternaries 1 (2 pts) (nesting depth added 36). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pip.pip_install_deps (cognitive 58) · ×1
  • pip.pip_install_deps (cognitive 58) pipenv/utils/pip.py:18 — pip.pip_install_deps has cognitive complexity 58 (threshold 15). Drivers by points: if/else 19 (35 pts), loops 6 (11 pts), boolean chains 7, ternaries 2 (5 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.
D2 · Cognitive Complexity · freeze.freeze (cognitive 57) · ×1
  • freeze.freeze (cognitive 57) pipenv/patched/pip/_internal/operations/freeze.py:30 — freeze.freeze has cognitive complexity 57 (threshold 15). Drivers by points: if/else 16 (46 pts), loops 5 (9 pts), boolean chains 2 (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.
D2 · Cognitive Complexity · LockedRequirement.from_install_requirement (cognitive 57) · ×1
  • LockedRequirement.from_install_requirement (cognitive 57) pipenv/resolver/schema.py:202 — LockedRequirement.from_install_requirement has cognitive complexity 57 (threshold 15). Drivers by points: if/else 26 (44 pts), boolean chains 11, ternaries 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.
D2 · Cognitive Complexity · dependencies.parse_setup_file (cognitive 57) · ×1
  • dependencies.parse_setup_file (cognitive 57) pipenv/utils/dependencies.py:703 — dependencies.parse_setup_file has cognitive complexity 57 (threshold 15). Drivers by points: if/else 9 (42 pts), loops 3 (8 pts), boolean chains 6, error handling 1 (nesting depth added 38). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · Pipfile.generate_entry (cognitive 55) · ×1
  • Pipfile.generate_entry (cognitive 55) pipenv/utils/pipfile.py:976 — Pipfile.generate_entry has cognitive complexity 55 (threshold 15). Drivers by points: if/else 23 (42 pts), ternaries 3 (7 pts), boolean chains 4, loops 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.
D2 · Cognitive Complexity · uv._translate (cognitive 53) · ×1
  • uv._translate (cognitive 53) REDACTED:595 — uv._translate has cognitive complexity 53 (threshold 15). Drivers by points: if/else 11 (21 pts), boolean chains 13, ternaries 5 (11 pts), loops 6 (8 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · project.ensure_project (cognitive 52) · ×1
  • project.ensure_project (cognitive 52) pipenv/utils/project.py:61 — project.ensure_project has cognitive complexity 52 (threshold 15). Drivers by points: if/else 20 (34 pts), boolean chains 13, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · command.cli (cognitive 51) · ×1
  • command.cli (cognitive 51) REDACTED:681 — command.cli has cognitive complexity 51 (threshold 15). Drivers by points: if/else 25 (44 pts), loops 2 (4 pts), boolean chains 2, error handling 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.
D2 · Cognitive Complexity · check.do_check (cognitive 51) · ×1
  • check.do_check (cognitive 51) pipenv/routines/check.py:262 — check.do_check has cognitive complexity 51 (threshold 15). Drivers by points: if/else 22 (30 pts), boolean chains 7, ternaries 3 (7 pts), error handling 2 (5 pts), loops 1 (2 pts) (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · install.do_install_dependencies (cognitive 49) · ×1
  • install.do_install_dependencies (cognitive 49) pipenv/routines/install.py:764 — install.do_install_dependencies has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (26 pts), boolean chains 10, ternaries 3 (9 pts), loops 2 (4 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.
D2 · Cognitive Complexity · lock._prefetch_index_manifests_if_enabled (cognitive 49) · ×1
  • lock._prefetch_index_manifests_if_enabled (cognitive 49) pipenv/routines/lock.py:46 — lock._prefetch_index_manifests_if_enabled has cognitive complexity 49 (threshold 15). Drivers by points: if/else 15 (23 pts), error handling 10 (13 pts), loops 7 (10 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.
D2 · Cognitive Complexity · PurePythonBackend._translate_mapping (cognitive 48) · ×1
  • PurePythonBackend._translate_mapping (cognitive 48) pipenv/resolver/backends/pure_python.py:573 — PurePythonBackend._translate_mapping has cognitive complexity 48 (threshold 15). Drivers by points: if/else 6 (20 pts), loops 5 (13 pts), boolean chains 8, ternaries 3 (5 pts), error handling 1 (2 pts) (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Resolver.create (cognitive 48) · ×1
  • Resolver.create (cognitive 48) REDACTED:391 — Resolver.create has cognitive complexity 48 (threshold 15). Drivers by points: if/else 17 (39 pts), loops 4 (7 pts), boolean chains 2 (nesting depth added 25). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dependencies.import_requirements (cognitive 47) · ×1
  • dependencies.import_requirements (cognitive 47) pipenv/utils/dependencies.py:1732 — dependencies.import_requirements has cognitive complexity 47 (threshold 15). Drivers by points: if/else 19 (40 pts), boolean chains 3, loops 3, 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.
D2 · Cognitive Complexity · RequirementCommand.get_requirements (cognitive 46) · ×1
  • RequirementCommand.get_requirements (cognitive 46) pipenv/patched/pip/_internal/cli/req_command.py:379 — RequirementCommand.get_requirements has cognitive complexity 46 (threshold 15). Drivers by points: if/else 15 (25 pts), loops 7 (12 pts), boolean chains 4, ternaries 1 (3 pts), error handling 1 (2 pts) (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · req_file.handle_option_line (cognitive 45) · ×1
  • req_file.handle_option_line (cognitive 45) pipenv/patched/pip/_internal/req/req_file.py:209 — req_file.handle_option_line has cognitive complexity 45 (threshold 15). Drivers by points: if/else 19 (39 pts), boolean chains 3, loops 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.
D2 · Cognitive Complexity · uv._parse_spec (cognitive 44) · ×1
  • uv._parse_spec (cognitive 44) REDACTED:326 — uv._parse_spec has cognitive complexity 44 (threshold 15). Drivers by points: if/else 18 (27 pts), ternaries 4 (9 pts), boolean chains 8 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uninstall.do_uninstall (cognitive 44) · ×1
  • uninstall.do_uninstall (cognitive 44) pipenv/routines/uninstall.py:51 — uninstall.do_uninstall has cognitive complexity 44 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 5 (10 pts), error handling 1 (3 pts), ternaries 3, boolean chains 1 (nesting depth added 22). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · subprocess.call_subprocess (cognitive 43) · ×1
  • subprocess.call_subprocess (cognitive 43) pipenv/patched/pip/_internal/utils/subprocess.py:59 — subprocess.call_subprocess has cognitive complexity 43 (threshold 15). Drivers by points: if/else 18 (28 pts), loops 4 (7 pts), ternaries 2 (4 pts), boolean chains 3, error handling 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · install.batch_install (cognitive 43) · ×1
  • install.batch_install (cognitive 43) pipenv/routines/install.py:951 — install.batch_install has cognitive complexity 43 (threshold 15). Drivers by points: if/else 12 (19 pts), loops 6 (12 pts), error handling 3 (7 pts), boolean chains 5 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · LinkEvaluator.evaluate_link (cognitive 42) · ×1
  • LinkEvaluator.evaluate_link (cognitive 42) pipenv/patched/pip/_internal/index/package_finder.py:179 — LinkEvaluator.evaluate_link has cognitive complexity 42 (threshold 15). Drivers by points: if/else 19 (31 pts), boolean chains 8, 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.
D2 · Cognitive Complexity · requirements.generate_requirements (cognitive 41) · ×1
  • requirements.generate_requirements (cognitive 41) pipenv/routines/requirements.py:35 — requirements.generate_requirements has cognitive complexity 41 (threshold 15). Drivers by points: if/else 13 (31 pts), loops 3 (5 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · scan.do_scan (cognitive 41) · ×1
  • scan.do_scan (cognitive 41) pipenv/routines/scan.py:341 — scan.do_scan has cognitive complexity 41 (threshold 15). Drivers by points: if/else 19 (25 pts), ternaries 3 (7 pts), boolean chains 5, error handling 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.
D2 · Cognitive Complexity · dependencies.find_package_name_from_directory (cognitive 41) · ×1
  • dependencies.find_package_name_from_directory (cognitive 41) pipenv/utils/dependencies.py:800 — dependencies.find_package_name_from_directory has cognitive complexity 41 (threshold 15). Drivers by points: if/else 12 (31 pts), loops 2 (5 pts), boolean chains 4, error handling 1 (nesting depth added 22). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · vendoring.packages_missing_licenses (cognitive 40) · ×1
  • vendoring.packages_missing_licenses (cognitive 40) REDACTED:387 — vendoring.packages_missing_licenses has cognitive complexity 40 (threshold 15). Drivers by points: if/else 12 (27 pts), loops 4 (11 pts), boolean chains 2 (nesting depth added 22). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · outdated.do_outdated (cognitive 36) · ×1
  • outdated.do_outdated (cognitive 36) pipenv/routines/outdated.py:49 — outdated.do_outdated has cognitive complexity 36 (threshold 15). Drivers by points: if/else 10 (25 pts), loops 7 (9 pts), boolean chains 2 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · update._clean_unused_dependencies (cognitive 36) · ×1
  • update._clean_unused_dependencies (cognitive 36) pipenv/routines/update.py:609 — update._clean_unused_dependencies has cognitive complexity 36 (threshold 15). Drivers by points: if/else 9 (29 pts), loops 2 (5 pts), boolean chains 2 (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.
D2 · Cognitive Complexity · update.upgrade (cognitive 36) · ×1
  • update.upgrade (cognitive 36) pipenv/routines/update.py:688 — update.upgrade has cognitive complexity 36 (threshold 15). Drivers by points: if/else 13 (23 pts), loops 4 (7 pts), boolean chains 5, 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.
D2 · Cognitive Complexity · PylockFile.from_pyproject (cognitive 36) · ×1
  • PylockFile.from_pyproject (cognitive 36) pipenv/utils/pylock.py:331 — PylockFile.from_pyproject has cognitive complexity 36 (threshold 15). Drivers by points: if/else 14 (27 pts), loops 5 (7 pts), error handling 1, ternaries 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · graph.do_graph (cognitive 35) · ×1
  • graph.do_graph (cognitive 35) pipenv/routines/graph.py:12 — graph.do_graph has cognitive complexity 35 (threshold 15). Drivers by points: if/else 14 (23 pts), error handling 3 (7 pts), loops 1 (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.
D2 · Cognitive Complexity · locations.get_scheme (cognitive 34) · ×1
  • locations.get_scheme (cognitive 34) pipenv/patched/pip/_internal/locations/__init__.py:228 — locations.get_scheme has cognitive complexity 34 (threshold 15). Drivers by points: if/else 12 (21 pts), boolean chains 11, 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.
D2 · Cognitive Complexity · command.cmd_pylock (cognitive 33) · ×1
  • command.cmd_pylock (cognitive 33) REDACTED:550 — command.cmd_pylock has cognitive complexity 33 (threshold 15). Drivers by points: if/else 11 (18 pts), error handling 6 (13 pts), boolean chains 2 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UninstallPathSet.from_dist (cognitive 33) · ×1
  • UninstallPathSet.from_dist (cognitive 33) pipenv/patched/pip/_internal/req/req_uninstall.py:506 — UninstallPathSet.from_dist has cognitive complexity 33 (threshold 15). Drivers by points: if/else 12 (17 pts), loops 5 (10 pts), error handling 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.
D2 · Cognitive Complexity · show.print_results (cognitive 32) · ×1
  • show.print_results (cognitive 32) pipenv/patched/pip/_internal/commands/show.py:181 — show.print_results has cognitive complexity 32 (threshold 15). Drivers by points: if/else 8 (15 pts), loops 5 (14 pts), ternaries 1 (2 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.
D2 · Cognitive Complexity · UvBackend._resolve_in (cognitive 32) · ×1
  • UvBackend._resolve_in (cognitive 32) REDACTED:179 — UvBackend._resolve_in has cognitive complexity 32 (threshold 15). Drivers by points: if/else 15 (20 pts), boolean chains 7, loops 4, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · markers.parse_marker_dict (cognitive 32) · ×1
  • markers.parse_marker_dict (cognitive 32) pipenv/utils/markers.py:473 — markers.parse_marker_dict has cognitive complexity 32 (threshold 15). Drivers by points: if/else 12 (28 pts), boolean chains 2, loops 1 (2 pts) (nesting depth added 17). To reduce it, flatten the nesting: this score is depth rather than breadth — most of its points come from checks stacked inside one another, so the work sits several levels in. Invert each enclosing check into an early exit (a return, or the language's equivalent) so the happy path stays at one level, and where a level cannot be exited early, lift the block it encloses into its own named function.
D2 · Cognitive Complexity · prefetch._pick_wheel (cognitive 32) · ×1
  • prefetch._pick_wheel (cognitive 32) pipenv/utils/prefetch.py:278 — prefetch._pick_wheel has cognitive complexity 32 (threshold 15). Drivers by points: if/else 7 (22 pts), loops 3 (6 pts), boolean chains 4 (nesting depth added 18). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · prefetch.prefetch_wheels (cognitive 31) · ×1
  • prefetch.prefetch_wheels (cognitive 31) pipenv/utils/prefetch.py:67 — prefetch.prefetch_wheels has cognitive complexity 31 (threshold 15). Drivers by points: if/else 14 (20 pts), boolean chains 5, error handling 3, loops 3 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · InstallCommand.run (cognitive 30) · ×1
  • InstallCommand.run (cognitive 30) pipenv/patched/pip/_internal/commands/install.py:549 — InstallCommand.run has cognitive complexity 30 (threshold 15). Drivers by points: if/else 18 (21 pts), boolean chains 7, error handling 2 (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.
D2 · Cognitive Complexity · InstallCommand._handle_target_dir (cognitive 30) · ×1
  • InstallCommand._handle_target_dir (cognitive 30) pipenv/patched/pip/_internal/commands/install.py:785 — InstallCommand._handle_target_dir has cognitive complexity 30 (threshold 15). Drivers by points: if/else 10 (26 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 17). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · vendoring.download_licenses (cognitive 30) · ×1
  • vendoring.download_licenses (cognitive 30) REDACTED:440 — vendoring.download_licenses has cognitive complexity 30 (threshold 15). Drivers by points: if/else 9 (26 pts), error handling 1 (2 pts), loops 2 (nesting depth added 18). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · install._reify_lazy_imports (cognitive 29) · ×1
  • install._reify_lazy_imports (cognitive 29) pipenv/patched/pip/_internal/commands/install.py:228 — install._reify_lazy_imports has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (15 pts), error handling 2 (6 pts), loops 3 (6 pts), boolean chains 2 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · project._parse_pip_conf_indexes (cognitive 29) · ×1
  • project._parse_pip_conf_indexes (cognitive 29) pipenv/project.py:76 — project._parse_pip_conf_indexes has cognitive complexity 29 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (7 pts), loops 3 (5 pts), boolean chains 2, error handling 1 (2 pts) (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · funktools.handle_remove_readonly (cognitive 29) · ×1
  • funktools.handle_remove_readonly (cognitive 29) REDACTED:390 — funktools.handle_remove_readonly has cognitive complexity 29 (threshold 15). Drivers by points: if/else 11 (24 pts), error handling 2 (4 pts), boolean chains 1 (nesting depth added 15). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Sources.get_hashes_from_remote_index_urls (cognitive 29) · ×1
  • Sources.get_hashes_from_remote_index_urls (cognitive 29) pipenv/utils/sources.py:141 — Sources.get_hashes_from_remote_index_urls has cognitive complexity 29 (threshold 15). Drivers by points: if/else 9 (23 pts), loops 2 (4 pts), boolean chains 1, error handling 1 (nesting depth added 16). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uv._render_pyproject (cognitive 28) · ×1
  • uv._render_pyproject (cognitive 28) REDACTED:431 — uv._render_pyproject has cognitive complexity 28 (threshold 15). Drivers by points: if/else 7 (14 pts), ternaries 2 (6 pts), boolean chains 4, loops 4 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · install.do_install_validations (cognitive 28) · ×1
  • install.do_install_validations (cognitive 28) pipenv/routines/install.py:588 — install.do_install_validations has cognitive complexity 28 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 9, error handling 3 (6 pts), ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Lockfile.get_requirements (cognitive 28) · ×1
  • Lockfile.get_requirements (cognitive 28) pipenv/utils/locking.py:492 — Lockfile.get_requirements has cognitive complexity 28 (threshold 15). Drivers by points: if/else 8 (14 pts), error handling 2 (6 pts), ternaries 2 (4 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.
D2 · Cognitive Complexity · Resolver.resolve_constraints (cognitive 28) · ×1
  • Resolver.resolve_constraints (cognitive 28) REDACTED:848 — Resolver.resolve_constraints has cognitive complexity 28 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 4, error handling 1 (2 pts), ternaries 1 (2 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.
D2 · Cognitive Complexity · VenvLocator._which (cognitive 28) · ×1
  • VenvLocator._which (cognitive 28) pipenv/utils/venv_locator.py:387 — VenvLocator._which has cognitive complexity 28 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 4 (10 pts), boolean chains 4 (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · show.search_packages_info (cognitive 27) · ×1
  • show.search_packages_info (cognitive 27) pipenv/patched/pip/_internal/commands/show.py:85 — show.search_packages_info has cognitive complexity 27 (threshold 15). Drivers by points: if/else 6 (13 pts), error handling 4 (8 pts), loops 2 (4 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.
D2 · Cognitive Complexity · auth.get_keyring_provider (cognitive 26) · ×1
  • auth.get_keyring_provider (cognitive 26) pipenv/patched/pip/_internal/network/auth.py:181 — auth.get_keyring_provider has cognitive complexity 26 (threshold 15). Drivers by points: if/else 7 (14 pts), error handling 3 (8 pts), loops 1 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Factory._report_single_requirement_conflict (cognitive 26) · ×1
  • Factory._report_single_requirement_conflict (cognitive 26) pipenv/patched/pip/_internal/resolution/resolvelib/factory.py:696 — Factory._report_single_requirement_conflict has cognitive complexity 26 (threshold 15). Drivers by points: if/else 13 (16 pts), boolean chains 6, 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.
D2 · Cognitive Complexity · shell._run_script_sequence (cognitive 26) · ×1
  • shell._run_script_sequence (cognitive 26) REDACTED:155 — shell._run_script_sequence has cognitive complexity 26 (threshold 15). Drivers by points: if/else 10 (21 pts), error handling 1 (4 pts), 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.
D2 · Cognitive Complexity · dependencies.get_constraints_from_deps (cognitive 26) · ×1
  • dependencies.get_constraints_from_deps (cognitive 26) pipenv/utils/dependencies.py:1522 — dependencies.get_constraints_from_deps has cognitive complexity 26 (threshold 15). Drivers by points: if/else 9 (23 pts), boolean chains 2, 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.
D2 · Cognitive Complexity · Resolver.resolve (cognitive 25) · ×1
  • Resolver.resolve (cognitive 25) pipenv/patched/pip/_internal/resolution/resolvelib/resolver.py:79 — Resolver.resolve has cognitive complexity 25 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 4, loops 2 (3 pts), error handling 2 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SubprocessBuildEnvironmentInstaller.install (cognitive 24) · ×1
  • SubprocessBuildEnvironmentInstaller.install (cognitive 24) pipenv/patched/pip/_internal/build_env/installer.py:50 — SubprocessBuildEnvironmentInstaller.install has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13, loops 6 (8 pts), boolean chains 2, ternaries 1 (nesting depth added 2). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · check.check_package_set (cognitive 24) · ×1
  • check.check_package_set (cognitive 24) pipenv/patched/pip/_internal/operations/check.py:60 — check.check_package_set has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (20 pts), loops 2 (3 pts), boolean chains 1 (nesting depth added 14). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · constructors.parse_req_from_line (cognitive 24) · ×1
  • constructors.parse_req_from_line (cognitive 24) pipenv/patched/pip/_internal/req/constructors.py:323 — constructors.parse_req_from_line has cognitive complexity 24 (threshold 15). Drivers by points: if/else 16 (20 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · unpacking._untar_without_filter (cognitive 24) · ×1
  • unpacking._untar_without_filter (cognitive 24) pipenv/patched/pip/_internal/utils/unpacking.py:323 — unpacking._untar_without_filter has cognitive complexity 24 (threshold 15). Drivers by points: if/else 7 (16 pts), error handling 2 (6 pts), boolean chains 1, loops 1 (nesting depth added 13). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PurePythonProvider.narrow_requirement_selection (cognitive 24) · ×1
  • PurePythonProvider.narrow_requirement_selection (cognitive 24) pipenv/resolver/pure_python_provider.py:940 — PurePythonProvider.narrow_requirement_selection has cognitive complexity 24 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (4 pts), error handling 1 (3 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · clean.remove_extraneous_packages (cognitive 24) · ×1
  • clean.remove_extraneous_packages (cognitive 24) pipenv/routines/clean.py:30 — clean.remove_extraneous_packages has cognitive complexity 24 (threshold 15). Drivers by points: if/else 9 (20 pts), loops 3, 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.
D2 · Cognitive Complexity · shell.find_python (cognitive 24) · ×1
  • shell.find_python (cognitive 24) pipenv/utils/shell.py:420 — shell.find_python has cognitive complexity 24 (threshold 15). Drivers by points: if/else 13 (18 pts), boolean chains 6 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · requirements._generate_requirements_from_pipfile (cognitive 23) · ×1
  • requirements._generate_requirements_from_pipfile (cognitive 23) pipenv/routines/requirements.py:127 — requirements._generate_requirements_from_pipfile has cognitive complexity 23 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 3 (5 pts), ternaries 2 (5 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dependencies.expansive_install_req_from_line (cognitive 23) · ×1
  • dependencies.expansive_install_req_from_line (cognitive 23) pipenv/utils/dependencies.py:1165 — dependencies.expansive_install_req_from_line has cognitive complexity 23 (threshold 15). Drivers by points: if/else 12 (19 pts), boolean chains 2, 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.
D2 · Cognitive Complexity · virtualenv.ensure_virtualenv (cognitive 23) · ×1
  • virtualenv.ensure_virtualenv (cognitive 23) REDACTED:217 — virtualenv.ensure_virtualenv has cognitive complexity 23 (threshold 15). Drivers by points: if/else 9 (16 pts), boolean chains 5, 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.
D2 · Cognitive Complexity · konami.Konami (cognitive 23) · ×1
  • konami.Konami (cognitive 23) docs/_static/konami.js:12 — konami.Konami has cognitive complexity 23 (threshold 15). Drivers by points: if/else 13 (16 pts), ternaries 3, boolean chains 2, loops 1 (2 pts) (nesting depth added 4). Most of this is not in the body itself: 2 of the 23 points are its own statements and the rest belongs to 6 function literals inside it that branch (lines 85, 35, 119, …). The decisions are inside those literals, which nothing outside this body can call, review or test on its own, so splitting the enclosing body is not the move available here. To reduce it, lift the literals' work into a named function or method at the enclosing scope and have each literal call it, then reduce whichever part then reads as the largest.
D2 · Cognitive Complexity · Environment.base_paths (cognitive 22) · ×1
  • Environment.base_paths (cognitive 22) REDACTED:150 — Environment.base_paths has cognitive complexity 22 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 2 (5 pts), boolean chains 3, loops 1 (3 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Environment.get_lib_paths (cognitive 22) · ×1
  • Environment.get_lib_paths (cognitive 22) REDACTED:358 — Environment.get_lib_paths has cognitive complexity 22 (threshold 15). Drivers by points: if/else 10 (20 pts), 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.
D2 · Cognitive Complexity · VenvBuildEnvironment.__init__ (cognitive 22) · ×1
  • VenvBuildEnvironment.__init__ (cognitive 22) pipenv/patched/pip/_internal/build_env/venv.py:33 — VenvBuildEnvironment.__init__ has cognitive complexity 22 (threshold 15). Drivers by points: ternaries 3 (9 pts), error handling 5 (7 pts), if/else 5 (6 pts) (nesting depth added 9). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · session.user_agent (cognitive 22) · ×1
  • session.user_agent (cognitive 22) pipenv/patched/pip/_internal/network/session.py:84 — session.user_agent has cognitive complexity 22 (threshold 15). Drivers by points: if/else 14 (18 pts), error handling 1 (2 pts), boolean chains 1, ternaries 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · Factory.get_installation_error (cognitive 22) · ×1
  • Factory.get_installation_error (cognitive 22) pipenv/patched/pip/_internal/resolution/resolvelib/factory.py:794 — Factory.get_installation_error has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (17 pts), loops 4, 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, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · update._process_package_args (cognitive 22) · ×1
  • update._process_package_args (cognitive 22) pipenv/routines/update.py:442 — update._process_package_args has cognitive complexity 22 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 2 (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.
D2 · Cognitive Complexity · dependencies.install_req_from_pipfile (cognitive 22) · ×1
  • dependencies.install_req_from_pipfile (cognitive 22) pipenv/utils/dependencies.py:1403 — dependencies.install_req_from_pipfile has cognitive complexity 22 (threshold 15). Drivers by points: if/else 13 (19 pts), error handling 1 (2 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.
D2 · Cognitive Complexity · req_uninstall.compress_for_output_listing (cognitive 21) · ×1
  • req_uninstall.compress_for_output_listing (cognitive 21) pipenv/patched/pip/_internal/req/req_uninstall.py:154 — req_uninstall.compress_for_output_listing has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 4 (7 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.
D2 · Cognitive Complexity · Factory.collect_root_requirements (cognitive 21) · ×1
  • Factory.collect_root_requirements (cognitive 21) pipenv/patched/pip/_internal/resolution/resolvelib/factory.py:553 — Factory.collect_root_requirements has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (19 pts), boolean chains 1, 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.
D2 · Cognitive Complexity · PipProvider.narrow_requirement_selection (cognitive 21) · ×1
  • PipProvider.narrow_requirement_selection (cognitive 21) pipenv/patched/pip/_internal/resolution/resolvelib/provider.py:123 — PipProvider.narrow_requirement_selection has cognitive complexity 21 (threshold 15). Drivers by points: if/else 8 (17 pts), loops 3 (4 pts) (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pylock._pylock_package_from_install_requirement (cognitive 21) · ×1
  • pylock._pylock_package_from_install_requirement (cognitive 21) pipenv/patched/pip/_internal/utils/pylock.py:33 — pylock._pylock_package_from_install_requirement has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (18 pts), ternaries 1 (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.
D2 · Cognitive Complexity · Project.get_or_create_lockfile (cognitive 21) · ×1
  • Project.get_or_create_lockfile (cognitive 21) pipenv/project.py:420 — Project.get_or_create_lockfile has cognitive complexity 21 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uv._fold_markers (cognitive 21) · ×1
  • uv._fold_markers (cognitive 21) REDACTED:699 — uv._fold_markers has cognitive complexity 21 (threshold 15). Drivers by points: if/else 4 (12 pts), loops 3 (6 pts), boolean chains 3 (nesting depth added 11). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · audit.do_audit (cognitive 21) · ×1
  • audit.do_audit (cognitive 21) pipenv/routines/audit.py:139 — audit.do_audit has cognitive complexity 21 (threshold 15). Drivers by points: if/else 12 (16 pts), boolean chains 2, ternaries 1 (2 pts), 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.
D2 · Cognitive Complexity · init.do_project_init (cognitive 21) · ×1
  • init.do_project_init (cognitive 21) pipenv/routines/init.py:114 — init.do_project_init has cognitive complexity 21 (threshold 15). Drivers by points: if/else 10 (11 pts), boolean chains 7, ternaries 2, loops 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Setting.__init__ (cognitive 20) · ×1
  • Setting.__init__ (cognitive 20) pipenv/environments.py:103 — Setting.__init__ has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (13 pts), ternaries 2 (3 pts), boolean chains 2, error handling 2 (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.
D2 · Cognitive Complexity · install._referenced_modules (cognitive 20) · ×1
  • install._referenced_modules (cognitive 20) pipenv/patched/pip/_internal/commands/install.py:181 — install._referenced_modules has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (12 pts), loops 3 (5 pts), ternaries 1 (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.
D2 · Cognitive Complexity · _distutils.distutils_scheme (cognitive 20) · ×1
  • _distutils.distutils_scheme (cognitive 20) pipenv/patched/pip/_internal/locations/_distutils.py:50 — _distutils.distutils_scheme has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (10 pts), boolean chains 7, error handling 1 (2 pts), loops 1 (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · wheel._install_wheel (cognitive 20) · ×1
  • wheel._install_wheel (cognitive 20) pipenv/patched/pip/_internal/operations/install/wheel.py:578 — wheel._install_wheel has cognitive complexity 20 (threshold 15). Drivers by points: if/else 9 (15 pts), loops 2 (3 pts), error handling 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · RequirementsFileParser._parse_and_recurse (cognitive 20) · ×1
  • RequirementsFileParser._parse_and_recurse (cognitive 20) pipenv/patched/pip/_internal/req/req_file.py:350 — RequirementsFileParser._parse_and_recurse has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (13 pts), ternaries 1 (4 pts), boolean chains 2, loops 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · funktools._wait_for_files (cognitive 20) · ×1
  • funktools._wait_for_files (cognitive 20) REDACTED:98 — funktools._wait_for_files has cognitive complexity 20 (threshold 15). Drivers by points: if/else 3 (9 pts), error handling 3 (7 pts), loops 2 (4 pts) (nesting depth added 12). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · funktools.set_write_bit (cognitive 20) · ×1
  • funktools.set_write_bit (cognitive 20) REDACTED:321 — funktools.set_write_bit has cognitive complexity 20 (threshold 15). Drivers by points: if/else 5 (8 pts), loops 4 (7 pts), error handling 1 (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.
D2 · Cognitive Complexity · internet.write_credentials_netrc (cognitive 20) · ×1
  • internet.write_credentials_netrc (cognitive 20) pipenv/utils/internet.py:232 — internet.write_credentials_netrc has cognitive complexity 20 (threshold 15). Drivers by points: if/else 8 (11 pts), error handling 3 (5 pts), ternaries 1 (2 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.
D2 · Cognitive Complexity · Resolver.collect_hashes (cognitive 20) · ×1
  • Resolver.collect_hashes (cognitive 20) REDACTED:961 — Resolver.collect_hashes has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (16 pts), boolean chains 3, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolver.venv_resolve_deps (cognitive 20) · ×1
  • resolver.venv_resolve_deps (cognitive 20) REDACTED:1940 — resolver.venv_resolve_deps has cognitive complexity 20 (threshold 15). Drivers by points: if/else 12 (14 pts), boolean chains 3, ternaries 3 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · virtualenv.do_create_virtualenv (cognitive 20) · ×1
  • virtualenv.do_create_virtualenv (cognitive 20) REDACTED:51 — virtualenv.do_create_virtualenv has cognitive complexity 20 (threshold 15). Drivers by points: if/else 11 (14 pts), ternaries 2 (6 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.
D2 · Cognitive Complexity · vendoring._ensure_package_in_requirements (cognitive 20) · ×1
  • vendoring._ensure_package_in_requirements (cognitive 20) REDACTED:222 — vendoring._ensure_package_in_requirements has cognitive complexity 20 (threshold 15). Drivers by points: if/else 6 (15 pts), loops 1 (3 pts), boolean chains 2 (nesting depth added 11). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · BuildEnvironment.check_requirements (cognitive 19) · ×1
  • BuildEnvironment.check_requirements (cognitive 19) pipenv/patched/pip/_internal/build_env/base.py:61 — BuildEnvironment.check_requirements has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (14 pts), loops 1 (2 pts), ternaries 1 (2 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · SessionCommandMixin._build_session (cognitive 19) · ×1
  • SessionCommandMixin._build_session (cognitive 19) pipenv/patched/pip/_internal/cli/index_command.py:87 — SessionCommandMixin._build_session has cognitive complexity 19 (threshold 15). Drivers by points: if/else 8 (9 pts), boolean chains 6, ternaries 3 (4 pts) (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · list.format_for_columns (cognitive 19) · ×1
  • list.format_for_columns (cognitive 19) pipenv/patched/pip/_internal/commands/list.py:327 — list.format_for_columns has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 3, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · _sysconfig.get_scheme (cognitive 19) · ×1
  • _sysconfig.get_scheme (cognitive 19) pipenv/patched/pip/_internal/locations/_sysconfig.py:128 — _sysconfig.get_scheme has cognitive complexity 19 (threshold 15). Drivers by points: if/else 12 (13 pts), boolean chains 4, loops 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.
D2 · Cognitive Complexity · RequirementPreparer._prepare_linked_requirement (cognitive 19) · ×1
  • RequirementPreparer._prepare_linked_requirement (cognitive 19) pipenv/patched/pip/_internal/operations/prepare.py:683 — RequirementPreparer._prepare_linked_requirement has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (13 pts), boolean chains 4, error handling 1 (2 pts) (nesting depth added 4). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · PurePythonBackend.resolve (cognitive 19) · ×1
  • PurePythonBackend.resolve (cognitive 19) pipenv/resolver/backends/pure_python.py:143 — PurePythonBackend.resolve has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 3 (4 pts), error handling 3, ternaries 1 (2 pts), boolean chains 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · uv._pipfile_context (cognitive 19) · ×1
  • uv._pipfile_context (cognitive 19) REDACTED:523 — uv._pipfile_context has cognitive complexity 19 (threshold 15). Drivers by points: if/else 4 (9 pts), loops 2 (5 pts), boolean chains 4, error handling 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · install._should_use_no_binary (cognitive 19) · ×1
  • install._should_use_no_binary (cognitive 19) pipenv/routines/install.py:110 — install._should_use_no_binary 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.
D2 · Cognitive Complexity · indexes.get_source_list (cognitive 19) · ×1
  • indexes.get_source_list (cognitive 19) pipenv/utils/indexes.py:118 — indexes.get_source_list has cognitive complexity 19 (threshold 15). Drivers by points: if/else 6 (11 pts), loops 2 (4 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · markers._format_pyspec (cognitive 19) · ×1
  • markers._format_pyspec (cognitive 19) pipenv/utils/markers.py:99 — markers._format_pyspec has cognitive complexity 19 (threshold 15). Drivers by points: if/else 9 (15 pts), boolean chains 2, error handling 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.
D2 · Cognitive Complexity · pylock._pylock_source_from_lockfile_entry (cognitive 19) · ×1
  • pylock._pylock_source_from_lockfile_entry (cognitive 19) pipenv/utils/pylock.py:1224 — pylock._pylock_source_from_lockfile_entry has cognitive complexity 19 (threshold 15). Drivers by points: if/else 10 (14 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Resolver._add_requirement_to_set (cognitive 18) · ×1
  • Resolver._add_requirement_to_set (cognitive 18) pipenv/patched/pip/_internal/resolution/legacy/resolver.py:194 — Resolver._add_requirement_to_set has cognitive complexity 18 (threshold 15). Drivers by points: if/else 9 (10 pts), boolean chains 7, error handling 1 (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · Factory._make_requirements_from_install_req (cognitive 18) · ×1
  • Factory._make_requirements_from_install_req (cognitive 18) pipenv/patched/pip/_internal/resolution/resolvelib/factory.py:500 — Factory._make_requirements_from_install_req has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (13 pts), ternaries 2 (4 pts), boolean chains 1 (nesting depth added 8). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolver.get_topological_weights (cognitive 18) · ×1
  • resolver.get_topological_weights (cognitive 18) pipenv/patched/pip/_internal/resolution/resolvelib/resolver.py:227 — resolver.get_topological_weights has cognitive complexity 18 (threshold 15). Drivers by points: loops 5 (10 pts), if/else 3 (8 pts) (nesting depth added 10). To reduce it, break up the iteration: give each loop body a named function, and split a multi-phase loop into one function per phase so no single body carries the whole pipeline.
D2 · Cognitive Complexity · PEP691Client._dispatch_response (cognitive 18) · ×1
  • PEP691Client._dispatch_response (cognitive 18) pipenv/resolver/pep691.py:936 — PEP691Client._dispatch_response has cognitive complexity 18 (threshold 15). Drivers by points: if/else 11 (14 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 5). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · dependencies.determine_package_name (cognitive 18) · ×1
  • dependencies.determine_package_name (cognitive 18) pipenv/utils/dependencies.py:973 — dependencies.determine_package_name has cognitive complexity 18 (threshold 15). Drivers by points: if/else 7 (9 pts), boolean chains 7, error handling 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · Resolver.clean_results (cognitive 18) · ×1
  • Resolver.clean_results (cognitive 18) REDACTED:1069 — Resolver.clean_results has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 2, error handling 1 (2 pts), loops 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · resolver._format_resolution_error (cognitive 18) · ×1
  • resolver._format_resolution_error (cognitive 18) REDACTED:227 — resolver._format_resolution_error has cognitive complexity 18 (threshold 15). Drivers by points: if/else 6 (9 pts), error handling 2 (3 pts), boolean chains 2, loops 2, ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · virtualenv.find_python_from_py_launcher (cognitive 18) · ×1
  • virtualenv.find_python_from_py_launcher (cognitive 18) REDACTED:514 — virtualenv.find_python_from_py_launcher has cognitive complexity 18 (threshold 15). Drivers by points: if/else 10 (15 pts), boolean chains 1, error handling 1, loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · options.build_state (cognitive 17) · ×1
  • options.build_state (cognitive 17) pipenv/cli/options.py:963 — options.build_state has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6, boolean chains 5, error handling 2 (4 pts), ternaries 2 (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.
D2 · Cognitive Complexity · RequirementError.__init__ (cognitive 17) · ×1
  • RequirementError.__init__ (cognitive 17) pipenv/exceptions.py:398 — RequirementError.__init__ has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (17 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.
D2 · Cognitive Complexity · Command._main (cognitive 17) · ×1
  • Command._main (cognitive 17) pipenv/patched/pip/_internal/cli/base_command.py:181 — Command._main has cognitive complexity 17 (threshold 15). Drivers by points: if/else 10 (12 pts), boolean chains 3, ternaries 1 (2 pts) (nesting depth added 3). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition.
D2 · Cognitive Complexity · MultiDomainBasicAuth._get_new_credentials (cognitive 17) · ×1
  • MultiDomainBasicAuth._get_new_credentials (cognitive 17) pipenv/patched/pip/_internal/network/auth.py:355 — MultiDomainBasicAuth._get_new_credentials has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (13 pts), boolean chains 4 (nesting depth added 4). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wheel._record_wheel_installation (cognitive 17) · ×1
  • wheel._record_wheel_installation (cognitive 17) pipenv/patched/pip/_internal/operations/install/wheel.py:519 — wheel._record_wheel_installation has cognitive complexity 17 (threshold 15). Drivers by points: error handling 3 (6 pts), loops 2 (6 pts), if/else 2 (4 pts), 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.
D2 · Cognitive Complexity · req.install_given_reqs (cognitive 17) · ×1
  • req.install_given_reqs (cognitive 17) pipenv/patched/pip/_internal/req/__init__.py:38 — req.install_given_reqs has cognitive complexity 17 (threshold 15). Drivers by points: if/else 6 (10 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Factory.find_candidates (cognitive 17) · ×1
  • Factory.find_candidates (cognitive 17) pipenv/patched/pip/_internal/resolution/resolvelib/factory.py:423 — Factory.find_candidates has cognitive complexity 17 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 2 (3 pts), error handling 1 (2 pts), boolean chains 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · audit.build_audit_options (cognitive 17) · ×1
  • audit.build_audit_options (cognitive 17) pipenv/routines/audit.py:74 — audit.build_audit_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 13, boolean chains 2, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · scan.build_safety_check_options (cognitive 17) · ×1
  • scan.build_safety_check_options (cognitive 17) pipenv/routines/scan.py:16 — scan.build_safety_check_options has cognitive complexity 17 (threshold 15). Drivers by points: if/else 12, boolean chains 3, loops 1 (2 pts) (nesting depth added 1). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D2 · Cognitive Complexity · update.do_update (cognitive 17) · ×1
  • update.do_update (cognitive 17) pipenv/routines/update.py:32 — update.do_update has cognitive complexity 17 (threshold 15). Drivers by points: if/else 9 (12 pts), boolean chains 3, ternaries 2 (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.
D2 · Cognitive Complexity · update.check_version_conflicts (cognitive 17) · ×1
  • update.check_version_conflicts (cognitive 17) pipenv/routines/update.py:190 — update.check_version_conflicts has cognitive complexity 17 (threshold 15). Drivers by points: if/else 5 (9 pts), error handling 3 (7 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.
D2 · Cognitive Complexity · funktools._find_icacls_exe (cognitive 17) · ×1
  • funktools._find_icacls_exe (cognitive 17) REDACTED:285 — funktools._find_icacls_exe has cognitive complexity 17 (threshold 15). Drivers by points: if/else 3 (8 pts), loops 2 (5 pts), error handling 1 (3 pts), boolean chains 1 (nesting depth added 10). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · locking.get_locked_dep (cognitive 17) · ×1
  • locking.get_locked_dep (cognitive 17) pipenv/utils/locking.py:44 — locking.get_locked_dep has cognitive complexity 17 (threshold 15). Drivers by points: if/else 4 (13 pts), boolean chains 2, loops 1 (2 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.
D2 · Cognitive Complexity · pylock._lockfile_source_from_pylock_package (cognitive 17) · ×1
  • pylock._lockfile_source_from_pylock_package (cognitive 17) pipenv/utils/pylock.py:1271 — pylock._lockfile_source_from_pylock_package has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (13 pts), boolean chains 2, ternaries 1 (2 pts) (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · VenvLocator.get_location (cognitive 17) · ×1
  • VenvLocator.get_location (cognitive 17) pipenv/utils/venv_locator.py:125 — VenvLocator.get_location has cognitive complexity 17 (threshold 15). Drivers by points: if/else 8 (15 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.
D2 · Cognitive Complexity · vendoring.vendor (cognitive 17) · ×1
  • vendoring.vendor (cognitive 17) REDACTED:317 — vendoring.vendor has cognitive complexity 17 (threshold 15). Drivers by points: boolean chains 7, if/else 4 (7 pts), loops 3 (nesting depth added 3). This file's own header attributes it to another copyright holder, so it is code this repository carries rather than code it wrote: restructuring the body in place forks it from upstream and turns every future re-sync into a manual merge. The performable moves are to leave the body as close to its upstream form as possible and keep it behind a narrow interface of your own, and to re-sync it when upstream changes — or, if it has already diverged far enough that you maintain it here, adopt it deliberately and then split the body into named stages.
D2 · Cognitive Complexity · Environment.is_satisfied (cognitive 16) · ×1
  • Environment.is_satisfied (cognitive 16) REDACTED:737 — Environment.is_satisfied has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), boolean chains 4 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · ConfigOptionParser._update_defaults (cognitive 16) · ×1
  • ConfigOptionParser._update_defaults (cognitive 16) pipenv/patched/pip/_internal/cli/parser.py:265 — ConfigOptionParser._update_defaults has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (8 pts), boolean chains 3, error handling 1 (3 pts), loops 2 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · UninstallCommand.run (cognitive 16) · ×1
  • UninstallCommand.run (cognitive 16) pipenv/patched/pip/_internal/commands/uninstall.py:64 — UninstallCommand.run has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (11 pts), loops 4 (5 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · PipSession.is_secure_origin (cognitive 16) · ×1
  • PipSession.is_secure_origin (cognitive 16) pipenv/patched/pip/_internal/network/session.py:453 — PipSession.is_secure_origin has cognitive complexity 16 (threshold 15). Drivers by points: if/else 4 (9 pts), boolean chains 4, error handling 1 (2 pts), loops 1 (nesting depth added 6). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · wheel.message_about_scripts_not_on_PATH (cognitive 16) · ×1
  • wheel.message_about_scripts_not_on_PATH (cognitive 16) pipenv/patched/pip/_internal/operations/install/wheel.py:124 — wheel.message_about_scripts_not_on_PATH has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 2, boolean chains 1 (nesting depth added 2). To reduce it, split the body: most of this score is breadth rather than depth — checks laid out side by side rather than stacked — so group the statements between the checks into named steps and move each step into its own function. Some of it IS depth: where a check sits inside another whose only job is to reach it, merge the two into one condition, and where an else follows a branch that already returns, drop the trailing else and let the rest of the body continue at one level.
D2 · Cognitive Complexity · wheel.get_console_script_specs (cognitive 16) · ×1
  • wheel.get_console_script_specs (cognitive 16) pipenv/patched/pip/_internal/operations/install/wheel.py:272 — wheel.get_console_script_specs has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (12 pts), loops 2 (4 pts) (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · req_file.join_lines (cognitive 16) · ×1
  • req_file.join_lines (cognitive 16) pipenv/patched/pip/_internal/req/req_file.py:496 — req_file.join_lines has cognitive complexity 16 (threshold 15). Drivers by points: if/else 7 (14 pts), boolean chains 1, loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · InstallRequirement._format (cognitive 16) · ×1
  • InstallRequirement._format (cognitive 16) pipenv/patched/pip/_internal/req/req_install.py:196 — InstallRequirement._format has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), ternaries 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · pylock._package_dist_url (cognitive 16) · ×1
  • pylock._package_dist_url (cognitive 16) pipenv/patched/pip/_internal/utils/pylock.py:151 — pylock._package_dist_url has cognitive complexity 16 (threshold 15). Drivers by points: if/else 8 (16 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.
D2 · Cognitive Complexity · install._pip_args_for_dependency (cognitive 16) · ×1
  • install._pip_args_for_dependency (cognitive 16) pipenv/routines/install.py:197 — install._pip_args_for_dependency has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (10 pts), boolean chains 4, loops 1, ternaries 1 (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · dependencies.translate_markers (cognitive 16) · ×1
  • dependencies.translate_markers (cognitive 16) pipenv/utils/dependencies.py:177 — dependencies.translate_markers has cognitive complexity 16 (threshold 15). Drivers by points: if/else 6 (12 pts), ternaries 2 (3 pts), loops 1 (nesting depth added 7). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · fileutils.open_file (cognitive 16) · ×1
  • fileutils.open_file (cognitive 16) pipenv/utils/fileutils.py:143 — fileutils.open_file has cognitive complexity 16 (threshold 15). Drivers by points: if/else 10 (14 pts), error handling 1 (2 pts) (nesting depth added 5). To reduce it, split the body into named stages: move each independent step or branch into its own named function so the body reads as a short sequence of named calls rather than one long body.
D2 · Cognitive Complexity · Lockfile.__getitem__ (cognitive 16) · ×1
  • Lockfile.__getitem__ (cognitive 16) pipenv/utils/locking.py:257 — Lockfile.__getitem__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), 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.
D2 · Cognitive Complexity · locking.prepare_lockfile (cognitive 16) · ×1
  • locking.prepare_lockfile (cognitive 16) pipenv/utils/locking.py:76 — locking.prepare_lockfile has cognitive complexity 16 (threshold 15). Drivers by points: if/else 9 (15 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.
D2 · Cognitive Complexity · PlettePipfile.__getitem__ (cognitive 16) · ×1
  • PlettePipfile.__getitem__ (cognitive 16) pipenv/utils/pipfile.py:470 — PlettePipfile.__getitem__ has cognitive complexity 16 (threshold 15). Drivers by points: if/else 5 (15 pts), 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.
D2 · Cognitive Complexity · release.bump_version (cognitive 16) · ×1
  • release.bump_version (cognitive 16) tasks/release.py:251 — release.bump_version has cognitive complexity 16 (threshold 15). Drivers by points: if/else 11 (13 pts), loops 1 (2 pts), boolean chains 1 (nesting depth added 3). To reduce it, split the body: this score is breadth rather than depth — many checks laid out side by side rather than nested inside one another, so inverting conditions into early returns has nothing left to flatten. Group the statements between the checks into named steps and move each step into its own function, so the body reads as a short sequence of named stages.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D35 · Change Coupling · Change coupling · ×1
  • Change coupling: project.py ↔ toml.py pipenv/project.py:1 — `pipenv/project.py` and `pipenv/utils/toml.py` change together 50% of the time (6 of the 12 commits that touched whichever of the two files changed less often, counting a file under its earlier names as well, and counted over this repository's 10,000 most recent commits rather than its whole history — a repo-wide or module-wide sweep is evidence about the sweep rather than about any pair inside it and is left out of BOTH sides of this ratio, while a dependency bump, a formatter/rename sweep, or a commit whose edit to one of the two files was a tool directive such as //go:generate or whitespace only is left out of the shared count ONLY, so the two sides are not taken over identical commit sets) with no explicit dependency — the edge is real but nothing declares it. Read the pair before acting: if one registers itself into the other through a hook or an initialiser, the missing dependency is DELIBERATE — the registration is the link, and it is meant not to be an import — and the thing to add is a comment on each side naming the other, not a merge; if they simply belong together, co-locate them; if neither holds, the coupling is hidden and worth breaking. You can check this without leaving the row: of the 6 shared commits counted here, the most recent 3 are `367d44c2` chore: remove tomli from vendor; `472b1182` Fix inline table conversion; `7174609b` Fallback to tomli in older python versions — run `git show` on any of them.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
D4 · Code Duplication · Members sharing a duplicated core (5 members, 50+ identical tokens) · ×1
  • Members sharing a duplicated core (5 members, 50+ identical tokens) pipenv/patched/pip/_internal/commands/download.py:37 — pipenv/patched/pip/_internal/commands/download.py:37-77 | pipenv/patched/pip/_internal/commands/index.py:46-63 | pipenv/patched/pip/_internal/commands/install.py:341-535 | pipenv/patched/pip/_internal/commands/lock.py:49-94 | pipenv/patched/pip/_internal/commands/wheel.py:43-93 — These 5 members share a duplicated core: a run of at least 50 identical tokens appears in every one of them. That run is NOT broken out as duplicated-block rows below — it is what admitted this row, and the blocks below cover only the part of it that clears the block floor, so they understate the correspondence. Read the members as one construct written 5 times. The repair is at the members' grain — factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Extracting the individual blocks below is not the same fix: it leaves every body in place and the next edit still has to be made 5 times.
D4 · Code Duplication · Edited copy of a member (39 corresponding lines) · ×1
  • Edited copy of a member (39 corresponding lines) pipenv/resolver/main.py:133 — pipenv/resolver/main.py:133-175 | pipenv/resolver/schema.py:494-532 — These two members are one piece of code written twice and then edited apart: 39 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (37 corresponding lines) · ×1
  • Edited copy of a member (37 corresponding lines) REDACTED:63 — REDACTED:63-99 | REDACTED:374-413 — These two members are one piece of code written twice and then edited apart: 37 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (18 corresponding lines) · ×1
  • Edited copy of a member (18 corresponding lines) REDACTED:327 — REDACTED:327-356 | REDACTED:410-427 — These two members are one piece of code written twice and then edited apart: 18 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (20 corresponding lines) · ×1
  • Edited copy of a member (20 corresponding lines) pipenv/patched/pip/_internal/models/format_control.py:40 — pipenv/patched/pip/_internal/models/format_control.py:40-59 | pipenv/patched/pip/_internal/models/release_control.py:23-57 — These two members are one piece of code written twice and then edited apart: 20 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 32+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 32+ corresponding lines) pipenv/routines/audit.py:40 — pipenv/routines/audit.py:40-71 | pipenv/routines/check.py:165-201 | pipenv/routines/scan.py:247-279 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 32 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (24 corresponding lines) · ×1
  • Edited copy of a member (24 corresponding lines) pipenv/patched/pip/_internal/commands/cache.py:62 — pipenv/patched/pip/_internal/commands/cache.py:62-85 | pipenv/patched/pip/_internal/commands/index.py:71-94 — These two members are one piece of code written twice and then edited apart: 24 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (33 corresponding lines) · ×1
  • Edited copy of a member (33 corresponding lines) pipenv/patched/pip/_internal/operations/prepare.py:177 — pipenv/patched/pip/_internal/operations/prepare.py:177-209 | pipenv/utils/unpack.py:48-102 — These two members are one piece of code written twice and then edited apart: 33 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (9 corresponding lines) · ×1
  • Edited copy of a member (9 corresponding lines) pipenv/resolver/schema.py:878 — pipenv/resolver/schema.py:878-893 | pipenv/utils/locking.py:33-41 — These two members are one piece of code written twice and then edited apart: 9 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (28 corresponding lines) · ×1
  • Edited copy of a member (28 corresponding lines) pipenv/resolver/core.py:335 — pipenv/resolver/core.py:335-373 | REDACTED:151-178 — These two members are one piece of code written twice and then edited apart: 28 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copies of one member (3 members, 16+ corresponding lines) · ×1
  • Edited copies of one member (3 members, 16+ corresponding lines) pipenv/routines/audit.py:21 — pipenv/routines/audit.py:21-36 | pipenv/routines/check.py:143-161 | pipenv/routines/scan.py:225-243 — These 3 members are one piece of code written 3 times and then edited apart: every two of them correspond over at least 16 lines, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below: the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain. Factor the shared implementation out once and have all of them call it with their differences as parameters or as an injected step, or, where the difference is systematic, generate them from one template. Left alone, the next edit has to be made 3 times and the copies will drift further apart.
D4 · Code Duplication · Edited copy of a member (19 corresponding lines) · ×1
  • Edited copy of a member (19 corresponding lines) pipenv/patched/pip/_internal/cli/req_command.py:562 — pipenv/patched/pip/_internal/cli/req_command.py:562-582 | pipenv/patched/pip/_internal/commands/index.py:103-121 — These two members are one piece of code written twice and then edited apart: 19 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (7 corresponding lines) · ×1
  • Edited copy of a member (7 corresponding lines) pipenv/exceptions.py:123 — pipenv/exceptions.py:123-131 | pipenv/exceptions.py:204-210 — These two members are one piece of code written twice and then edited apart: 7 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (4 corresponding lines) · ×1
  • Edited copy of a member (4 corresponding lines) pipenv/patched/pip/_internal/vcs/bazaar.py:94 — pipenv/patched/pip/_internal/vcs/bazaar.py:94-97 | pipenv/patched/pip/_internal/vcs/subversion.py:92-95 — These two members are one piece of code written twice and then edited apart: 4 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Edited copy of a member (5 corresponding lines) · ×1
  • Edited copy of a member (5 corresponding lines) pipenv/patched/pip/_internal/resolution/resolvelib/candidates.py:175 — pipenv/patched/pip/_internal/resolution/resolvelib/candidates.py:175-179 | pipenv/patched/pip/_internal/resolution/resolvelib/requirements.py:185-189 — These two members are one piece of code written twice and then edited apart: 5 consecutive lines correspond almost exactly, broken only by small local edits. Most of that correspondence is NOT reported as duplicated blocks below — the edits cut it into fragments and only the largest of them clear the block floor, so the rows below understate it. The repair is at the members' grain — factor the shared implementation into one the two call with their differences as parameters or as an injected step, or, where the difference is systematic (an extra return value, one transport against another), generate one from the other. Left alone, the next edit has to be made twice and the two will drift further apart.
D4 · Code Duplication · Duplicated block (40–41 lines × 2) · ×1
  • Duplicated block (40–41 lines × 2) pipenv/routines/check.py:320 — pipenv/routines/check.py:320-360 | pipenv/routines/scan.py:369-408 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `pipenv/routines/check.py:320` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (36 lines × 2) · ×1
  • Duplicated block (36 lines × 2) pipenv/routines/check.py:224 — pipenv/routines/check.py:224-259 | pipenv/routines/scan.py:303-338 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (29 lines × 2) · ×1
  • Duplicated block (29 lines × 2) pipenv/utils/pipfile.py:153 — pipenv/utils/pipfile.py:153-181 | pipenv/utils/shell.py:147-175 — 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.
D4 · Code Duplication · Duplicated block (24–28 lines × 2) · ×1
  • Duplicated block (24–28 lines × 2) pipenv/resolver/auth.py:35 — pipenv/resolver/auth.py:35-62 | pipenv/utils/internet.py:180-203 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it. Note first that the copies are not typed on the same thing: the declarations holding them bind `url` to `str` in one and `Optional[str]` in another, and the duplicated lines use it. The extracted unit therefore needs a parameter type that fits BOTH — their common supertype where they have one, or a new abstraction over them where they do not — and settling that is the step that comes BEFORE the extraction above. Where the two types are deliberately unrelated, the duplication is the price of that separation and the honest resolution is to record the decision rather than to extract.
D4 · Code Duplication · Duplicated block (23–27 lines × 2) · ×1
  • Duplicated block (23–27 lines × 2) pipenv/resolver/pep691.py:1065 — pipenv/resolver/pep691.py:1065-1091 | pipenv/resolver/pure_python_metadata.py:759-781 — 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.
D4 · Code Duplication · Duplicated block (23 lines × 2) · ×1
  • Duplicated block (23 lines × 2) pipenv/routines/check.py:381 — pipenv/routines/check.py:381-403 | pipenv/routines/scan.py:415-437 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (17–22 lines × 2) · ×1
  • Duplicated block (17–22 lines × 2) pipenv/routines/audit.py:162 — pipenv/routines/audit.py:162-183 | pipenv/routines/scan.py:362-378 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (21 lines × 2) · ×1
  • Duplicated block (21 lines × 2) pipenv/patched/pip/_internal/operations/prepare.py:189 — pipenv/patched/pip/_internal/operations/prepare.py:189-209 | pipenv/utils/unpack.py:82-102 — the copies span different directories, so extracting a shared function means choosing where it lives: put it somewhere both call sites can already reach — a location they all depend on today, or a new shared one if there is none — and call it from each site; until then, every change has to be made twice. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (17–19 lines × 2) · ×1
  • Duplicated block (17–19 lines × 2) pipenv/patched/pip/_internal/commands/freeze.py:53 — pipenv/patched/pip/_internal/commands/freeze.py:53-69 | pipenv/patched/pip/_internal/commands/list.py:78-96 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once. Read the line range as the matched WINDOW rather than a finished unit: at `pipenv/patched/pip/_internal/commands/freeze.py:53` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (18–19 lines × 2) · ×1
  • Duplicated block (18–19 lines × 2) pipenv/patched/pip/_internal/commands/lock.py:116 — pipenv/patched/pip/_internal/commands/lock.py:116-134 | pipenv/patched/pip/_internal/commands/wheel.py:108-125 — 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 `pipenv/patched/pip/_internal/commands/lock.py:116` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (19 lines × 2) · ×1
  • Duplicated block (19 lines × 2) pipenv/routines/check.py:77 — pipenv/routines/check.py:77-95 | pipenv/routines/scan.py:163-181 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place.
D4 · Code Duplication · Duplicated block (18 lines × 2) · ×1
  • Duplicated block (18 lines × 2) pipenv/routines/check.py:99 — pipenv/routines/check.py:99-116 | pipenv/routines/scan.py:186-203 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (16–17 lines × 2) · ×1
  • Duplicated block (16–17 lines × 2) pipenv/patched/pip/_internal/commands/download.py:94 — pipenv/patched/pip/_internal/commands/download.py:94-110 | pipenv/patched/pip/_internal/commands/install.py:608-623 — the copies sit in sibling files of one directory, so a shared home is within easy reach: extract the block into a single shared function the call sites can all reach — a file they already depend on, or a new one alongside them — and call it from both call sites, so a change lands once.
D4 · Code Duplication · Duplicated block (17 lines × 2) · ×1
  • Duplicated block (17 lines × 2) pipenv/routines/check.py:143 — pipenv/routines/check.py:143-159 | pipenv/routines/scan.py:225-241 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (15–16 lines × 3) · ×1
  • Duplicated block (15–16 lines × 3) pipenv/routines/audit.py:22 — pipenv/routines/audit.py:22-36 | pipenv/routines/check.py:146-161 | pipenv/routines/scan.py:228-243 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. The matched lines also transfer control out of the body holding them, which cannot survive a move into a called unit unchanged: have the extracted unit return that decision and let each site act on it.
D4 · Code Duplication · Duplicated block (15–16 lines × 2) · ×1
  • Duplicated block (15–16 lines × 2) pipenv/cli/options.py:629 — pipenv/cli/options.py:629-644 | pipenv/cli/options.py:912-926 — both copies are in the same file, so extract the 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 `pipenv/cli/options.py:629` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (14–16 lines × 2) · ×1
  • Duplicated block (14–16 lines × 2) pipenv/routines/update.py:581 — pipenv/routines/update.py:581-596 | pipenv/routines/update.py:829-842 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (14 lines × 2) · ×1
  • Duplicated block (14 lines × 2) pipenv/routines/check.py:38 — pipenv/routines/check.py:38-51 | pipenv/routines/scan.py:52-65 — before extracting anything, compare `pipenv/routines/check.py` and `pipenv/routines/scan.py` as WHOLE FILES: this scan already matched 10 separate duplicated blocks between them, totalling at least 213 lines, which is the signature of one file having been copied from the other rather than of a helper waiting to be extracted. If that is what happened, the fix is to keep one copy and have the other call it (or delete it), which resolves this row and its siblings together — extracting one helper per block leaves the fork in place. Read the line range as the matched WINDOW rather than a finished unit: at `pipenv/routines/check.py:38` it begins part-way through the construct above it, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (13 lines × 5) · ×1
  • Duplicated block (13 lines × 5) pipenv/patched/pip/_internal/commands/download.py:65 — pipenv/patched/pip/_internal/commands/download.py:65-77 | pipenv/patched/pip/_internal/commands/index.py:51-63 | pipenv/patched/pip/_internal/commands/install.py:507-519 | pipenv/patched/pip/_internal/commands/lock.py:82-94 | pipenv/patched/pip/_internal/commands/wheel.py:81-93 — 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 5 call sites, so a change lands once. ★ These copies have DRIFTED, and that is worth reading before extracting anything: just before the matched lines, `pipenv/patched/pip/_internal/commands/install.py:505` calls `add_option`, `root_user_action` and `pipenv/patched/pip/_internal/commands/lock.py:80` does not — after which the two agree again for 3 more lines. One of those two behaviours is the intended one and the other is what a copy-paste left behind, so decide which BEFORE unifying them: extracting the shared part will silently settle it, and if the copy that skips the call is the wrong one, that bug is already live.
D4 · Code Duplication · Duplicated block (10–11 lines × 3) · ×1
  • Duplicated block (10–11 lines × 3) pipenv/utils/pipfile.py:1114 — pipenv/utils/pipfile.py:1114-1123 | pipenv/utils/pipfile.py:1180-1190 | pipenv/utils/pipfile.py:1204-1214 — all 3 copies are in the same file, so extract the block into one function there and call it from every one of those sites — resolving only two of them leaves the rest to drift apart the first time one is edited.
D4 · Code Duplication · Duplicated block (11 lines × 2) · ×1
  • Duplicated block (11 lines × 2) REDACTED:66 — REDACTED:66-76 | REDACTED:462-472 — both copies are in the same file, so extract the 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:66` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that.
D4 · Code Duplication · Duplicated block (8–11 lines × 2) · ×1
  • Duplicated block (8–11 lines × 2) pipenv/cli/options.py:784 — pipenv/cli/options.py:784-794 | pipenv/cli/options.py:932-939 — both copies are in the same file, so extract the 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 `pipenv/cli/options.py:784` it does not close everything it opens, so those exact lines cannot be lifted as they stand — widen the region to the smallest complete statement or declaration that contains it, and extract that. Note that the copies do not run to the end of the range shown: their LAST lines are different code, not the same code under different names — the matched region ends inside that line. Extract the lines above it, and read the last line of each site separately.
D4 · Code Duplication · Duplicated block (9–11 lines × 2) · ×1
  • Duplicated block (9–11 lines × 2) pipenv/resolver/pure_python_metadata.py:719 — pipenv/resolver/pure_python_metadata.py:719-727 | pipenv/resolver/pure_python_metadata.py:745-755 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited. The `return` at the foot of the matched lines is the enclosing body's own terminal exit, not an early one: it moves with them unchanged, and each site calls the extracted unit from the position that `return` occupied — no decision has to be handed back and re-acted on.
D4 · Code Duplication · Duplicated block (7 lines × 2) · ×1
  • Duplicated block (7 lines × 2) pipenv/cli/options.py:858 — pipenv/cli/options.py:858-864 | pipenv/cli/options.py:896-902 — both copies are in the same file, so extract the block into one function there and call it from each site — the copies drift apart the first time only one of them is edited.
D4 · Code Duplication · Duplicated block (5 lines × 2) · ×1
  • Duplicated block (5 lines × 2) pipenv/patched/pip/_internal/build_env/venv.py:125 — pipenv/patched/pip/_internal/build_env/venv.py:125-129 | pipenv/patched/pip/_internal/build_env/virtual.py:122-126 — 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.
P12 · CI test-gate honesty · Test failure does not fail the CI gate · ×1
  • Test failure does not fail the CI gate REDACTED:220 — `continue-on-error: true` lets the step or job that runs `pipenv run pytest -ra -n auto -v --fulltrace tests` fail without failing the pipeline — the suite can go red and the change still merges. Remove it from the test step, or quarantine the specific failing tests instead.
Minor — 42 finding(s)
D29 · Static Analysis (SAST) · REDACTED · ×7
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
  • REDACTED
X10 · Duplicated predicate · Duplicated predicate · ×6
  • Duplicated predicate pipenv/routines/lock.py:431 — `category != "default" and use_default_constraints` appears character-identically in 2 files — pipenv/routines/lock.py, pipenv/routines/update.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 pipenv/resolver/pep691.py:1089 — `isinstance(key, str) and key.lower() == name_lower` appears character-identically in 2 files — pipenv/resolver/pep691.py, pipenv/resolver/pure_python_metadata.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:41 — `not cache_dir or os.path.isabs(cache_dir)` appears character-identically in 2 files — REDACTED, pipenv/patched/pip/_internal/cli/index_command.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 pipenv/routines/install.py:816 — `not exec_opts.bare and not project.s.is_quiet()` appears character-identically in 2 files — pipenv/routines/install.py, pipenv/routines/sync.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 pipenv/resolver/auth.py:53 — `not parsed.username and not parsed.password` appears character-identically in 2 files — pipenv/resolver/auth.py, pipenv/utils/internet.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 pipenv/installers.py:175 — `sys.platform == "cli" and os.name == "nt"` appears character-identically in 2 files — pipenv/installers.py, pipenv/patched/pip/_internal/utils/compat.py. It is one line, so the duplication detector's token window never sees it; the copies drift when only one is corrected. Give the condition a name and one home.
X7 · Silent fallback defaults · Silent fallback default in catch · ×4
  • Silent fallback default in catch REDACTED:547 — `get_pipenv_version` swallows every exception into `return 'unknown'` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch pipenv/patched/pip/_vendor/pygments/util.py:128 — `text_analyse` (in `make_analysator`) swallows every exception into `return 0.0` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch pipenv/vendor/pythonfinder/finders/py_launcher_finder.py:85 — `_get_py_launcher_versions` swallows every exception into `return []` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default in catch pipenv/vendor/shellingham/posix/proc.py:38 — `_use_bsd_stat_format` swallows every exception into `return False` — a data error becomes a silent behavior change with no trail. Log the failure or let it raise. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
X7 · Silent fallback defaults · Silent fallback default on parse failure · ×3
  • Silent fallback default on parse failure pipenv/patched/pip/_internal/metadata/base.py:322 — `installer` returns `''` when `(OSError, ValueError, NoneMetadataError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure pipenv/utils/dependencies.py:1693 — `_new_container_like` returns `{}` when `TypeError` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
  • Silent fallback default on parse failure pipenv/utils/pylock.py:1195 — `_files_for_lockfile_hashes` returns `[]` when `(RequestException, ValueError, OSError)` is raised, with no log or raise — a malformed value silently becomes that default. Log the input or fail validation. If that constant is the correct answer rather than a stand-in for a value that could not be read, say so in a comment on the handler or in the docstring, and the row stops firing.
AX6 · Interface segregation · Fat interface · ×2
  • Fat interface: BaseDistribution (35 protocol members) pipenv/patched/pip/_internal/metadata/base.py:100 — `BaseDistribution` declares 35 protocol members: `from_directory`, `from_metadata_file_contents`, `from_wheel`, `location`, `editable_project_location`, `installed_location`, `info_location`, `installed_by_distutils`, `installed_as_egg`, `installed_with_setuptools_egg_info`, `installed_with_dist_info`, `canonical_name`, `version`, `raw_version`, `setuptools_filename`, `direct_url`, `installer`, `requested`, `editable`, `local`, `in_usersite`, `in_site_packages`, `is_file`, `iter_distutils_script_names`, `read_text`, `iter_entry_points`, `metadata`, `metadata_dict`, `metadata_version`, `raw_name`, `requires_python`, `iter_dependencies`, `iter_raw_dependencies`, `iter_provided_extras`, `iter_declared_entries`. Counted over its public methods and properties, once per name — a `typing.Protocol` is satisfied structurally, so every one of them is an operation each implementer must provide and each consumer depends on; `_`-prefixed members, static methods and data attributes are not counted, and an `@overload` family is one operation. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
  • Fat interface: PlatformDirsABC (27 abstract methods) pipenv/patched/pip/_vendor/platformdirs/api.py:17 — `PlatformDirsABC` declares 27 abstract methods: `user_data_dir`, `site_data_dir`, `user_config_dir`, `site_config_dir`, `user_cache_dir`, `site_cache_dir`, `user_state_dir`, `site_state_dir`, `user_log_dir`, `site_log_dir`, `user_documents_dir`, `user_downloads_dir`, `user_pictures_dir`, `user_videos_dir`, `user_music_dir`, `user_desktop_dir`, `user_projects_dir`, `user_publicshare_dir`, `user_templates_dir`, `user_fonts_dir`, `user_preference_dir`, `user_bin_dir`, `site_bin_dir`, `user_applications_dir`, `site_applications_dir`, `user_runtime_dir`, `site_runtime_dir`. Counted over its `@abstractmethod`s (and abstract properties), once per name; concrete methods are helpers an implementer inherits, not a burden, and `_`-prefixed members are not counted. A wide interface forces every implementer and caller to depend on methods they don't use (the Interface-Segregation 'I' in SOLID). Split it into focused role-interfaces.
D29 · Static Analysis (SAST) · REDACTED · ×2
  • REDACTED
  • REDACTED
D34 · Knowledge Freshness · Orphaned file · ×2
  • Orphaned file pipenv/utils/exceptions.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 pipenv/patched/pip/_internal/utils/compat.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.
M4 · Documentation accuracy · README/code drift · ×2
  • README/code drift docs/virtualenv.md:217 — docs/virtualenv.md names Python 3.10, but pyproject.toml:15 requires `requires-python = ">=3.11"`: the package does not install on Python 3.10. Checked without a model against the repository: its files and folders, the scripts and dependencies of every package.json, the projects, namespaces, package references and target frameworks of the .NET build, the SDK and Node pins, and the identifiers of every file that is not a document; the documents' own text never counts. A footprint generated at build time, read only by a platform, or living outside this repository is not seen, and this row is then wrong.
  • README/code drift docs/dev/initiative-f-typed-design.md:392 — docs/dev/initiative-f-typed-design.md names Python 3.10 or later, but pyproject.toml:15 requires `requires-python = ">=3.11"`: the package does not install on Python 3.10. 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.
X23 · Unguarded diagnostic materialisation · Diagnostic log message is built whether or not it is wanted · ×2
  • Diagnostic log message is built whether or not it is wanted pipenv/patched/pip/_internal/resolution/legacy/resolver.py:550 — `debug` at line 550 is called with an argument built by `"…".join(req_to_install.extras)` (line 552), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
  • Diagnostic log message is built whether or not it is wanted pipenv/patched/pip/_internal/index/collector.py:425 — `debug` at line 425 is called with an argument built by `"…".join(redact_auth_from_url(url) for url in index_urls)` (line 427), whose cost grows with the collection it walks. Python evaluates a call's arguments BEFORE entering the method, so that join/projection runs in full every time this line is reached — and then the level check inside the logger discards the string it produced, because debug is a level a shipped configuration normally leaves off. Nothing here decides beforehand whether the message is wanted: no `isEnabledFor(logging.DEBUG)` test, no debug flag, no `lambda` the logger calls only when the level is on.
D16 · Bus Factor · Off-boarding risk · ×1
  • Off-boarding risk: anonymized user #1 — If anonymized user #1 becomes unavailable, 35 significant file(s) lose their only recent owner: pipenv/resolver/pure_python_provider.py, pipenv/patched/pip/_internal/index/package_finder.py, pipenv/resolver/pep691.py, pipenv/resolver/backends/pure_python.py, pipenv/patched/pip/_internal/resolution/resolvelib/factory.py, pipenv/patched/pip/_internal/req/req_install.py, pipenv/resolver/pure_python_metadata.py, REDACTED (+27 more). Pair on, review, or document these before any departure.
D26 · Project Cohesion · Projects may be oversized for their cohesion · ×1
  • Projects may be oversized for their cohesion pyproject.toml:1 — `(repository root)` (89113 LoC, 1585 module-visible types across 83 directories) overshoots its size bounds. 1 of 2 build unit(s) (Python) overshoot their size bounds, lowering Project Cohesion to 0.0/10. 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.
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D29 · Static Analysis (SAST) · REDACTED · ×1
  • REDACTED
D34 · Knowledge Freshness · Orphaned files with no living knowledge · ×1
  • Orphaned files with no living knowledge — 2 of 182 analysed file(s) have no living knowledge left — their last meaningful change has decayed away, so if one breaks, no one currently understands it (counted over production source files of roughly 2,400 bytes or more, excluding vendored, generated, example/demo and scaffolding-template trees and test files identified by path convention, largest first; 182 of the 243 production source files in this repository met that bar). None is large enough to earn a read-through of its own, so this row stands in for the per-file rows rather than raising one each — most significant first: pipenv/utils/exceptions.py, pipenv/patched/pip/_internal/utils/compat.py. Attach the read to the next change that touches one of them: have a second person review that change, and leave behind a short comment or test recording what the file is for, so the knowledge comes back at the cost of a change you were making anyway.
D36 · Supply-chain Provenance & Signing · REDACTED · ×1
  • REDACTED
M2 · Architecture documentation · No ADRs · ×1
  • No ADRs — No Architecture Decision Records found — no conventional ADR directory, no numbered `NNNN-title` documents in any markup this check reads, and nothing ADR-shaped by content. Design rationale recorded elsewhere (a design-notes tree, a mailing list, pull-request discussion) is not visible to this check and is not re-findable per decision, so a future maintainer cannot ask why one choice was made and get an answer.
M3 · Folder & project structure · No src/ separation · ×1
  • No src/ separation — Most of the production code is in directories of its own, but 1 application file(s) sit at the repository root beside the build and tooling files (`get-pipenv.py`).
P3 · Security & performance tooling · No SAST · ×1
  • No SAST REDACTED:27 — No static application security testing detected. For this repository's stack, add bandit, `semgrep --config=p/python`, or CodeQL's python pack as a CI step. What was searched, so you can tell an absence from a miss: the 3 CI workflow file(s) in this repository, and the scanner and linter configuration checked in beside them. A scan that runs outside CI, one configured in your forge's web UI rather than in a committed file, or a tool whose name is none of those this check carries, is not seen — if that is your case the row is wrong, and saying so is more useful than adding a second scanner.
P3 · Security & performance tooling · No dependency-update automation · ×1
  • No dependency-update automation pyproject.toml:31 — `pyproject.toml` declares packages, and nothing in the repository keeps them current: no Dependabot or Renovate configuration that schedules updates, and no dependency-review gate on pull requests. A pinned dependency stays at the version it was added at until someone notices — including after an advisory is published against it. Add a `.github/dependabot.yml` with one `package-ecosystem` entry per ecosystem the tree uses (or an enabled `renovate.json`), and gate pull requests with `actions/dependency-review-action`.
P4 · Deployment & Rollback · No release approval gate · ×1
  • No release approval gate REDACTED:34 — The release is automated and no gate that pauses it for a human is DECLARED IN THIS REPOSITORY'S PIPELINE FILES. What was read: every file under `.github/workflows/`, `.forgejo/workflows/`, `.gitea/workflows/`, `.azuredevops/` and `.azure-pipelines/`, plus `.gitlab-ci*` and `azure-pipelines*` — with comment text stripped, so documenting a gate is not declaring one. What would have counted: GitLab's `when: manual`, CircleCI's `type: approval`, an Azure `ManualValidation@` task or an `approvals:` block, a Jenkins `input` step, a `uses:` step naming an approval action, an `environment:` paired with `reviewers` / `required_reviewers` / `protection` / `wait-timer` / `deployment_branch_policy`, a draft-release step, a `workflow_dispatch` promotion, or a release-event gate. ★ What this cannot see, because none of it is a file: a GitHub environment whose required reviewers are configured in repo SETTINGS, a branch protection rule, or an organisation deployment policy — all of them real, enforced gates that live outside the repository. If yours is one of those, this row is wrong and nothing in the tree could have told us. Otherwise: whatever the release trigger points at is published to users unreviewed, so a mistagged or unverified commit ships and the only remedy is a follow-up release.
X6 · Hand-rolled structured-format parsing · Hand-rolled JSON/XML parsing via regex · ×1
  • Hand-rolled JSON/XML parsing via regex pipenv/patched/pip/_internal/vcs/subversion.py:28 — 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.
Minor — 1 finding(s)
D12 · Dependency Hygiene · Dependency hygiene PARTLY measured · ×1
  • Dependency hygiene PARTLY measured — Python dependencies read, no exact pin to grade for currency — This repository's Python dependencies were read: 5 shipped distribution(s) across 2 manifest(s) (13 development or optional declaration(s) excluded, because a consumer does not install them). Whether any of them is behind its current release is the dependency-CURRENCY question, and no declaration here carries an EXACT pin to ask it about — every one is a floor or a range, which installs the newest release it admits and therefore cannot be behind one. That is a healthy declaration style, NOT a defect and NOT a gap in this analyzer; there is simply no currency question to answer. This is NOT a finding that these dependencies are current or healthy. Lockfiles are deliberately not read (poetry.lock, uv.lock, Pipfile.lock, pdm.lock): the four disagree about dev/optional membership, and misreading one would charge a test-only package a consumer never receives. Known CVEs in the same dependency graph are a separate question, reported under D30.

Appendix B — Reproduction & audit trail

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

DimensionToolVersionCommandFindingsRaw output
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=0 --max-count=200" --report-format json --report-path /tmp/watchdog-gitleaks-8026ac18d5f141c1a9168f96eb577077/history.json --exit-code 0 --source .0artifacts/raw/gitleaks-history.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=200 --max-count=800" --report-format json --report-path /tmp/watchdog-gitleaks-8026ac18d5f141c1a9168f96eb577077/history-1.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-1.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=1000 --max-count=3200" --report-format json --report-path /tmp/watchdog-gitleaks-8026ac18d5f141c1a9168f96eb577077/history-2.json --exit-code 0 --source .2artifacts/raw/gitleaks-history-2.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --log-opts "--full-history --all --skip=4200 --max-count=6089" --report-format json --report-path /tmp/watchdog-gitleaks-8026ac18d5f141c1a9168f96eb577077/history-3.json --exit-code 0 --source .0artifacts/raw/gitleaks-history-3.json
D28 · Secrets (history)gitleaks—gitleaks detect --no-git --no-banner --config /opt/gitleaks-rules/canine-gitleaks.toml --report-format json --report-path /tmp/watchdog-gitleaks-8026ac18d5f141c1a9168f96eb577077/tree.json --exit-code 0 --source .0artifacts/raw/gitleaks-tree.json
D29 · Static Analysis (SAST)semgrep—semgrep --config /opt/semgrep-rules/security-audit.yml --config /opt/semgrep-rules/owasp-top-ten.yml --config /opt/semgrep-rules/canine-sast.yml --json --quiet --timeout 10 --timeout-threshold 3 --metrics off --exclude *.arrow --exclude *.avro --exclude *.csv --exclude *.dat --exclude *.db --exclude *.feather --exclude *.geojson --exclude *.h5 --exclude *.hdf5 --exclude *.jsonl --exclude *.log --exclude *.ndjson --exclude *.npy --exclude *.npz --exclude *.orc --exclude *.parquet --exclude *.pickle --exclude *.pkl --exclude *.psv --exclude *.sqlite --exclude *.sqlite3 --exclude *.tfrecord --exclude *.tsv --exclude *.txt .59artifacts/raw/semgrep.json
D30 · Dependency Vulnerabilitiesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .6artifacts/raw/osv-scanner.json
D31 · IaC & Container Securitytrivy—trivy config --format json --quiet .0artifacts/raw/trivy-config.json
D32 · Data Compliance (PII/GDPR)semgrep—semgrep: not applicable — No personal data was found crossing a boundary the PII/GDPR ruleset checks — nothing written to a log or console sink, placed in a URL or query string, or persisted to browser storage. That is a clean result for the LEAK surface only: this ruleset detects personal data escaping, it does not inventory the personal data a repository holds, so it is not evidence that this repository has no personal-data surface. The personal-data map (Appendix C) and the C1-C5 compliance cards are what speak to that.0—
D40 · Network Egress Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; network egress policy is a cluster-native control that may live at the platform/firewall layer, so there is nothing to assess here.0—
D41 · Kernel & Syscall Confinementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; seccomp/AppArmor/SELinux confinement is a workload-level control, so there is nothing to assess here.0—
D42 · Runtime Threat Enforcementruntime-hardening—runtime-hardening: not applicable — No Kubernetes/orchestration workloads found in the repository manifests; runtime threat-detection and admission-control policy are cluster-level controls, so there is nothing to assess here.0—
D43 · Malicious Dependenciesosv-scanner—osv-scanner --format json --recursive --experimental-disable-plugins transitivedependency/requirements --experimental-disable-plugins dotnet/csproj --experimental-disable-plugins dotnet/nugetcpm .0artifacts/raw/osv-scanner.json

Run 01a1e545-a40d-7833-8a0b-308689bfdd23 · every finding is also locatable in findings.md, and the complete scoring record (with exit codes + durations) in sidecar.json.

Downloadable artifacts

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

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